Lossless Seeds for Searching Short Patterns with High Error Rates

DOI10.1007/978-3-319-19315-1_32zbMath1401.68259OpenAlexW2270771709MaRDI QIDQ2946072

Christophe Vroland, Hélène Touzet, Mikaël Salson

Publication date: 15 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_32

Mathematics Subject Classification ID

Combinatorics on words (68R15) Genetics and epigenetics (92D10) Algorithms on strings (68W32)

Related Items (1)

Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear size index for approximate pattern matching
• Text indexing with errors
• Approximate string matching with compressed indexes
• Fast and practical approximate string matching
• Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
• Compressed representations of sequences and full-text indexes
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Indexing compressed text
• Bidirectional Search in a String with Wavelet Trees
• Compressed text indexes

This page was built for publication: Lossless Seeds for Searching Short Patterns with High Error Rates