Indexed multi-pattern matching

DOI10.1007/978-3-642-29344-3_34zbMATH Open1353.68067OpenAlexW124780335MaRDI QIDQ2894483FDOQ2894483

Authors: Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela, Jorma Tarhio 

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

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

Recommendations

• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• Self-indexing based on LZ77
• Approximate string matching with compressed indexes
• Indexing compressed text

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Cited In (6)

• Multi-pattern matching with bidirectional indexes
• Multi-pattern matching with bidirectional indexes
• Multiple matching of parameterized patterns
• String Indexing with Compressed Patterns
• LZ77-based self-indexing with faster pattern matching
• Higher-order associative commutative pattern matching for component retrieval

This page was built for publication: Indexed multi-pattern matching

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