Fast and lightweight LCP-array construction algorithms

2011 Proceedings of the 13th Workshop on Algorithm Engineering and Experiments, ALENEX 2011

Volumn , Issue , 2011, Pages 25-34

  Gog, Simon ^a   Ohlebusch, Enno ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FORESTRY;

COMPRESSED SUFFIX TREES; CONSTRUCTION ALGORITHMS; LARGE-SCALE APPLICATIONS; SPACE CONSUMPTION; SPACE EFFICIENT; STRING PROCESSING; SUFFIX ARRAYS; SUFFIX-TREES;

TREES (MATHEMATICS);

ALGORITHMS; DATA; EXPERIMENTATION; FORESTRY; STRUCTURES;

EID: 80052130463     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972917.3     Document Type: Conference Paper

References (12)

1. Michael Burrows and David J. Wheeler. A blocksorting lossless data compression algorithm. Technical report, Digital Equipment Corporation, 1994.
2. Dan Gusfield. Algorithms on Strings, Trees, and Sequences Computer Science and Computational Biology. Cambridge University Press, 1997.
3. Juha Kärkkäinen, Giovanni Manzini, and Simon J. Puglisi. Permuted longest-common-prefix array. In Gregory Kucherov and Esko Ukkonen, editors, CPM, volume 5577 of Lecture Notes in Computer Science, pages 181-192. Springer, 2009.
4. Juha Kärkkäinen and Peter Sanders. Simple linear work suffix array construction. In Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, and Gerhard J. Woeginger, editors, ICALP, volume 2719 of Lecture Notes in Computer Science, pages 943-955. Springer, 2003.
5. Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, and Kunsoo Park. Linear-time longestcommonprefix computation in suffix arrays and its applications. In Amihood Amir and Gad M. Landau, editors, CPM, volume 2089 of Lecture Notes in Computer Science, pages 181-192. Springer, 2001.
6. Udi Manber and Eugene W. Myers. Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, 1993.
7. Giovanni Manzini. Two space saving tricks for linear time lcp array computation. In Torben Hagerup and Jyrki Katajainen, editors, SWAT, volume 3111 of Lecture Notes in Computer Science, pages 372-383. Springer, 2004.
8. Gonzalo Navarro and Veli Mäkinen. Compressed fulltext indexes. ACM Comput. Surv., 39(1), 2007.
9. Ge Nong, Sen Zhang, and Wai Hong Chan. Linear suffix array construction by almost pure induced-sorting. In James A. Storer and Michael W. Marcellin, editors, DCC, pages 193-202. IEEE Computer Society, 2009.
10. Simon J. Puglisi, William F. Smyth, and Andrew Turpin. A taxonomy of suffix array construction algorithms. ACM Comput. Surv., 39(2), 2007.
11. Simon J. Puglisi and Andrew Turpin. Space-time tradeoffs for longest-common-prefix array computation. In Seok-Hee Hong, Hiroshi Nagamochi, and Takuro Fukunaga, editors, ISAAC, volume 5369 of Lecture Notes in Computer Science, pages 124-135. Springer, 2008.
12. Kunihiko Sadakane. Compressed suffix trees with full functionality. Theory Comput. Syst., 41(4):589-607, 2007.