scientific article
From MaRDI portal
Publication:3690247
zbMath0572.68069MaRDI QIDQ3690247
No author found.
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (21)
Dynamic dictionary matching with failure functions ⋮ Online timestamped text indexing ⋮ Construction of Aho Corasick automaton in linear time for integer alphabets ⋮ Fast string matching with k differences ⋮ 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) ⋮ The suffix tree of a tree and minimizing sequential transducers ⋮ Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ Parallel construction of minimal suffix and factor automata ⋮ Multiple matching of parameterized patterns ⋮ Generalized function matching ⋮ On-line construction of two-dimensional suffix trees ⋮ On finding common subtrees ⋮ Two-dimensional dictionary matching ⋮ On-line construction of compact directed acyclic word graphs ⋮ On average sequence complexity ⋮ On suffix extensions in suffix trees ⋮ Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays ⋮ Approximation algorithms for the shortest common superstring problem ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ The smallest automaton recognizing the subwords of a text
This page was built for publication:
