Substring

Results: 165



#Item
31Pass-Join: A Partition-based Method for Similarity Joins Guoliang Li Dong Deng  Jiannan Wang

Pass-Join: A Partition-based Method for Similarity Joins Guoliang Li Dong Deng Jiannan Wang

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2014-11-20 04:43:42
321  Fast Kernels for String and Tree Matching S.V.N. Vishwanathan Machine Learning Program

1 Fast Kernels for String and Tree Matching S.V.N. Vishwanathan Machine Learning Program

Add to Reading List

Source URL: www.stat.purdue.edu

Language: English - Date: 2008-09-11 13:00:17
33A Partition-Based Method for String Similarity Joins with Edit-Distance Constraints GUOLIANG LI, DONG DENG, and JIANHUA FENG, Tsinghua University As an essential operation in data cleaning, the similarity join has attrac

A Partition-Based Method for String Similarity Joins with Edit-Distance Constraints GUOLIANG LI, DONG DENG, and JIANHUA FENG, Tsinghua University As an essential operation in data cleaning, the similarity join has attrac

Add to Reading List

Source URL: dbgroup.cs.tsinghua.edu.cn

Language: English - Date: 2013-12-23 20:29:32
34Extracting Key-Substring-Group Features for Text Classification Dell Zhang Wee Sun Lee

Extracting Key-Substring-Group Features for Text Classification Dell Zhang Wee Sun Lee

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2007-01-22 02:12:59
35Package ‘Biostrings’ May 21, 2015 Title String objects representing biological sequences, and matching algorithms Description Memory efficient string containers, string matching algorithms, and other utilities, for f

Package ‘Biostrings’ May 21, 2015 Title String objects representing biological sequences, and matching algorithms Description Memory efficient string containers, string matching algorithms, and other utilities, for f

Add to Reading List

Source URL: bioconductor.org

Language: English - Date: 2015-05-25 12:15:06
36New Graph Model for Consistent Superstring Problems Kunsoo Park Seoul National University Joint work with J.C. Na, S.H. Cho, S. Choi, J.W.

New Graph Model for Consistent Superstring Problems Kunsoo Park Seoul National University Joint work with J.C. Na, S.H. Cho, S. Choi, J.W.

Add to Reading List

Source URL: iwoca2013.colloques.univ-rouen.fr

Language: English - Date: 2013-10-01 05:31:50
37Least Random Suffix/Prefix Matches in Output-Sensitive Time Niko Välimäki Department of Computer Science University of Helsinki

Least Random Suffix/Prefix Matches in Output-Sensitive Time Niko Välimäki Department of Computer Science University of Helsinki

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2012-12-29 15:27:02
38Sublinear Algorithms for Parameterized Matching  Sublinear Algorithms for Parameterized Matching Leena Salmela  Jorma Tarhio

Sublinear Algorithms for Parameterized Matching Sublinear Algorithms for Parameterized Matching Leena Salmela Jorma Tarhio

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2006-07-03 03:41:02
39Substring Range Reporting Philip Bille Inge Li Gørtz Outline • Problem definition

Substring Range Reporting Philip Bille Inge Li Gørtz Outline • Problem definition

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2011-09-23 10:28:46
40Computing minimal and maximal suffixes of a substring revisited Maxim Babenko1 Pawel Gawrychowski2 Tomasz Kociumaka3 Tatiana Starikovskaya1 National Research University Higher School of Economics (HSE) Max-Planck-Institu

Computing minimal and maximal suffixes of a substring revisited Maxim Babenko1 Pawel Gawrychowski2 Tomasz Kociumaka3 Tatiana Starikovskaya1 National Research University Higher School of Economics (HSE) Max-Planck-Institu

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2014-06-18 11:22:46