Bidirectional Search in a String with Wavelet Trees

DOI10.1007/978-3-642-13509-5_5zbMath1286.68533OpenAlexW1549037892MaRDI QIDQ3575235

Thomas Schnattinger, Enno Ohlebusch, Simon Gog

Publication date: 26 July 2010

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13509-5_5

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10) Algorithms on strings (68W32)

Related Items (6)

Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds ⋮ Lossless Seeds for Searching Short Patterns with High Error Rates ⋮ Compressed indexes for text with wildcards ⋮ Multi-pattern matching with bidirectional indexes ⋮ Wavelet trees for all ⋮ Computing the Burrows-Wheeler transform of a string and its reverse in parallel

This page was built for publication: Bidirectional Search in a String with Wavelet Trees