74 search results - page 1 / 15 » Improved Approximate String Matching Using Compressed Suffix... |
ALGORITHMICA
2008
13 years 10 months ago
2008
CPM
2006
Springer
14 years 2 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 ...
111
click to vote
VLDB
2002
ACM
14 years 11 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...
FOCS
2009
IEEE
14 years 2 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...
IJFCS
2006
13 years 11 months ago
2006
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...