Approximate regular expression matching with multi-strings

DOI10.1016/J.JDA.2012.07.008MaRDI QIDQ2376798zbMATH OpenOpenAlexFDO

Authors Djamal Belazzougui, Mathieu Raffinot

Publication date 24 June 2013

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2012.07.008

zbMATH Keywords

edit distanceapproximate pattern matchingregular expressionThompson's automaton

Mathematics Subject Classification ID

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

Recommendations

• Approximate matching of regular expressions
• Multiple approximate string matching
• Regular expression matching with multi-strings and intervals
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 3845091
• Fast and compact regular expression matching
• Fast and practical approximate string matching
• Average-optimal multiple approximate string matching

Cited in

(8)

• Multiple approximate string matching
• Matching regular expressions on uncertain data
• scientific article; zbMATH DE number 2149350 (Why is no real title available?)
• Approximate matching of regular expressions
• Derivatives of approximate regular expressions
• Algorithms and Computation
• Regular expression matching with multi-strings and intervals
• Fast and compact regular expression matching

This page was built for publication: Approximate regular expression matching with multi-strings

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