Data structures for efficient string algorithms.

MaRDI QIDQ3521160zbMATH OpenFDO

Authors Johannes Fischer

Publication date 20 August 2008

Full work available at URL http://edoc.ub.uni-muenchen.de/7505/

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• Space-efficient preprocessing schemes for range minimum queries on static arrays
• Two-Dimensional Range Minimum Queries
• Optimal succinctness for range minimum queries

Cited in

(8)

• Encodings of range maximum-sum segment queries and applications
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• scientific article; zbMATH DE number 1982178 (Why is no real title available?)
• Construction of Fundamental Data Structures for Strings
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• String Processing and Information Retrieval
• Encodings for range minimum queries over bounded alphabets
• Encodings for range minimum queries over bounded alphabets

This page was built for publication: Data structures for efficient string algorithms.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521160)