B Haubold - Briefings in bioinformatics, 2014 - academic.oup.com
Phylogenetics and population genetics are central disciplines in evolutionary biology. Both are based on comparative data, today usually DNA sequences. These have become so …
W Wang, G Haberer, H Gundlach, C Gläßer… - Nature …, 2014 - nature.com
The subfamily of the Lemnoideae belongs to a different order than other monocotyledonous species that have been sequenced and comprises aquatic plants that grow rapidly on the …
MI Abouelhoda, S Kurtz, E Ohlebusch - Journal of discrete algorithms, 2004 - Elsevier
The suffix tree is one of the most important data structures in string processing and comparative genomics. However, the space consumption of the suffix tree is a bottleneck in …
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space …
J Kärkkäinen, P Sanders - … ICALP 2003 Eindhoven, The Netherlands, June …, 2003 - Springer
A suffix array represents the suffixes of a string in sorted order. Being a simpler and more compact alternative to suffix trees, it is an important tool for full text indexing and other string …
Although there are many advanced and specialized texts and handbooks on algorithms, until now there was no book that focused exclusively on the wide variety of data structures …
P Ko, S Aluru - Annual Symposium on Combinatorial Pattern Matching, 2003 - Springer
We present a linear time algorithm to sort all the suffixes of a string over a large alphabet of integers. The sorted order of suffixes of a string is also called suffix array, a data structure …
DK Kim, JS Sim, H Park, K Park - … Morelia, Michoacán, Mexico, June 25–27 …, 2003 - Springer
The time complexity of suffix tree construction has been shown to be equivalent to that of sorting: O (n) for a constant-size alphabet or an integer alphabet and O (n log n) for a …
P Ko, S Aluru - Journal of Discrete Algorithms, 2005 - Elsevier
We present a linear time algorithm to sort all the suffixes of a string over a large alphabet of integers. The sorted order of suffixes of a string is also called suffix array, a data structure …