Bidirectional search in a string with wavelet trees and bidirectional matching statistics

DOI10.1016/j.ic.2011.03.007zbMath1237.92048OpenAlexW2061474902MaRDI QIDQ418161

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

zbMATH Keywords

string matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items

Approximate string matching using a bidirectional index, Bidirectional Variable-Order de Bruijn Graphs, Longest Common Prefix with Mismatches, Algorithms and complexity on indexing founder graphs, Searching and Indexing Circular Patterns, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Replacing suffix trees with enhanced suffix arrays
• Sublinear approximate string matching and biological applications
• Linear bidirectional on-line construction of affix trees
• Rank and select revisited and extended
• The affix array data structure and its applications to RNA secondary structure analysis
• Compressed representations of sequences and full-text indexes
• Suffix Arrays: A New Method for On-Line String Searches
• A Compressed Enhanced Suffix Array Supporting Fast String Matching
• Pattern Discovery in RNA Secondary Structure Using Affix Trees