An incomplex algorithm for fast suffix array construction

Software - Practice and Experience

Volumn 37, Issue 3, 2007, Pages 309-329

  Schürmann, Klaus Bernd ^a   Stoye, Jens ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

Indexing; Permutations; Strings; Suffix arrays

Indexed keywords

COMPUTATIONAL LINGUISTICS; INDEXING (OF INFORMATION); TECHNICAL WRITING;

SUFFIX ARRAY; WORST CASE STRINGS;

ALGORITHMS;

EID: 33947154833     PISSN: 00380644     EISSN: 1097024X     Source Type: Journal    
DOI: 10.1002/spe.768     Document Type: Article

References (24)

1. Manber U, Myers EW. Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing 1993; 22(5):935-948.
2. Karp RM, Miller RE, Rosenberg AL. Rapid identification of repeated patterns in strings, trees and arrays. Proceedings of the 4th ACM Symposium on Theory of Computing (STOC 1972). ACM Press: New York, 1972; 125-136.
3. Farach-Colton M, Ferragina P, Muthukrishnan S. On the sorting-complexity of suffix tree construction. Journal of the ACM 2000; 47(6):987-1011.
4. Kurtz S. Reducing the space requirements of suffix trees. Software: Practice and Experience 1999; 29(13):1149-1171.
5. Kärkkäinen J, Sanders P. Simple linear work suffix array construction. Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003) (Lecture Notes in Computer Science, vol. 2719). Springer: Berlin, 2003; 943-955.
6. Kim DK, Sim JS, Park H, Park K. Constructing suffix arrays in linear time. Journal of Discrete Algorithms 2005; 3(2-4):126-142.
7. Ko P, Aluru S. Space efficient linear time construction of suffix arrays. Journal of Discrete Algorithms 2005; 3(2-4):143-156.
8. Hon W-K, Sadakane K, Sung W-K. Breaking a time-and-space barrier in constructing full-text indices. Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003). IEEE Computer Society: Los Alamitos, CA, 2003; 251-260.
9. Larsson NJ, Sadakane K. Faster suffix sorting. Technical Report LU-CS-TR.-99-214, LUNDFD6/(NFCS-3140)/1-20/(1999), Department of Computer Science, Lund University, May 1999.
10. Kim DK, Jo J, Park H. A fast algorithm for constructing suffix arrays for fixed-size alphabets. Proceedings of the 3rd International Workshop on Experimental and Efficient Algorithms (Lecture Notes in Computer Science, vol. 3059), Ribeiro CC, Martins SL (eds.). Springer: Berlin, 2004; 301-314.
11. Farach M. Optimal suffix tree construction with large alphabets. Proceedings of the 38th Annual Symposium on the Foundations of Computer Science (FOCS 1997), October 1997; 137-143.
12. Itoh H, Tanaka H. An efficient method for in memory construction of suffix arrays. Proceedings of String Processing and Information Retrieval Symposium and International Workshop on Groupware (SPIRE/CRIWG 1999). IEEE Computer Society Press: Los Alamitos, CA, 1999; 81-88.
13. Seward J. On the performance of BWT sorting algorithms. Proceedings of the Data Compression Conference (DCC 2000). IEEE Computer Society: Los Alamitos, CA, 2000; 173-182.
14. Manzini G, Ferragina P. Engineering a lightweight suffix array construction algorithm. Algorithmica 2004; 40(1):33-50.
15. Burkhardt S, Kärkkäinen J. Fast lightweight suffix array construction and checking. Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching (CPM 2003) (Lecture Notes in Computer Science, vol. 2676). Springer: Berlin, 2003; 55-69.
16. Burrows M, Wheeler DJ. A block-sorting lossless data compression algorithm. Technical Report Research Report 124, Digital System Research Center, May 1994.
17. Bentley JL, McIlroy MD. Engineering a sort function. Software: Practice and Experience 1993; 23(11):1249-1265.
18. Bentley JL, Sedgewick R. Fast algorithms for sorting and searching strings. Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997). Society for Industrial and Applied Mathematics: Philadelphia, PA, 1997; 360-369.
19. McIlroy PM, Bostic K, McIlroy MD. Engineering radix sort. Computing Systems 1993; 6(1):5-27.
20. Cormen TH, Leiserson CE, Rivest RL. Introduction to Algorithms (1st edn). MIT Press: Cambridge, CA, 1989.
21. Singleton RC. ACM Algorithm 347: An efficient algorithm for sorting with minimal storage. Communications of the ACM 1969; 12(3):185-187.
22. Schürmann K-B. Bpr Home. http://bibiserv.techfak.uni-bielefeld.de/ bpr/ [20 June 2006].
23. Bengtsson J. Project details for memtime. http://freshmeat.net/projects/ memtime [20 June 2006].
24. Seward J, Nethercote N, Fitzhardinge J et al. Valgrind Home, http://valgrind.org [20 June 2006].