STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Faster suffix tree construction with missing suffix links
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice
IEEE Transactions on Computers
On the sorting-complexity of suffix tree construction
Journal of the ACM (JACM)
Efficient algorithms for document retrieval problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Simple and flexible detection of contiguous repeats using a suffix tree
Theoretical Computer Science
Multidimensional matching and fast search in suffix trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Generalization of a Suffix Tree for RNA Structural Pattern Matching
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Indexing and Dictionary Matching with One Error
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Linear-Time Construction of Two-Dimensional Suffix Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Solving the String Statistics Problem in Time O(n log n)
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Constructing the Suffix Tree of a Tree with a Large Alphabet
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Efficient Implementation of Lazy Suffix Trees
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Finding Maximal Pairs with Bounded Gap
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
On Constructing Suffix Arrays in External Memory
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Finding surprising patterns in a time series database in linear time and space
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Towards Automatic Clustering of Protein Sequences
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Bidirectional construction of suffix trees
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Application of Lempel--Ziv factorization to the approximation of grammar-based compression
Theoretical Computer Science
Truncated suffix trees and their application to data compression
Theoretical Computer Science
Two-pattern strings I: a recognition algorithm
Journal of Discrete Algorithms
Random Structures & Algorithms
Engineering a Fast Online Persistent Suffix Tree Construction
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Computing all repeats using suffix arrays
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Dictionary matching and indexing with errors and don't cares
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Combined super-/substring and super-/subsequence problems
Theoretical Computer Science
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
Constructing Suffix Tree for Gigabyte Sequences with Megabyte Memory
IEEE Transactions on Knowledge and Data Engineering
On average sequence complexity
Theoretical Computer Science
Linear time algorithms for finding and representing all the tandem repeats in a string
Journal of Computer and System Sciences
Practical methods for constructing suffix trees
The VLDB Journal — The International Journal on Very Large Data Bases
Cache-oblivious string dictionaries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient algorithms for substring near neighbor problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Processing comparable corpora with Bilingual Suffix Trees
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
Construction of Aho Corasick automaton in linear time for integer alphabets
Information Processing Letters
ACM Computing Surveys (CSUR)
Linear work suffix array construction
Journal of the ACM (JACM)
Faster two-dimensional pattern matching with rotations
Theoretical Computer Science
Approximating reversal distance for strings with bounded number of duplicates
Discrete Applied Mathematics
Computing suffix links for suffix trees and arrays
Information Processing Letters
Succinct data structures for flexible text retrieval systems
Journal of Discrete Algorithms
All maximal-pairs in step-leap representation of melodic sequence
Information Sciences: an International Journal
Dynamic text and static pattern matching
ACM Transactions on Algorithms (TALG)
A taxonomy of suffix array construction algorithms
ACM Computing Surveys (CSUR)
Genome-scale disk-based suffix tree indexing
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Theoretical Computer Science
Journal of Discrete Algorithms
Theoretical Computer Science
Text document clustering based on frequent word meaning sequences
Data & Knowledge Engineering
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Faster index for property matching
Information Processing Letters
Computing Longest Previous Factor in linear time and applications
Information Processing Letters
Real-time indexing over fixed finite alphabets
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Faster path indexes for search in XML data
ADC '08 Proceedings of the nineteenth conference on Australasian database - Volume 75
Optimal prefix and suffix queries on texts
Information Processing Letters
Efficient on-line repetition detection
Theoretical Computer Science
On-line construction of compact suffix vectors and maximal repeats
Theoretical Computer Science
Cell probe lower bounds for succinct data structures
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient discovery of unusual patterns in time series
New Generation Computing
Efficient construction of maximal and minimal representations of motifs of a string
Theoretical Computer Science
Generalized Substring Compression
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Linear Time Suffix Array Construction Using D-Critical Substrings
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Geometric suffix tree: Indexing protein 3-D structures
Journal of the ACM (JACM)
Construction of Aho Corasick automaton in linear time for integer alphabets
Information Processing Letters
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Fast lightweight suffix array construction and checking
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Linear-time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
A fully linear-time approximation algorithm for grammar-based compression
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
Prefix-shuffled geometric suffix tree
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Succinct dictionary matching with no slowdown
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Algorithms and theory of computation handbook
Finding Patterns In Given Intervals
Fundamenta Informaticae
Journal of Discrete Algorithms
Fast construction of the HYB index
ACM Transactions on Information Systems (TOIS)
Quick greedy computation for minimum common string partitions
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Identify fixed-path phishing attack by STC
Proceedings of the 8th Annual Collaboration, Electronic messaging, Anti-Abuse and Spam Conference
Adaptive context modeling for deception detection in emails
MLDM'11 Proceedings of the 7th international conference on Machine learning and data mining in pattern recognition
Persistency in suffix trees with applications to string interval problems
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
On suffix extensions in suffix trees
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
A linear time algorithm for seeds computation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Obtaining provably good performance from suffix trees in secondary storage
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Geometric suffix tree: a new index structure for protein 3-d structures
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Suffix tree based data compression
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Optimal pattern matching in LZW compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
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
Time and space efficient search for small alphabets with suffix arrays
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part I
The three squares lemma revisited
Journal of Discrete Algorithms
On demand string sorting over unbounded alphabets
Theoretical Computer Science
On-line suffix tree construction with reduced branching
Journal of Discrete Algorithms
Validating the knuth-morris-pratt failure function, fast and online
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
From nondeterministic suffix automaton to lazy suffix tree
Algorithms and Applications
Reversal distance for strings with duplicates: linear time approximation using hitting set
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Towards real-time suffix tree construction
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
On suffix extensions in suffix trees
Theoretical Computer Science
A comparison of index-based lempel-Ziv LZ77 factorization algorithms
ACM Computing Surveys (CSUR)
Computing regularities in strings: A survey
European Journal of Combinatorics
An efficient algorithm for identifying the most contributory substring
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Finding patterns in given intervals
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On demand string sorting over unbounded alphabets
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Fast and practical algorithms for computing all the runs in a string
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
A simple construction of two-dimensional suffix trees in linear time
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Range non-overlapping indexing and successive list indexing
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Efficient LZ78 factorization of grammar compressed text
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Efficient data structures for the factor periodicity problem
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Near real-time suffix tree construction via the fringe marked ancestor problem
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
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Prioritized grammar enumeration: symbolic regression by dynamic programming
Proceedings of the 15th annual conference on Genetic and evolutionary computation
String similarity measures and joins with synonyms
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Optimal Pattern Matching in LZW Compressed Strings
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
On-line construction of position heaps
Journal of Discrete Algorithms
Various improvements to text fingerprinting
Journal of Discrete Algorithms
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
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
Theory of Computing Systems
A Compressed Suffix Tree Based Implementation With Low Peak Memory Usage
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.02 |
The suffix tree of a string is the fundamental data structure of combinatorial pattern matching. Weiner (1973), who introduced the data structure, gave an O(n)-time algorithm for building the suffix tree of an n-character string drawn from a constant size alphabet. In the comparison model, there is a trivial /spl Omega/(n log n)-time lower bound based on sorting, and Weiner's algorithm matches this bound trivially. For integer alphabets, a substantial gap remains between the known upper and lower bounds, and closing this gap is the main open question in the construction of suffix trees. There is no super-linear lower bound, and the fastest known algorithm was the O(n log n) time comparison based algorithm. We settle this open problem by closing the gap: we build suffix trees in linear time for integer alphabet.