Results 161 to 170 of about 6,253 (207)

Infant gut microbiota coverage by different culture media. [PDF]

BMC Microbiol
Dhar GA, Koster H, van Beek N, Korpela K.   +3 more
europepmc   +1 more source

A suffix tree or not a suffix tree? [PDF]

Journal of Discrete Algorithms, 2015
Full version.
Tatiana Starikovskaya, Hjalte Wedel Vildhøj   +1 more
exaly   +7 more sources

The suffix binary search tree and suffix AVL tree [PDF]

Journal of Discrete Algorithms, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert W Irving
exaly   +3 more sources

On Suffix Tree Breadth [PDF]

Lecture Notes in Computer Science, 2017
The suffix tree—the compacted trie of all the suffixes of a string—is the most important and widely-used data structure in string processing. We consider a natural combinatorial question about suffix trees: for a string S of length n, how many nodes νS(d) can there be at (string) depth d in its suffix tree? We prove ν(n,d)=maxS∈ΣnνS(d) is O((n/d)logn) ,
Simon Puglisi, Juha Kärkkäinen, Kärkkäinen Juha   +2 more
exaly   +5 more sources

Replacing suffix trees with enhanced suffix arrays [PDF]

Journal of Discrete Algorithms, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan Kurtz, Enno Ohlebusch
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

On Suffix Tree Detection

Lecture Notes in Computer Science, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Avivit Levy, Amihood Amir, Eitan Kondratovsky   +2 more
exaly   +2 more sources

Faster Suffix Tree Construction with Missing Suffix Links [PDF]

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.
Ramesh Hariharan, Richard Cole
exaly   +1 more source

From Suffix Trees to Suffix Vectors

International Journal of Foundations of Computer Science, 2006
We 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   +4 more sources

Constructing suffix tree for gigabyte sequences with megabyte memory [PDF]

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