773 search results - page 7 / 155 » Suffix Trees on Words |
ESA
1998
Springer
15 years 1 months ago
1998
Springer
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
65
Voted
ISAAC
2001
Springer
15 years 2 months ago
2001
Springer
158
click to vote
SIGMOD
2007
ACM
15 years 9 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...
96
Voted
ICDE
2007
IEEE
15 years 1 months ago
2007
IEEE
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
FOCS
2009
IEEE
15 years 1 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...