论文信息 - Optimal suffix sorting and LCP array construction for constant alphabets

Optimal suffix sorting and LCP array construction for constant alphabets

Abstract We show how the longest common prefix (LCP) array can be generated as a by-product of the suffix array construction algorithm SACA-K (Nong, 2013). Our algorithm builds on Fischer's proposal (Fischer, WADS'11), and also runs in linear time, but uses only constant extra memory for constant alphabets.

[1] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.

[2] Enno Ohlebusch,et al. Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction , 2013 .

[3] Juha Kärkkäinen,et al. Permuted Longest-Common-Prefix Array , 2009, CPM.

[4] Srinivas Aluru,et al. Space efficient linear time construction of suffix arrays , 2005, J. Discrete Algorithms.

[5] Ge Nong,et al. Practical linear-time O(1)-workspace suffix sorting for constant alphabets , 2013, TOIS.

[6] Hiroki Arimura,et al. Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications , 2001, CPM.

[7] Sen Zhang,et al. Two Efficient Algorithms for Linear Time Suffix Array Construction , 2011, IEEE Transactions on Computers.

[8] Enno Ohlebusch,et al. Fast and Lightweight LCP-Array Construction Algorithms , 2011, ALENEX.

[9] Johannes Fischer,et al. Inducing the LCP-Array , 2011, WADS.

[10] William F. Smyth,et al. A taxonomy of suffix array construction algorithms , 2007, CSUR.

[11] Eugene W. Myers,et al. Suffix arrays: a new method for on-line string searches , 1993, SODA '90.

[12] Volker Heun,et al. A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array , 2007, ESCAPE.

[13] Johann van der Merwe,et al. A survey on peer-to-peer key management for mobile ad hoc networks , 2007, CSUR.