34 search results - page 1 / 7 » Exact match search in sequence data using suffix trees |
CIKM
2005
Springer
13 years 10 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
FCCM
2011
IEEE
12 years 8 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
BIRD
2008
Springer
13 years 6 months ago
2008
Springer
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
VLDB
2002
ACM
14 years 5 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...