Engineering a lightweight suffix array construction algorithm (extended abstract)

DOI10.1007/3-540-45749-6_61MaRDI QIDQ4411402zbMATH OpenFDO

Authors Giovanni Manzini, Paolo Ferragina

Publication date 8 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610698.htm

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for text processing; mathematical typography (68U15)

Recommendations

• Engineering a lightweight suffix array construction algorithm
• An elegant algorithm for the construction of suffix arrays
• Space efficient linear time construction of suffix arrays
• Engineering a lightweight external memory suffix array construction algorithm
• Linear work suffix array construction

Cited in

(11)

• Engineering a lightweight suffix array construction algorithm
• Optimal in-place suffix sorting
• RECONSTRUCTING A SUFFIX ARRAY
• Fast lightweight suffix array construction and checking
• Lightweight parameterized suffix array construction
• Scalable Parallel Suffix Array Construction
• External memory BWT and LCP computation for sequence collections with applications
• Lightweight BWT and LCP merging via the gap algorithm
• Lightweight distributed suffix array construction
• A quick tour on suffix arrays and compressed suffix arrays
• Counting suffix arrays and strings

This page was built for publication: Engineering a lightweight suffix array construction algorithm (extended abstract)

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