Lossless seeds for searching short patterns with high error rates

DOI10.1007/978-3-319-19315-1_32zbMATH Open1401.68259OpenAlexW2270771709MaRDI QIDQ2946072FDOQ2946072

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

Recommendations

• Approximate search of short patterns with high error rates using the \(01^\ast 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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Approximate search of short patterns with high error rates using the \(01^\ast 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)