Matching regular expressions on uncertain data

DOI10.1007/S00453-021-00906-8OpenAlexW4205687939MaRDI QIDQ832529FDOQ832529

Authors: José Arturo Gil, Simone Santini 

Publication date: 25 March 2022

Published in: Algorithmica (Search for Journal in Brave)

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

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

zbMATH Keywords

uncertaintyevent detectionnoisy dataregular expression

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Handbook of weighted automata
• Faster approximate string matching
• The theory and computation of evolutionary distances: Pattern recognition
• Title not available (Why is that?)
• An Improved Algorithm For Approximate String Matching
• Finding approximate patterns in strings
• Title not available (Why is that?)
• Regular languages with variables on graphs
• Programming Techniques: Regular expression search algorithm
• Title not available (Why is that?)
• A subquadratic algorithm for approximate limited expression matching
• Title not available (Why is that?)

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)