STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Reducing space for index implementation
Theoretical Computer Science
Indexing Text Using the Ziv-Lempel Trie
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Text sparsification via local maxima
Theoretical Computer Science
Similarity search of time-warped subsequences via a suffix tree
Information Systems
Distributed suffix trees and their application to large-scale genomic analysis
ICCMSE '03 Proceedings of the international conference on Computational methods in sciences and engineering
Approximate string matching on Ziv-Lempel compressed text
Journal of Discrete Algorithms
Indexing text using the Ziv-Lempel trie
Journal of Discrete Algorithms - SPIRE 2002
Constructing Suffix Tree for Gigabyte Sequences with Megabyte Memory
IEEE Transactions on Knowledge and Data Engineering
Succinct suffix arrays based on run-length encoding
Nordic Journal of Computing
ACM Computing Surveys (CSUR)
Linear work suffix array construction
Journal of the ACM (JACM)
Genome-scale disk-based suffix tree indexing
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
A compressed self-index using a Ziv---Lempel dictionary
Information Retrieval
Compressed text indexes: From theory to practice
Journal of Experimental Algorithmics (JEA)
Speeding Up Pattern Matching by Text Sampling
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
On Entropy-Compressed Text Indexing in External Memory
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Succinct Index for Dynamic Dictionary Matching
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Suffix tree construction algorithms on modern hardware
Proceedings of the 13th International Conference on Extending Database Technology
Fast lightweight suffix array construction and checking
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Distributed and paged suffix trees for large genetic databases
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Journal of Discrete Algorithms
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
Sparse and truncated suffix trees on variable-length codes
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
A new algorithm for sparse suffix trees
BSB'11 Proceedings of the 6th Brazilian conference on Advances in bioinformatics and computational biology
Compressed text indexing with wildcards
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
On-Line linear-time construction of word suffix trees
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Sparse directed acyclic word graphs
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
A compressed self-index using a ziv-lempel dictionary
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Parallel construction of large suffix trees on a PC cluster
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
String matching with alphabet sampling
Journal of Discrete Algorithms
From nondeterministic suffix automaton to lazy suffix tree
Algorithms and Applications
Full-text search on multi-byte encoded documents
Proceedings of the 2012 ACM symposium on Document engineering
Computing lempel-ziv factorization online
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Compressed text indexing with wildcards
Journal of Discrete Algorithms
Sparse suffix tree construction in small space
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |