Results 171 to 180 of about 1,070,371 (211)
Some of the next articles are maybe not open access.
From Suffix Trees to Suffix Vectors
International Journal of Foundations of Computer Science, 2006We present a first formal setting for suffix vectors that are space economical alternative data structures to suffix trees. We give two linear algorithms for converting a suffix tree into a suffix vector and conversely. We enrich suffix vectors with formulas for counting the number of occurrences of repeated substrings.
Élise Prieur, Thierry Lecroq
openaire +5 more sources
International Journal of Foundations of Computer Science, 2009
We introduce the VST (virtual suffix tree), an efficient data structure for suffix trees and suffix arrays. Starting from the suffix array, we construct the suffix tree, from which we derive the virtual suffix tree. Later, we remove the intermediate step of suffix tree construction, and build the VST directly from the suffix array. The VST provides the
Jie Lin +2 more
openaire +1 more source
We introduce the VST (virtual suffix tree), an efficient data structure for suffix trees and suffix arrays. Starting from the suffix array, we construct the suffix tree, from which we derive the virtual suffix tree. Later, we remove the intermediate step of suffix tree construction, and build the VST directly from the suffix array. The VST provides the
Jie Lin +2 more
openaire +1 more source
Faster Suffix Tree Construction with Missing Suffix Links
SIAM Journal on Computing, 2003 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 for two-dimensional arrays.
Hariharan Ramesh
exaly +1 more source
Algorithmica, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arne Andersson +2 more
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arne Andersson +2 more
openaire +3 more sources
Replacing suffix trees with enhanced suffix arrays
Journal of Discrete Algorithms, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan Kurtz, Enno Ohlebusch
exaly +2 more sources
1996
A sparse suffix tree is a suffix tree that represents only a subset of the suffixes of the text. This is in contrast to the standard suffix tree that represents all suffixes. By selecting a small enough subset, a sparse suffix tree can be made to fit the available storage, unfortunately at the cost of increased search times.
Juha Kärkkäinen, Esko Ukkonen
openaire +2 more sources
A sparse suffix tree is a suffix tree that represents only a subset of the suffixes of the text. This is in contrast to the standard suffix tree that represents all suffixes. By selecting a small enough subset, a sparse suffix tree can be made to fit the available storage, unfortunately at the cost of increased search times.
Juha Kärkkäinen, Esko Ukkonen
openaire +2 more sources
REACHABILITY ON SUFFIX TREE GRAPHS
International Journal of Foundations of Computer Science, 2008We analyze the complexity of graph reachability queries on ST-graphs, defined as directed acyclic graphs (DAGs) obtained by merging the suffix tree of a given string and its suffix links. Using a simplified reachability labeling algorithm presented by Agrawal et al. (1989), we show that for a random string of length n, its ST-graph can be preprocessed
Yasuto Higa +3 more
openaire +3 more sources
A Note on the Height of Suffix Trees
SIAM Journal on Computing, 1992Summary: Consider a random word in which the individual symbols are drawn from a finite or infinite alphabet with symbol probabilities \(p_ i\), and let \(H_ n\) be the height of the suffix tree constructed from the first \(n\) suffixes of this word.
Devroye, Luc +2 more
openaire +3 more sources
Journal of Algorithms, 1998
Summary: We give first the representation of a suffix tree that uses \(n\lg n+ O(n)\) bits of space and supports searching for a pattern string in the given text (from a fixed size alphabet) in \(O(m)\) time, where \(n\) is the size of the text and \(m\) is the length of the pattern.
J. Ian Munro +2 more
openaire +3 more sources
Summary: We give first the representation of a suffix tree that uses \(n\lg n+ O(n)\) bits of space and supports searching for a pattern string in the given text (from a fixed size alphabet) in \(O(m)\) time, where \(n\) is the size of the text and \(m\) is the length of the pattern.
J. Ian Munro +2 more
openaire +3 more sources
Constructing suffix tree for gigabyte sequences with megabyte memory
IEEE Transactions on Knowledge and Data Engineering, 2005 Mammalian genomes are typically 3Gbps (gibabase pairs) in size. The largest public database NCBI (National Center for Biotechnology Information (http://www.ncbi.nlm.nih.gov)) of DNA contains more than 20 Gbps.
Jeffrey Xu Yu, Hongjun Lu
exaly +2 more sources