Approximate string matching using factor automata

DOI10.1016/S0304-3975(00)00064-5MaRDI QIDQ1583536zbMATH OpenOpenAlexFDO

Authors Jan Holub, Bořivoj Melichar

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)

Recommendations

• Approximate string matching with suffix automata
• Fast string matching with k differences
• Combinatorial Pattern Matching
• Approximate string matching using compressed suffix arrays
• Publication:4733401

Cites work

• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Algorithms for approximate string matching
• Approximate string matching using factor automata
• Complete inverted files for efficient text retrieval and analysis

Cited in

(8)

• Approximate string matching with suffix automata
• scientific article; zbMATH DE number 1045407 (Why is no real title available?)
• Special factors and the combinatorics of suffix and factor automata
• The finite automata approaches in stringology
• Weighted automata for full-text indexing
• An artificial neural network based approach for online string matching/filtering of large databases
• On-line construction of compact directed acyclic word graphs
• Approximate string matching using factor automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583536)