53 search results - page 2 / 11 » A Fast Bit-Vector Algorithm for Approximate String Matching ... |
AAAI
2010
13 years 6 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
ICDE
2012
IEEE
11 years 7 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
ASAP
2004
IEEE
13 years 8 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
BMCBI
2006
13 years 4 months ago
2006
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....