Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications

Authors:
Toru Kasai;Gunho Lee;Hiroki Arimura;Setsuo Arikawa;Kunsoo Park
Affiliations:
-;-;-;-;-
Venue:
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Year:
2001

Citing 15
Cited 118

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

SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
External memory algorithms

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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)
An experimental study of an opportunistic index

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Data Structures and Algorithms

Data Structures and Algorithms
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Discovering Unordered and Ordered Phrase Association Patterns for Text Mining

PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
A Cooperative Distributed Text Database Management Method Unifying Search and Compression Based on the Burrows-Wheeler Transformation

ER '98 Proceedings of the Workshops on Data Warehousing and Data Mining: Advances in Database Technologies
Efficient Discovery of Proximity Patterns with Suffix Arrays

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version)

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
A Modified Burrows-Wheeler Transformation for Case-Insensitive Search with Application to Suffix Array Compression

DCC '99 Proceedings of the Conference on Data Compression
Opportunistic data structures with applications

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science

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
The Enhanced Suffix Array and Its Applications to Genome Analysis

WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Optimal Exact Strring Matching Based on Suffix Arrays

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Efficient Data Mining from Large Text Databases

Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Efficient Discovery of Proximity Patterns with Suffix Arrays

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Space-Economical Algorithms for Finding Maximal Unique Matches

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Efficient Text Mining with Optimized Pattern Discovery

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Rapid Large-Scale Oligonucleotide Selection for Microarrays

CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Computing Highly Specific and Mismatch Tolerant Oligomers Efficiently

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Compact suffix array: a space-efficient full-text index

Fundamenta Informaticae - Special issue on computing patterns in strings
EMAGEN: an efficient approach to multiple whole genome alignment

APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
Replacing suffix trees with enhanced suffix arrays

Journal of Discrete Algorithms - SPIRE 2002
An O(N^2) Algorithm for Discovering Optimal Boolean Pattern Pairs

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
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
Fast Frequent String Mining Using Suffix Arrays

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem

Software—Practice & Experience
When indexing equals compression: Experiments with compressing suffix arrays and applications

ACM Transactions on Algorithms (TALG)
Linear work suffix array construction

Journal of the ACM (JACM)
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
The engineering of a compression boosting library: theory vs practice in BWT compression

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Comparative n-gram analysis of whole-genome protein sequences

HLT '02 Proceedings of the second international conference on Human Language Technology Research
Compressing table data with column dependency

Theoretical Computer Science
Computing Longest Previous Factor in linear time and applications

Information Processing Letters
Improving suffix array locality for fast pattern matching on disk

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Counting suffix arrays and strings

Theoretical Computer Science
Linear-Time Computation of Similarity Measures for Sequential Data

The Journal of Machine Learning Research
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
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
Computing Inverse ST in Linear Complexity

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
An Online Algorithm for Finding the Longest Previous Factors

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A Simple Algorithm for Finding Exact Common Repeats

IEICE - Transactions on Information and Systems
Reducing Space Requirements for Disk Resident Suffix Arrays

DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Permuted Longest-Common-Prefix Array

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
Engineering a compressed suffix tree implementation

Journal of Experimental Algorithmics (JEA)
A Compressed Enhanced Suffix Array Supporting Fast String Matching

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Practical Algorithms for the Longest Common Extension Problem

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

Theoretical Computer Science
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem

Information Processing Letters
Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences

Fundamenta Informaticae - Special Issue on Stringology
Wee LCP

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
Engineering a compressed suffix tree implementation

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Unsupervised spam detection based on string alienness measures

DS'07 Proceedings of the 10th international conference on Discovery science
Efficiently extracting operational profiles from execution logs using suffix arrays

ISSRE'09 Proceedings of the 20th IEEE international conference on software reliability engineering
Computing longest common substrings via suffix arrays

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Multiple genome alignment based on longest path in directed acyclic graphs

International Journal of Bioinformatics Research and Applications
Sampled longest common prefix array

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
The longest common extension problem revisited and applications to approximate string searching

Journal of Discrete Algorithms
Pattern matching in strings

