Approximate Periods with Levenshtein Distance

DOI10.1007/978-3-540-70844-5_30MaRDI QIDQ3602824zbMATH OpenOpenAlexFDO

Authors Martin Šimůnek, Bořivoj Melichar

Publication date 12 February 2009

Published in Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70844-5_30

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 1303588
• Finding approximate patterns in strings
• Approximate Periodicity
• Approximate String Matching: A Simpler Faster Algorithm
• scientific article; zbMATH DE number 7360012

Cites work

• Approximate periods of strings

Cited in

(1)

• Study on massive-scale slow-hash recovery using unified probabilistic context-free grammar and symmetrical collaborative prioritization with parallel machines

This page was built for publication: Approximate Periods with Levenshtein Distance

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