Approximate string matching using factor automata

Authors:
Jan Holub;Bořivoj Melichar
Affiliations:
Department of Computer Science and Engineering, Czech Technical University, Prague, Czech Republic;Department of Computer Science and Engineering, Czech Technical University, Prague, Czech Republic
Venue:
Theoretical Computer Science
Year:
2000

On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
Real-Time String Filtering of Large Databases Implemented Via a Combination of Artificial Neural Networks

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics
DAWG versus suffix array

CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Special factors and the combinatorics of suffix and factor automata

Theoretical Computer Science
Finding common motifs with gaps using finite automata

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata

Hi-index	5.23