Checking Big Suffix and LCP Arrays by Probabilistic Methods

DOI10.1109/TC.2017.2702642MaRDI QIDQ4567209zbMATH OpenOpenAlexFDO

Authors Yi Wu, Ge Nong, W. H. Chan, Ling Bo Han

Publication date 27 June 2018

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

Full work available at URL https://doi.org/10.1109/tc.2017.2702642

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Fast lightweight suffix array construction and checking
• Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
• A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm
• Optimal suffix sorting and LCP array construction for constant alphabets
• scientific article; zbMATH DE number 1786458
• On the combinatorics of suffix arrays
• Randomized partial checking revisited
• Verifying an enhanced cover array in linear time
• scientific article; zbMATH DE number 7651114
• Lower bounds on lengths of checking sequences

Cited in

(1)

• A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm

This page was built for publication: Checking Big Suffix and LCP Arrays by Probabilistic Methods

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