19 search results - page 4 / 4 » Approximate Stroke Sequence String Matching Algorithm for Ch... |
SWAT
2004
Springer
13 years 11 months ago
2004
Springer
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
CIKM
2008
Springer
13 years 7 months ago
2008
Springer
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
BMCBI
2004
13 years 5 months ago
2004
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
BMCBI
2006
13 years 5 months ago
2006
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...