The following pages link to (Q3690247):
Displayed 21 items.
- Online timestamped text indexing (Q294884) (← links)
- Multiple matching of parameterized patterns (Q672748) (← links)
- On average sequence complexity (Q703547) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- Construction of Aho Corasick automaton in linear time for integer alphabets (Q844159) (← links)
- Parallel construction of minimal suffix and factor automata (Q911778) (← links)
- Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays (Q1006380) (← links)
- The smallest automaton recognizing the subwords of a text (Q1063423) (← links)
- Fast string matching with k differences (Q1109574) (← links)
- La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time) (Q1115203) (← links)
- The suffix tree of a tree and minimizing sequential transducers (Q1127317) (← links)
- On finding common subtrees (Q1208722) (← links)
- Two-dimensional dictionary matching (Q1209347) (← links)
- Dynamic dictionary matching with failure functions (Q1331942) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q1401328) (← links)
- On-line construction of compact directed acyclic word graphs (Q1764897) (← links)
- Approximation algorithms for the shortest common superstring problem (Q1822981) (← links)
- Generalized function matching (Q2466014) (← links)
- On-line construction of two-dimensional suffix trees (Q5906373) (← links)
- Generalizations of suffix arrays to multi-dimensional matrices. (Q5967094) (← links)
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)