Results 191 to 200 of about 679,088 (213)
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
On-line construction of suffix trees
Algorithmica, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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, 2021Ninoslav Marina
exaly
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
Journal of the ACM, 2020G Navarro +2 more
exaly
Suffix trees for inputs larger than main memory
Information Systems, 2011Marina Barsky, Alex Thomo
exaly
Bidirectional construction of suffix trees
Nord. J. Comput., 2003Summary: 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 +3 more sources
Reducing the space requirement of suffix trees
Software - Practice and Experience, 1999Stefan Kurtz
exaly
Inferring strings from suffix trees and links on a binary alphabet
Discrete Applied Mathematics, 2014Tomohiro I +2 more
exaly
Compressed Suffix Trees with Full Functionality
Theory of Computing Systems, 2007Kunihiko Sadakane
exaly