A practical semi-external memory method for approximate pattern matching

DOI10.1016/j.entcs.2016.09.010zbMath1364.68382OpenAlexW2529807795WikidataQ113317663 ScholiaQ113317663MaRDI QIDQ529654

Mauricio Ayala-Rincón, Daniel Saad Nogueira Nunes

Publication date: 19 May 2017

Full work available at URL: https://doi.org/10.1016/j.entcs.2016.09.010

zbMATH Keywords

approximate pattern matchingLandau-Vishkin algorithmsemi-external memory methodspace-efficient algorithmstring-matching

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Cites Work

• The longest common extension problem revisited and applications to approximate string searching
• A faster algorithm computing string edit distances
• Suffix Arrays: A New Method for On-Line String Searches
• Approximate String Matching: A Simpler Faster Algorithm
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• Algorithms for approximate string matching
• The theory and computation of evolutionary distances: Pattern recognition
• A linear space algorithm for computing maximal common subsequences
• Fast parallel and serial approximate string matching
• Algorithms on Strings, Trees and Sequences
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A practical semi-external memory method for approximate pattern matching