53 search results - page 2 / 11 » Practical methods for constructing suffix trees |
VLDB
2004
ACM
13 years 11 months ago
2004
ACM
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...
SIGMOD
2007
ACM
14 years 5 months ago
2007
ACM
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
CPM
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
ICMCS
2009
IEEE
13 years 3 months ago
2009
IEEE
This paper presents an efficient way to construct the self-similarity matrix, a popular approach, to detect repeating segments in music. Our proposed method extends the sparse suf...