Results 171 to 180 of about 40,875 (196)
Some of the next articles are maybe not open access.
Suffix trees and string complexity
2007Let s = (s1, s2, ..., sn) be a sequence of characters where si Ɛ Zp for 1 ≤ i ≤ n. One measure of the complexity of the sequence s is the length of the shortest feedback shift register that will generate s, which is known as the maximum order complexity of s [17, 18].
Luke O'Connor, Tim Snider
openaire +1 more source
A Study on Suffix Trees and Their Applications in Genome Sequences Using MUMmer
Lecture Notes on Data Engineering and Communications Technologies, 2021Azath MubarakAli, Ninoslav Marina
exaly
Bidirectional construction of suffix trees
Nord. J. Comput., 2004Summary: String matching is critical in information retrieval since in many cases information is stored and manipulated as strings. Constructing and utilizing a suitable data structure for a text string, we can solve the string matching problem efficiently. Such a structure is called an index structure.
openaire +2 more sources
Reducing the space requirement of suffix trees
Software - Practice and Experience, 1999Stefan Kurtz
exaly
Suffix trees for inputs larger than main memory
Information Systems, 2011Marina Barsky, Alex Thomo
exaly
Suffix Trees as Language Models.
2019Suffix trees are data structures that can be used to index a corpus. In this paper, we explore how some properties of suffix trees naturally provide the functionality of an n-gram language model with variable n. We explain these properties of suffix trees, which we leverage for our Suffix Tree Language Model (STLM) implementation and explain how a ...
Redd Kennington, Casey +2 more
openaire +2 more sources
Faster Compressed Suffix Trees for Repetitive Collections
Journal of Experimental Algorithmics, 2016Gonzalo Navarro
exaly
Compressed Suffix Trees with Full Functionality
Theory of Computing Systems, 2007Kunihiko Sadakane
exaly
Faster entropy-bounded compressed suffix trees
Theoretical Computer Science, 2009Veli Mäkinen, Gonzalo Navarro
exaly