Multi-pattern matching with bidirectional indexes
From MaRDI portal
Publication:396713
DOI10.1016/j.jda.2013.03.007zbMath1334.68318OpenAlexW2026586144MaRDI QIDQ396713
Simon Gog, Kalle Karhu, Niko Välimäki, Veli Mäkinen, Juha Kärkkäinen
Publication date: 13 August 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2013.03.007
Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20) Data structures (68P05) Algorithms on strings (68W32)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Succinct data structures for flexible text retrieval systems
- Faster entropy-bounded compressed suffix trees
- Linear bidirectional on-line construction of affix trees
- Compressed suffix trees with full functionality
- On the Common Substring Alignment Problem
- Indexed Multi-pattern Matching
- Multi-pattern Matching with Bidirectional Indexes
- Compressed representations of sequences and full-text indexes
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Fully compressed suffix trees
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Indexing compressed text
- Unified View of Backward Backtracking in Short Read Mapping
- Bidirectional Search in a String with Wavelet Trees
