13 search results - page 2 / 3 » Generalized Mongue-Elkan Method for Approximate Text String ... |
AIRS
2004
Springer
13 years 10 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
CPM
1998
Springer
13 years 9 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
JCDL
2011
ACM
12 years 8 months ago
2011
ACM
Various approaches for plagiarism detection exist. All are based on more or less sophisticated text analysis methods such as string matching, fingerprinting or style comparison. I...
ICPR
2010
IEEE
13 years 8 months ago
2010
IEEE
We present a general, simple feature representation of sequences that allows efficient inexact matching, comparison and classification of sequential data. This approach, recently ...
STOC
2000
ACM
13 years 9 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...