4 search results - page 1 / 1 » Faster suffix tree construction with missing suffix links |
STOC
2000
ACM
13 years 9 months ago
2000
ACM
Abstract. We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees...
TCS
2008
13 years 5 months ago
2008
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
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 8 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...