Lossless seeds for searching short patterns with high error rates

DOI10.1007/978-3-319-19315-1_32MaRDI QIDQ2946072zbMATH OpenOpenAlexFDO

Authors Christophe Vroland, H. Touzet, M. 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) Algorithms on strings (68W32) Genetics and epigenetics (92D10)

Recommendations

• Approximate search of short patterns with high error rates using the 01^ 0 lossless seeds
• Faster approximate string matching for short patterns
• A new filtration method and a hybrid strategy for approximate string matching
• A linear size index for approximate pattern matching
• scientific article; zbMATH DE number 1342989

Cites work

• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• A linear size index for approximate pattern matching
• Approximate string matching with compressed indexes
• Bidirectional search in a string with wavelet trees
• Compressed representations of sequences and full-text indexes
• Compressed text indexes, from theory to practice
• Fast and practical approximate string matching
• scientific article; zbMATH DE number 1615292 (Why is no real title available?)
• scientific article; zbMATH DE number 2086228 (Why is no real title available?)
• scientific article; zbMATH DE number 2052917 (Why is no real title available?)
• Indexing compressed text
• Text indexing with errors
• Versatile succinct representations of the bidirectional Burrows-Wheeler transform

Cited in

(1)

• Approximate search of short patterns with high error rates using the 01^ 0 lossless seeds

This page was built for publication: Lossless seeds for searching short patterns with high error rates

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