A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array

2007/09/14 by Johannes Fischer, Volker Heun · 56 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Algorithm #Algorithms and Data Compression #Combinatorics #Compressed suffix array #Computer science #Constant (computer programming) #DNA and Biological Computing #Data structure #Generalized suffix tree #Genomics and Phylogenetic Studies #Mathematics #Representation (politics) #Suffix #Suffix array #Suffix tree #Upper and lower bounds

paper · doi:10.1007/978-3-540-74450-4_41

published in Lecture Notes in Computer Science, 459-470 (Springer Berlin Heidelberg)

openalex publication_date 2007/09/14 · crossref created 2007/09/14 · crossref deposited 2021/04/27 · openalex created_date 2025/10/10 · crossref indexed 2026/02/13 · openalex updated_date 2026/08/04

Citations

• Lowest common ancestors in trees and directed acyclic graphs
• Scaling and related techniques for geometry problems
• An Efficient Parallel Biconnectivity Algorithm
• Recursive Star-Tree Parallel Data Structure
• Replacing suffix trees with enhanced suffix arrays
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• Suffix Arrays: A New Method for On-Line String Searches

Cited by

• Cartesian tree [wikipedia]