Results 181 to 190 of about 58,956 (207)
Some of the next articles are maybe not open access.
On-line construction of suffix trees
Algorithmica, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
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
Tight upper and lower bounds on suffix tree breadth
Theoretical Computer Science, 2021Simon J Puglisi
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
On the sorting-complexity of suffix tree construction
Journal of the ACM, 2000Martin Farach-Colton, Paolo Ferragina
exaly
A suffix tree approach to anti-spam email filtering
Machine Learning, 2006Boris G Mirkin, Mark Levene
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
Generalization of a Suffix Tree for RNA Structural Pattern Matching
Algorithmica, 2003Tetsuo Shibuya
exaly
DGST: Efficient and scalable suffix tree construction on distributed data-parallel platforms
Parallel Computing, 2019Rong Gu
exaly