A fast algorithm for constructing suffix arrays for fixed-size alphabets

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

Volumn 3059, Issue , 2004, Pages 301-314

  Kirn, Dong K ^a   Jo, Junha ^a   Park, Heejin ^b  

^a Pusan National University   (South Korea)

^b Hanyang University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; DNA; DNA SEQUENCES; FORESTRY; GENES; GENETIC ENGINEERING; INDEXING (OF INFORMATION);

COMPUTATIONAL BIOLOGY; FAST ALGORITHMS; GENOME SEQUENCES; INDEX DATA STRUCTURES; INTEGER ALPHABETS; PRACTICAL USE; RUNNING TIME; SUFFIX ARRAYS;

ALGORITHMS;

EID: 35048902513     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (22)

1. M. Burrows and D. Wheeler, A block sorting lossless data compression algorithm, Technical Report 124 (1994), Digital Equipment Corporation, 1994.
2. M. Farach, Optimal suffix tree construction with large alphabets, IEEE Symp. Found. Computer Science (1997), 137-143.
3. M. Farach-Colton, P. Ferragina and S. Muthukrishnan, On the sorting-complexity of suffix tree construction, J. Assoc. Comput. Mach. 47 (2000), 987-1011.
4. P. Ferragina and G. Manzini, Opportunistic data structures with applications, IEEE Symp. Found. Computer Science (2001), 390-398.
5. P. Ferragina and G. Manzini, An experimental study of an opportunistic index, ACM-SIAM Symp. on Discrete Algorithms (2001), 269-278.
6. G. Gonnet, R. Baeza-Yates, and T. Snider, New indices for text: Pat trees and pat arrays. In W. B. Frakes and R. A. Baeza-Yates, editors, Information Retrieval: Data Structures & Algorithms, Prentice Hall (1992), 66-82.
7. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge Univ. Press 1997.
8. D. Gusfield, An "Increment-by-one" approach to suffix arrays and trees, manuscript (1990).
9. R. Grossi, A. Gupta and J.S. Vitter, When indexing equals compression: Experiments with compressing suffix arrays and applications, ACM-SIAM Symp. on Discrete Algorithms (2004).
10. R. Grossi and J.S. Vitter, Compressed suffix arrays and suffix trees with applications to text indexing and string matching, ACM Symp. Theory of Computing (2000), 397-406.
11. W.K. Hon, K. Sadakane and W.K. Sung, Breaking a time-and-space barrier in constructing full-text indices, IEEE Symp. Found. Computer Science (2003), 251-260.
12. T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park, Linear-time longestcommon-prefix computation in suffix arrays and its applications, Symp. Combinatorial Pattern Matching (2001), 181-192.
13. J. Kärkkäinen and P. Sanders, Simpler linear work suffix array construction, Int. Colloq. Automata Languages and Programming (2003), 943-955.
14. O.K. Kim, J.S. Sim, H. Park and K. Park, Linear-time construction of suffix arrays, Symp. Combinatorial Pattern Matching (2003), 186-199.
15. P. Ko and S. Aluru, Space-efficient linear time construction of suffix arrays, Symp. Combinatorial Pattern Matching (2003), 200-210.
16. U. Manber and G. Myers, Suffix arrays: A new method for on-line string searches, SIAM J. Comput. 22 (1993), 935-938.
17. E.M. McCreight, A space-economical suffix tree construction algorithm, J. Assoc. Comput Mach. 23 (1976), 262-272.
18. K. Sadakane, Compressed text databases with efficient query algorithms based on the compressed suffix array, Int. Symp. Algorithms and Computation (2000), 410-421.
19. K. Sadakane, Succinct representations of Icp Information and improvements in the compressed suffix arrays, ACM-SIAM Symp. on Discrete Algorithms (2002), 225-232.
20. J-S. Sim, D.K. Kim, H. Park and K. Park, Linear-time search in suffix arrays, Australasian Workshop on Combinatorial Algorithms (2003), 139-146.
21. E. Ukkonen, On-line construction of suffix trees, Algorithmica 14 (1995), 249-260.
22. P. Weiner, Linear pattern matching algorithms, Proc. 14th IEEE Symp. Switching and Automata Theory (1973), 1-11.