Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)

An experimental study of an opportunistic index

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

A linear lower bound on index size for text retrieval

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

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

Compactly encoding unstructured inputs with differential compression

Journal of the ACM (JACM)

High-order entropy-compressed text indexes

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

Succinct Dynamic Data Structures

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures

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

Space-Efficient Data Structures for Flexible Text Retrieval Systems

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation

Optimal Exact Strring Matching Based on Suffix Arrays

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval

Indexing Text Using the Ziv-Lempel Trie

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval

Trade Off Between Compression and Search Times in Compact Suffix Array

ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation

A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics

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

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

The Minimum DAWG for All Suffixes of a String and Its Applications

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching

Range Searching Over Tree Cross Products

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms

Engineering a Lightweight Suffix Array Construction Algorithm

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms

Towards Automatic Clustering of Protein Sequences

CSB '02 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

When indexing equals compression: experiments with compressing suffix arrays and applications

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Replacing suffix trees with enhanced suffix arrays

Journal of Discrete Algorithms - SPIRE 2002

Indexing text using the Ziv-Lempel trie

Journal of Discrete Algorithms - SPIRE 2002

A linear lower bound on index size for text retrieval

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms

New text indexing functionalities of the compressed suffix arrays

Journal of 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

Algorithmic foundations of the internet

ACM SIGACT News

Dictionaries using variable-length keys and data, with applications

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Dynamic dictionary matching and compressed suffix trees

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

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

Substring compression problems

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Indexing compressed text

Journal of the ACM (JACM)

Structuring labeled trees for optimal succinctness, and beyond

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

Squeezing succinct data structures into entropy bounds

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Matching statistics: efficient computation and a new practical algorithm for the multiple common substring problem

Software—Practice & Experience

Approximate string matching using compressed suffix arrays

Theoretical Computer Science

Succinct suffix arrays based on run-length encoding

Nordic Journal of Computing

Compressed full-text indexes

ACM Computing Surveys (CSUR)

Compressed indexes for dynamic text collections

ACM Transactions on Algorithms (TALG)

On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)

The cell probe complexity of succinct data structures

Theoretical Computer Science

Compressed indexes for approximate string matching

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

Text indexing with errors

Journal of Discrete Algorithms

Compressed data structures: Dictionaries and data-aware measures

Theoretical Computer Science

Output-sensitive autocompletion search

Information Retrieval

Counting suffix arrays and strings

Theoretical Computer Science

Implementing the LZ-index: Theory versus practice

Journal of Experimental Algorithmics (JEA)

Compressed Prefix Sums

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science

Real-Time String Filtering of Large Databases Implemented Via a Combination of Artificial Neural Networks

ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II

Structural optimization of a full-text n-gram index using relational normalization

The VLDB Journal — The International Journal on Very Large Data Bases

Cell probe lower bounds for succinct data structures

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms

B-tries for disk-based string management

The VLDB Journal — The International Journal on Very Large Data Bases

Linear Time Suffix Array Construction Using D-Critical Substrings

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching

On the Structure of Consistent Partitions of Substring Set of a Word

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics

Succinct Text Indexing with Wildcards

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval

A Compressed Enhanced Suffix Array Supporting Fast String Matching

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval

Directly Addressable Variable-Length Codes

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval

On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics

Algorithms for memory hierarchies: advanced lectures

Algorithms for memory hierarchies: advanced lectures

Linear-time construction of suffix arrays

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching

The cell probe complexity of succinct data structures

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

Succinct representations of permutations

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

Succinct dynamic dictionaries and trees

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

Optimal self-adjusting trees for dynamic string data in secondary storage

SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval

An experimental study of compressed indexing and local alignments of DNA

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications

Bidirectional search in a string with wavelet trees

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching

Succinct dictionary matching with no slowdown

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching

Compression, indexing, and retrieval for massive string data

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching

Indexing similar DNA sequences

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management

Practical approaches to reduce the space requirement of lempel-ziv--based compressed text indices

Journal of Experimental Algorithmics (JEA)

Succincter text indexing with wildcards

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching

Self-indexing based on LZ77

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching

Alphabet-independent compressed text indexing

ESA'11 Proceedings of the 19th European conference on Algorithms

Distribution-aware compressed full-text indexes

ESA'11 Proceedings of the 19th European conference on Algorithms

Estimating the number of substring matches in long string databases

APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development

Word-based self-indexes for natural language text

ACM Transactions on Information Systems (TOIS)

A linear size index for approximate pattern matching

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching

Obtaining provably good performance from suffix trees in secondary storage

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching

Output-Sensitive autocompletion search

SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval

Rapid homology search with two-stage extension and daughter seeds

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Opportunistic data structures for range queries

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Succinct text indexes on large alphabet

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation

Improved approximate string matching using compressed suffix data structures

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Space-efficient construction of LZ-index

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

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

Succinct suffix arrays based on run-length encoding

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

An offline approach for whole-program paths analysis using suffix arrays

LCPC'04 Proceedings of the 17th international conference on Languages and Compilers for High Performance Computing

Advantages of backward searching — efficient secondary memory and distributed implementation of compressed suffix arrays

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Search engines and web information retrieval

CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking

Efficient implementation of rank and select functions for succinct representation

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Counting suffix arrays and strings

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval

Fast discovery of similar sequences in large genomic collections

ECIR'06 Proceedings of the 28th European conference on Advances in Information Retrieval

Succinct representations of permutations and functions

Theoretical Computer Science

Text classifiers for automatic articles categorization

ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II

Searching by corpus with fingerprints

Proceedings of the 15th International Conference on Extending Database Technology

Space-efficient multiple string matching automata

International Journal of Wireless and Mobile Computing

Wavelet trees for all

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching

Cross-Document pattern matching

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching

FEMTO: fast search of large sequence collections

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 framework for dynamizing succinct data structures

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Optimal lightweight construction of suffix arrays for constant alphabets

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Compressed data structures with relevance

Proceedings of the 21st ACM international conference on Information and knowledge management

Smaller self-indexes for natural language

SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval

ESP-index: A compressed index based on edit-sensitive parsing

Journal of Discrete Algorithms

On compressing and indexing repetitive sequences

Theoretical Computer Science

Compressed indexes for text with wildcards

Theoretical Computer Science

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)

Wavelet trees for all

Journal of Discrete Algorithms