Generic non-recursive suffix array construction

DOI10.1145/3641854MaRDI QIDQ7023562zbMATH OpenFDO

Authors Jannik Olbrich, Enno Ohlebusch, Thomas Büchler

Publication date 21 February 2025

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3641854

zbMATH Keywords

bijective Burrows-Wheeler transformstring algorithmssuffix arraysuffix sorting

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) Algorithms on strings (68W32)

Cites work

• A theoretical and experimental analysis of BWT variants for string collections
• Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
• Combinatorial Pattern Matching
• Computing the original eBWT faster, simpler, and with less memory
• Efficient algorithm for circular Burrows-Wheeler transform
• Factorizing words over an ordered alphabet
• Fast canonization of circular strings
• Free differential calculus. IV: The quotient groups of the lower central series
• scientific article; zbMATH DE number 432779 (Why is no real title available?)
• scientific article; zbMATH DE number 7695993 (Why is no real title available?)
• Inducing suffix and LCP arrays in external memory
• Linear-time suffix sorting -- a new approach for suffix array construction
• Lyndon Words Accelerate Suffix Sorting.
• On the optimisation of the GSACA suffix array construction algorithm
• Optimal in-place suffix sorting
• Parallel External Memory Suffix Sorting
• Parallel lightweight wavelet tree, suffix array and FM-index construction
• Parallel suffix sorting for large string analytics
• Sorting conjugates and suffixes of words in a multiset
• Space efficient linear time construction of suffix arrays

Cited in

(2)

• Sorting circular suffixes in linear time
• Fast and memory-efficient bwt construction of repetitive texts using Lyndon grammars

This page was built for publication: Generic non-recursive suffix array construction

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