Results 191 to 200 of about 1,070,371 (211)
Some of the next articles are maybe not open access.
Tight upper and lower bounds on suffix tree breadth
Theoretical Computer Science, 2021Golnaz Badkobeh +2 more
exaly
On the sorting-complexity of suffix tree construction
Journal of the ACM, 2000Paolo Ferragina +2 more
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
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, Chunfeng Yuan
exaly
Counter based suffix tree for DNA pattern repeats
Theoretical Computer Science, 2020Dimane Mpoeleng
exaly
A taxonomy of suffix array construction algorithms
ACM Computing Surveys, 2007Simon Puglisi, W F Smyth
exaly
A suffix tree approach to anti-spam email filtering
Machine Learning, 2006Boris Mirkin, Mark Levene
exaly