New suffix array algorithms - linear but not fast?
MetadataShow full item record
Antonitio, A. and Ryan, P. and Smyth, W. and Turpin, A. and Yu, X. 2004. New suffix array algorithms - linear but not fast?, in Hong, S. (ed), 15th Australasian Workshop on Combinatorial Algorithms (AWOCA), pp. 148-156. Ballina, Australia: Australian Computer Society.
Proceedings of the 15th Australasian workshop on combinatorial algorithms (AWOCA)
15th Australasian Workshop on Combinatorial Algorithms (AWOCA)
School of Science and Computing
Department of Computing
Faculty of Science and Engineering
In 2003 three (-)(n)-time algorithms were proposed for the construction of a suffix array of a string x = x[1..n] on an indexed alphabet, all of them inspired by the methodology of Farach's (-)(n)- time suffix tree construction algorithm. In the same year a (-)(m)-time algorithm was described for computing all the occurrences of a pattern p = p[1..m] in x, given a suffix array of x and various other (-)(n) - space data structures. We analyze the effectiveness and limitations of these algorithms, especially in terms of execution time, and we discuss strategies for their improvement.
Showing items related by title, author, creator and subject.
Franek, F.; Smyth, Bill (2004)Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial division of the suffixes of x into two sets: ...
Puglisi, Simon; Smyth, William; Turpin, A. (2007)In 1990, Manber and Myers proposed suffix arrays as a space-saving alternative to suffix trees and described the first algorithms for suffix array construction and use. Since that time, and especially in the last few ...
Chen, G.; Puglisi, Simon; Smyth, B. (2008)For 30 years the Lempel-Ziv factorization LZ x of a string x = x[1..n] has been a fundamental data structure of string processing, especially valuable for string compression and for computing all the repetitions (runs) ...