The affix array data structure and its applications to RNA secondary structure analysis
From MaRDI portal
Publication:2465645
DOI10.1016/J.TCS.2007.09.029zbMATH Open1146.68358OpenAlexW1981549166MaRDI QIDQ2465645FDOQ2465645
Authors: Dirk Strothmann 
Publication date: 7 January 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.09.029
Recommendations
Cites Work
- Compressed representations of sequences and full-text indexes
- Suffix Arrays: A New Method for On-Line String Searches
- A Space-Economical Suffix Tree Construction Algorithm
- Linear-time construction of suffix arrays (extended abstract)
- Pattern Discovery in RNA Secondary Structure Using Affix Trees
- Algorithms for pattern matching and discovery in RNA secondary structure
- Replacing suffix trees with enhanced suffix arrays
- Title not available (Why is that?)
- Computing suffix links for suffix trees and arrays
- Title not available (Why is that?)
Cited In (8)
- Title not available (Why is that?)
- Bidirectional search in a string with wavelet trees
- Bidirectional search in a string with wavelet trees and bidirectional matching statistics
- Elastic founder graphs improved and enhanced
- Title not available (Why is that?)
- Pattern Discovery in RNA Secondary Structure Using Affix Trees
- Efficient pattern matching for RNA secondary structures
- EERTREE: an efficient data structure for processing palindromes in strings
Uses Software
This page was built for publication: The affix array data structure and its applications to RNA secondary structure analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465645)
