Linear-time construction of suffix arrays

Authors:
Dong Kyue Kim;Jeong Seop Sim;Heejin Park;Kunsoo Park
Affiliations:
School of Electrical and Computer Engineering, Pusan National University;Electronics and Telecommunications Research Institute, Daejeon, Korea;School of Computer Science and Engineering, Seoul National University;School of Computer Science and Engineering, Seoul National University
Venue:
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Year:
2003

Citing 22
Cited 63

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization

SIAM Journal on Computing
New indices for text: PAT Trees and PAT arrays

Information retrieval
Recursive star-tree parallel data structure

SIAM Journal on Computing
Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Symmetry breaking for suffix tree construction

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimal parallel suffix tree construction

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the sorting-complexity of suffix tree construction

Journal of the ACM (JACM)
A unifying look at data structures

Communications of the ACM
Succinct representations of lcp information and improvements in the compressed suffix arrays

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal Logarithmic Time Randomized Suffix Tree Construction

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
The LCA Problem Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Space Efficient Suffix Trees

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Optimal suffix tree construction with large alphabets

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Opportunistic data structures with applications

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Scaling and related techniques for geometry problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Linear pattern matching algorithms

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Fast lightweight suffix array construction and checking

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Space efficient linear time construction of suffix arrays

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Simple linear work suffix array construction

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Replacing suffix trees with enhanced suffix arrays

Journal of Discrete Algorithms - SPIRE 2002
Computing quasi suffix arrays

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
An O(N^2) Algorithm for Discovering Optimal Boolean Pattern Pairs

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Antisequential Suffix Sorting for BWT-Based Data Compression

IEEE Transactions on Computers
A categorization theorem on suffix arrays with applications to space efficient text indexes

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Detecting higher-level similarity patterns in programs

Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Efficient Algorithms and Software for Detection of Full-Length LTR Retrotransposons

CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
Practical methods for constructing suffix trees

The VLDB Journal — The International Journal on Very Large Data Bases
Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem

Software—Practice & Experience
Construction of Aho Corasick automaton in linear time for integer alphabets

Information Processing Letters
Approximate string matching using compressed suffix arrays

Theoretical Computer Science
A metric index for approximate string matching

Theoretical Computer Science
A note on the Burrows-Wheeler transformation

Theoretical Computer Science
Computing suffix links for suffix trees and arrays

Information Processing Letters
A taxonomy of suffix array construction algorithms

ACM Computing Surveys (CSUR)
Optimal suffix selection

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
An efficient, versatile approach to suffix sorting

Journal of Experimental Algorithmics (JEA)
Scalable parallel suffix array construction

Parallel Computing
Text indexing with errors

Journal of Discrete Algorithms
Efficient Algorithms for the Inverse Sort Transform

IEEE Transactions on Computers
Faster suffix sorting

Theoretical Computer Science
The affix array data structure and its applications to RNA secondary structure analysis

Theoretical Computer Science
The generalised k-Truncated Suffix Tree for time-and space-efficient searches in multiple DNA or protein sequences

International Journal of Bioinformatics Research and Applications
Fast profile matching algorithms – A survey

Theoretical Computer Science
Lossless filter for multiple repetitions with Hamming distance

Journal of Discrete Algorithms
A space efficient solution to the frequent string mining problem for many databases

Data Mining and Knowledge Discovery
Better external memory suffix array construction

Journal of Experimental Algorithmics (JEA)
A Simple and Compact Algorithm for the RMQ and Its Application to the Longest Common Repeat Problem

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
A new method for indexing genomes using on-disk suffix trees

Proceedings of the 17th ACM conference on Information and knowledge management
Linear Time Suffix Array Construction Using D-Critical Substrings

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Transformation of Suffix Arrays into Suffix Trees on the MPI Environment

RSFDGrC '07 Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
A Compressed Enhanced Suffix Array Supporting Fast String Matching

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Faster entropy-bounded compressed suffix trees

Theoretical Computer Science
Construction of Aho Corasick automaton in linear time for integer alphabets

Information Processing Letters
Fast lightweight suffix array construction and checking

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Space efficient linear time construction of suffix arrays

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Simple linear work suffix array construction

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Pattern matching in strings

Algorithms and theory of computation handbook
Size Matters: Space/Time Tradeoffs to Improve GPGPU Applications Performance

Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Computing the inverse sort transform in linear time

ACM Transactions on Algorithms (TALG)
Sparse substring pattern set discovery using linear programming boosting

DS'10 Proceedings of the 13th international conference on Discovery science
A quick tour on suffix arrays and compressed suffix arrays

Theoretical Computer Science
Lightweight BWT construction for very large string collections

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Scalable parallel suffix array construction

EuroPVM/MPI'06 Proceedings of the 13th European PVM/MPI User's Group conference on Recent advances in parallel virtual machine and message passing interface
An algorithm for the generalized k-keyword proximity problem and finding longest repetitive substring in a set of strings

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Finding patterns with variable length gaps or don’t cares

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A new compressed suffix tree supporting fast search and its construction algorithm using optimal working space

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Linear-Time construction of compressed suffix arrays using o(n log n)-bit working space for large alphabets

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Construction of aho corasick automaton in linear time for integer alphabets

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Suffix trays and suffix trists: structures for faster text indexing

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Efficient algorithms for three variants of the LPF table

Journal of Discrete Algorithms
On demand string sorting over unbounded alphabets

Theoretical Computer Science
Lossless filter for finding long multiple approximate repetitions using a new data structure, the bi-factor array

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Linear time algorithm for the generalised longest common repeat problem

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Space efficient modifications to structator-- a fast index-based search tool for RNA sequence-structure patterns

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Computing regularities in strings: A survey

European Journal of Combinatorics
Computing the Longest Previous Factor

European Journal of Combinatorics
On demand string sorting over unbounded alphabets

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Efficient computation of substring equivalence classes with suffix arrays

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Lightweight algorithms for constructing and inverting the BWT of string collections

Theoretical Computer Science
Suffix Array Construction in External Memory Using D-Critical Substrings

ACM Transactions on Information Systems (TOIS)
On the combinatorics of suffix arrays

Information Processing Letters

Quantified Score

Hi-index	0.02

Visualization

Abstract

The time complexity of suffix tree construction has been shown to be equivalent to that of sorting: O(n) for a constant-size alphabet or an integer alphabet and O(n log n) for a general alphabet. However, previous algorithms for constructing suffix arrays have the time complexity of O(n log n) even for a constant-size alphabet. In this paper we present a linear-time algorithm to construct suffix arrays for integer alphabets, which do not use suffix trees as intermediate data structures during its construction. Since the case of a constant-size alphabet can be subsumed in that of an integer alphabet, our result implies that the time complexity of directly constructing suffix arrays matches that of constructing suffix trees.