Engineering a lightweight suffix array construction algorithm

DOI10.1007/S00453-004-1094-1MaRDI QIDQ1882475zbMATH OpenOpenAlexFDO

Authors Giovanni Manzini, Paolo Ferragina

Publication date 1 October 2004

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-004-1094-1

zbMATH Keywords

Suffix arraySuffix treeAlgorithmic engineeringFull-text indexSpace-economical algorithms

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1947433
• An elegant algorithm for the construction of suffix arrays
• Fast lightweight suffix array construction and checking
• Linear work suffix array construction
• Engineering a lightweight external memory suffix array construction algorithm

Cited in

(29)

• Suffix-sorting via Shannon-Fano-Elias codes
• Parallel suffix sorting for large string analytics
• scientific article; zbMATH DE number 1947433 (Why is no real title available?)
• Space-efficient construction of Lempel-Ziv compressed text indexes
• On the number of elements to reorder when updating a suffix array
• On-line suffix tree construction with reduced branching
• Inducing suffix and LCP arrays in external memory
• Engineering a lightweight external memory suffix array construction algorithm
• Suffix sorting via matching statistics
• Algorithms for indexing highly similar DNA sequences
• Lightweight parameterized suffix array construction
• p-suffix sorting as arithmetic coding
• Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays
• The longest common extension problem revisited and applications to approximate string searching
• Fast lightweight suffix array construction and checking
• Lightweight distributed suffix array construction
• In-place update of suffix array while recoding words
• Fast BWT in small space by blockwise suffix sorting
• An elegant algorithm for the construction of suffix arrays
• A simpler analysis of Burrows-Wheeler-based compression
• Faster suffix sorting
• Fast and Lightweight LCP-Array Construction Algorithms
• Linear Time Suffix Array Construction Using D-Critical Substrings
• On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
• Fast, practical algorithms for computing all the repeats in a string
• The alternating BWT: an algorithmic perspective
• Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets
• RECONSTRUCTING A SUFFIX ARRAY
• Space efficient algorithms for the Burrows-Wheeler backtransformation

This page was built for publication: Engineering a lightweight suffix array construction algorithm

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