Matching regular expressions on uncertain data

DOI10.1007/S00453-021-00906-8MaRDI QIDQ832529zbMATH OpenOpenAlexFDO

Authors José Arturo Gil, Simone Santini

Publication date 25 March 2022

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00453-021-00906-8

zbMATH Keywords

uncertaintyevent detectionnoisy dataregular expression

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Recommendations

• New Algorithms for Regular Expression Matching
• Faster Regular Expression Matching
• Approximate regular expression matching with multi-strings
• Fast and compact regular expression matching
• A Subquadratic Algorithm for Approximate Regular Expression Matching

Cites work

• scientific article; zbMATH DE number 3888931 (Why is no real title available?)
• scientific article; zbMATH DE number 43003 (Why is no real title available?)
• scientific article; zbMATH DE number 3492660 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 3328724 (Why is no real title available?)
• A subquadratic algorithm for approximate limited expression matching
• An Improved Algorithm For Approximate String Matching
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Faster approximate string matching
• Finding approximate patterns in strings
• Handbook of weighted automata
• Programming Techniques: Regular expression search algorithm
• Regular languages with variables on graphs
• The theory and computation of evolutionary distances: Pattern recognition

Describes a project that uses

Uses Software

• VERL

This page was built for publication: Matching regular expressions on uncertain data

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