Algorithms and theory of computation handbook
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
Computing matching statistics and maximal exact matches on compressed full-text indexes

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Computing Longest Previous non-overlapping Factors

Information Processing Letters
A quick tour on suffix arrays and compressed suffix arrays

Theoretical Computer Science
Lempel-Ziv factorization revisited

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Sparse and truncated suffix trees on variable-length codes

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
An efficient hybrid approach to correcting errors in short reads

MDAI'11 Proceedings of the 8th international conference on Modeling decisions for artificial intelligence
Inducing the LCP-array

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Fast computation of a string duplication history under no-breakpoint-reuse

SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Computing the longest common prefix array based on the burrows-wheeler transform

SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Fast q-gram mining on SLP compressed strings

SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Human motion classification and management based on mocap data analysis

J-HGBU '11 Proceedings of the 2011 joint ACM workshop on Human gesture and behavior understanding
Optimal string mining under frequency constraints

PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
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
Efficient Maximal Repeat Finding Using the Burrows-Wheeler Transform and Wavelet Tree

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
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
Efficient algorithms for three variants of the LPF table

Journal of Discrete Algorithms
On the number of elements to reorder when updating a suffix array

Journal of Discrete Algorithms
Practical algorithms for pattern based linear regression

DS'05 Proceedings of the 8th international conference on Discovery Science
A fast longest common subsequence algorithm for similar strings

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Collaborative discovery through biological language modeling interface

Ambient Intelligence in Everyday Life
Parameterized longest previous factor

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
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
Succinct indexes for circular patterns

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Range LCP

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
An index structure for spaced seed search

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Parameterized longest previous factor

Theoretical Computer Science
A linearly computable measure of string complexity

Theoretical Computer Science
Improving tweet stream classification by detecting changes in word probability

SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Self-Indexed Grammar-Based Compression

Fundamenta Informaticae
Minimum Unique Substrings and Maximum Repeats

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Variations of the parameterized longest previous factor

Journal of Discrete Algorithms
Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences

Fundamenta Informaticae - Special Issue on Stringology
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
Speeding up q-gram mining on grammar-based compressed texts

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Computing the burrows-wheeler transform of a string and its reverse

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Compact Suffix Array — A Space-Efficient Full-Text Index

Fundamenta Informaticae - Computing Patterns in Strings
A comparison of index-based lempel-Ziv LZ77 factorization algorithms

ACM Computing Surveys (CSUR)
Computing regularities in strings: A survey

European Journal of Combinatorics
Computing the Longest Previous Factor

European Journal of Combinatorics
Fast and practical algorithms for computing all the runs in a string

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Suffix arrays on words

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
A new succinct representation of RMQ-information and improvements in the enhanced suffix array

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Distributed string mining for high-throughput sequencing data

WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Approximate period detection and correction

SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Space-Efficient computation of maximal and supermaximal repeats in genome sequences

SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Computing the longest common prefix array based on the Burrows-Wheeler transform

Journal of Discrete Algorithms
Fast q-gram mining on SLP compressed strings

Journal of Discrete Algorithms
Parallel suffix array and least common prefix for the GPU

Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
FPI: a novel indexing method using frequent patterns for approximate string searches

Proceedings of the Joint EDBT/ICDT 2013 Workshops
Viewing functions as token sequences to highlight similarities in source code

Science of Computer Programming
Sparse suffix tree construction in small space

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
One-Variable word equations in linear time

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
The gapped spectrum kernel for support vector machines

MLDM'13 Proceedings of the 9th international conference on Machine Learning and Data Mining in Pattern Recognition
Efficient techniques on retrieving bio-information for active U-healthcare

Personal and Ubiquitous Computing
A Compressed Suffix Tree Based Implementation With Low Peak Memory Usage

Electronic Notes in Theoretical Computer Science (ENTCS)
Computing the Burrows-Wheeler transform of a string and its reverse in parallel

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a linear-time algorithm to compute the longest common prefix information in suffix arrays. As two applications of our algorithm, we show that our algorithm is crucial to the effective use of block-sorting compression, and we present a linear-time algorithm to simulate the bottom-up traversal of a suffix tree with a suffix array combined with the longest common prefix information.