Pattern matching with non overlapping reversals -- approximation and on-line algorithms

DOI10.1007/978-3-642-45030-3_6MaRDI QIDQ2872071zbMATHOpenAlexFDO

Authors Amihood Amir, Benny Porat

Publication date 14 January 2014

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45030-3_6

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Mathematical Foundations of Computer Science 2005
• Combinatorial Pattern Matching
• Efficient string-matching allowing for non-overlapping inversions
• Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
• Approximate On-line Palindrome Recognition, and Applications

Cited in

(5)

• scientific article; zbMATH DE number 7695989 (Why is no real title available?)
• Space lower bounds for online pattern matching
• On pattern matching with \(k\) mismatches and few don't cares
• Space Lower Bounds for Online Pattern Matching
• On-Line Pattern Matching on Uncertain Sequences and Applications

This page was built for publication: Pattern matching with non overlapping reversals -- approximation and on-line algorithms

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