Approximate string matching using factor automata

DOI10.1016/S0304-3975(00)00064-5zbMath0949.68088OpenAlexW2033276056MaRDI QIDQ1583536

Bořivoj Melichar, Jan Holub

Publication date: 26 October 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00064-5

zbMATH Keywords

finite automataapproximate pattern matchingDAWGfactor automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

An artificial neural network based approach for online string matching/filtering of large databases ⋮ WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING ⋮ On-line construction of compact directed acyclic word graphs ⋮ Special factors and the combinatorics of suffix and factor automata ⋮ Unnamed Item ⋮ Approximate string matching using factor automata

Cites Work

• Approximate string matching using factor automata
• Algorithms for approximate string matching
• Complete inverted files for efficient text retrieval and analysis
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate string matching using factor automata