122 search results - page 9 / 25 » The approximability of the String Barcoding problem |
173
click to vote
CPM
1999
Springer
15 years 10 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
163
Voted
PR
1998
15 years 6 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
175
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
162
Voted
RSA
2002
15 years 6 months ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
152
click to vote
SPIRE
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...