132 search results - page 3 / 27 » A Linear Size Index for Approximate Pattern Matching |
SPIRE
2007
Springer
14 years 1 months 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...
APPROX
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
BMCBI
2011
12 years 11 months ago
2011
Background: The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching dat...
BMCBI
2006
13 years 7 months ago
2006
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...