In-place suffix sorting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4596 LNCS, Issue , 2007, Pages 533-545

  Franceschini, G ^a   Muthukrishnan, S ^b  

^a UNIVERSITY OF PISA   (Italy)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA COMPRESSION; PROBLEM SOLVING; TREES (MATHEMATICS);

COMPUTATIONAL BIOLOGY; SUFFIX ARRAYS; SUFFIX SORTING;

SORTING;

EID: 38149140840     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_47     Document Type: Conference Paper

References (8)

1. Farach, M.: Optimal Suffix Tree Construction with Large Alphabets. In: FOCS 1997, pp. 137-143 (1997)
2. Ferragina, P., Manzini, G.: Engineering a lightweight suffix array construction algorithm. In: Proc. ESA (2002)
3. Gusfield, D.: Algorithms on strings, trees and sequences: Computer Science and Computational Biology. Cambridge Univ Press, Cambridge (1997)
4. Kärkkäinen, J., Sanders, P.: Simple linear work suffix array construction. Int. Colloquium on Automata, Languages and Programming 2719, 943-955 (2003)
5. Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. Journal of the ACM (in press)
6. Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R.A., Chavez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 200-210. Springer, Heidelberg (2003)
7. 2 n) time. Journal of Computer and System Sciences 33(1), 66-74 (1986)
8. Salowe, J., Steiger, W.: Simplified stable merging tasks. Journal of Algorithms 8(4), 557-571 (1987)