10 search results - page 2 / 2 » Indexing Variable Length Substrings for Exact and Approximat... |
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
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...
WABI
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. With Next Generation Sequencers, sequence based transcriptomic or epigenomic assays yield millions of short sequence reads that need to be mapped back on a reference geno...
LATA
2010
Springer
13 years 10 months ago
2010
Springer
With the advent of new sequencing technologies able to produce an enormous quantity of short genomic sequences, new tools able to search for them inside a references sequence genom...
PODS
2010
ACM
13 years 10 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...