Approximate string matching using factor automata

DOI10.1016/S0304-3975(00)00064-5zbMATH Open0949.68088OpenAlexW2033276056MaRDI QIDQ1583536FDOQ1583536

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

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

zbMATH Keywords

finite automataapproximate pattern matchingDAWGfactor automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms for approximate string matching
• Complete inverted files for efficient text retrieval and analysis
• Approximate string matching using factor automata

Cited In (8)

• The finite automata approaches in stringology
• Special factors and the combinatorics of suffix and factor automata
• Approximate string matching with suffix automata
• Title not available (Why is that?)
• Approximate string matching using factor automata
• Weighted automata for full-text indexing
• On-line construction of compact directed acyclic word graphs
• An artificial neural network based approach for online string matching/filtering of large databases

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)