Results 161 to 170 of about 301,848 (186)
Some of the next articles are maybe not open access.
2014
The suffix tree is one of the oldest full-text inverted indexes and one of the most persistent subjects of study in the theory of algorithms. With extensions and refinements, including succinct and compressed variants that provide some of its expressive power in smaller space, it constitutes a fundamental conceptual tool in the design of string ...
Alberto Apostolico, Fabio Cunial
openaire +1 more source
The suffix tree is one of the oldest full-text inverted indexes and one of the most persistent subjects of study in the theory of algorithms. With extensions and refinements, including succinct and compressed variants that provide some of its expressive power in smaller space, it constitutes a fundamental conceptual tool in the design of string ...
Alberto Apostolico, Fabio Cunial
openaire +1 more source
Suffix Arrays: A New Method for On-Line String Searches
SIAM Journal on Computing, 1993Eugene Myers, Udi Manber
exaly
Robust Record Linkage Blocking Using Suffix Arrays and Bloom Filters
ACM Transactions on Knowledge Discovery From Data, 2011Peter Christen
exaly
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
SIAM Journal on Computing, 2005Roberto Grossi
exaly
Secure Compressed Suffix Arrays.
This paper proposes a secure compressed suffix array, which is a data oblivious and compressed version of the suffix array used for finding substrings of a large string. Secure compressed suffix arrays can be used for indexing a large collection of strings containing personal information such as DNA data.openaire +2 more sources