Two Efficient Algorithms for Linear Time Suffix Array Construction

DOI10.1109/TC.2010.188zbMath1368.68192MaRDI QIDQ5280510

Sen Zhang, Ge Nong, Wai Hong Chan

Publication date: 27 July 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (22)

Faster average case low memory semi-external construction of the Burrows-Wheeler transform ⋮ r-indexing the eBWT ⋮ Grammar index by induced suffix sorting ⋮ Computing the original eBWT faster, simpler, and with less memory ⋮ Optimal suffix sorting and LCP array construction for constant alphabets ⋮ Can Burrows-Wheeler transform be replaced in chain code compression? ⋮ Efficient computation of substring equivalence classes with suffix arrays ⋮ Kings, Name Days, Lazy Servants and Magic ⋮ A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm ⋮ Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform ⋮ Optimal in-place suffix sorting ⋮ An Opportunistic Text Indexing Structure Based on Run Length Encoding ⋮ Compressed parameterized pattern matching ⋮ Efficient chain code compression with interpolative coding ⋮ Sensitivity of string compressors and repetitiveness measures ⋮ Constructing and indexing the bijective and extended Burrows-Wheeler transform ⋮ The parameterized suffix tray ⋮ Using static suffix array in dynamic application: case of text compression by longest first substitution ⋮ On the string matching with \(k\) mismatches ⋮ Inducing enhanced suffix arrays for string collections ⋮ Inducing Suffix and LCP Arrays in External Memory ⋮ LCP Array Construction in External Memory

This page was built for publication: Two Efficient Algorithms for Linear Time Suffix Array Construction