Bidirectional search in a string with wavelet trees and bidirectional matching statistics
From MaRDI portal
Publication:418161
DOI10.1016/J.IC.2011.03.007zbMATH Open1237.92048OpenAlexW2061474902MaRDI QIDQ418161FDOQ418161
Thomas Schnattinger, Enno Ohlebusch, Simon Gog
Publication date: 24 May 2012
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2011.03.007
Recommendations
Protein sequences, DNA sequences (92D20) Searching and sorting (68P10) Algorithms on strings (68W32)
Cites Work
- Compressed representations of sequences and full-text indexes
- Suffix Arrays: A New Method for On-Line String Searches
- Title not available (Why is that?)
- Sublinear approximate string matching and biological applications
- Rank and select revisited and extended
- Title not available (Why is that?)
- Pattern Discovery in RNA Secondary Structure Using Affix Trees
- Linear bidirectional on-line construction of affix trees
- Replacing suffix trees with enhanced suffix arrays
- The affix array data structure and its applications to RNA secondary structure analysis
- A Compressed Enhanced Suffix Array Supporting Fast String Matching
Cited In (7)
- Title not available (Why is that?)
- Linear time construction of indexable founder block graphs
- Approximate string matching using a bidirectional index
- Searching and Indexing Circular Patterns
- Bidirectional Variable-Order de Bruijn Graphs
- Algorithms and complexity on indexing founder graphs
- Longest Common Prefix with Mismatches
This page was built for publication: Bidirectional search in a string with wavelet trees and bidirectional matching statistics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418161)
