Results 91 to 100 of about 301,848 (186)
Constructing compressed suffix arrays with large alphabets
, 2003 Recent research in compressing suffix arrays has resulted in two breakthrough indexing data structures, namely, compressed suffix arrays (CSA) [7] and FM-index [5]. Either of them makes it feasible to store a full-text index in the main memory even for a
Lam, T.-W. +11 more
core +1 more source
The suffix binary search tree and suffix AVL tree
, 2000 Suffix trees and suffix arrays are classical data structures that are used to represent the set of suffixes of a given string, and thereby facilitate the efficient solution of various string processing problems --- in particular online string searching ...
Love, L., Irving, R.
core +4 more sources
Using Suffix Arrays to Compute Term Frequency and Document Frequency for All Substrings in a Corpus
Computational Linguistics, 2021 Mikio Yamamoto, Kenneth W. Church
doaj +1 more source
Suffix Tree Construction and Storage with Limited Main Memory [PDF]
, 2003 Schürmann K-B, Stoye J. Suffix Tree Construction and Storage with Limited Main Memory. Forschungsberichte. Bielefeld: Technische Fakultät der Universität Bielefeld; 2003.Suffix trees have been established as one of the most versatile index structures for
Schürmann, Klaus-Bernd +1 more
core
On arithmetically progressed suffix arrays and related Burrows–Wheeler transforms [PDF]
We characterize those strings whose suffix arrays are based on arithmetic progressions, in particular, arithmetically progressed permutations where all pairs of successive entries of the permutation have the same difference modulo the respective string ...
Köppl, Dominik +3 more
core +1 more source
Compressed Suffix Arrays for Massive Data [PDF]
, 2009 We present a fast space-efficient algorithm for constructing compressed suffix arrays (CSA). The algorithm requires O (n logn ) time in the worst case, and only O (n ) bits of extra space in addition to the CSA. As the basic step, we describe an algorithm for merging two CSAs.
openaire +2 more sources
The Suffix Tree Data Structure: Theory and Practice
openLa tesi affronta lo studio delle strutture dati per l’indicizzazione di stringhe, concentrandosi sui Suffix Tree e, in particolarmente sulla sua variante compressa: Compressed Suffix Tree.
YE, XIAOJUN
core
A frequent max substring technique for Thai text indexing [PDF]
, 2011 This research details the development of a novel methodology, called the frequent max substring technique, for extracting indexing terms and constructing an index for Thai text documents.
Chumwatana, Todsanai
core
Bitpacking techniques for indexing genomes: II. Enhanced suffix arrays. [PDF]
Algorithms Mol Biol, 2016 Wu TD.
europepmc +1 more source
Constructing compressed suffix arrays with large alphabets
, 2012 [[abstract]]Recent research in compressing suffix arrays has resulted in two breakthrough indexing data structures, namely, compressed suffix arrays (CSA) [7] and FM-index [5].
HON Wing-Kai;LAM Tak-Wah;SADAKANE Kunihiko;SUNG Wing-Kin
core