A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
q-gram based database searching using a suffix array (QUASAR)
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Fast string searching in secondary storage: theoretical developments and experimental results
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient suffix trees on secondary storage
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On effective multi-dimensional indexing for strings
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice
IEEE Transactions on Computers
Dynamic programming: a method for taking advantage of technical terminology in Japanese documents
IRAL '00 Proceedings of the fifth international workshop on on Information retrieval with Asian languages
Using variable length ngrams for retrieving technical abstracts in Japanese (poster session)
IRAL '00 Proceedings of the fifth international workshop on on Information retrieval with Asian languages
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
Two-dimensional substring indexing
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Transactions on Internet Technology (TOIT)
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
An experimental study of priority queues in external memory
Journal of Experimental Algorithmics (JEA)
A graph-based recommender system for digital library
Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital libraries
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
Suffix vector: space- and time-efficient alternative to suffix trees
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Simple and flexible detection of contiguous repeats using a suffix tree
Theoretical Computer Science
On the efficient evaluation of relaxed queries in biological databases
Proceedings of the eleventh international conference on Information and knowledge management
Database indexing for large DNA and protein sequence collections
The VLDB Journal — The International Journal on Very Large Data Bases
Reducing space for index implementation
Theoretical Computer Science
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Multidimensional matching and fast search in suffix trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Efficient Index Structures for String Databases
Proceedings of the 27th International Conference on Very Large Data Bases
A Database Index to Large Biological Sequences
Proceedings of the 27th International Conference on Very Large Data Bases
The Enhanced Suffix Array and Its Applications to Genome Analysis
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Linear-Time Construction of Two-Dimensional Suffix Trees
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
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
Suffix Vector: A Space-Efficient Suffix Tree Representation
ISAAC '01 Proceedings of the 12th 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
Engineering a Differencing and Compression Data Format
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Efficient Implementation of Lazy Suffix Trees
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
LEDA-SM Extending LEDA to Secondary Memory
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Efficient Data Mining from Large Text Databases
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Indexing Text with Approximate q-Grams
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Efficient Discovery of Proximity Patterns with Suffix Arrays
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
On-Line Construction of Compact Directed Acyclic Word Graphs
CPM '01 Proceedings of the 12th 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
A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Engineering a Lightweight Suffix Array Construction Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Metric Index for Approximate String Matching
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Representing Trees of Higer Degree
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Searching large text collections
Handbook of massive data sets
An Index Structure for Pattern Similarity Searching in DNA Microarray Data
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
DNA Sequence Compression Using the Burrows-Wheeler Transform
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
A note on Crochemore's repetitions algorithm - a fast space-efficient approach
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
A note on Crochemore's repetitions algorithm - a fast space-efficient approach
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Bidirectional construction of suffix trees
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
A repetition based measure for verification of text collections and for text categorization
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Two-dimensional substring indexing
Journal of Computer and System Sciences - Special issu on PODS 2001
Prototyping of Efficient Hardware Algorithms for Data Compression in Future Communication Systems
RSP '01 Proceedings of the 12th International Workshop on Rapid System Prototyping
Text sparsification via local maxima
Theoretical Computer Science
Computing Highly Specific and Mismatch Tolerant Oligomers Efficiently
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
The SCP and Compressed Domain Analysis of Biological Sequences
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Fast and Accurate Probe Selection Algorithm for Large Genomes
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
The suffix binary search tree and suffix AVL tree
Journal of Discrete Algorithms
Mostly-unsupervised statistical segmentation of Japanese Kanji sequences
Natural Language Engineering
Mostly-unsupervised statistical segmentation of Japanese: applications to kanji
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
EMAGEN: an efficient approach to multiple whole genome alignment
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
SPINE: Putting Backbone into String Indexing
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
When indexing equals compression: experiments with compressing suffix arrays and applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A graph model for E-commerce recommender systems
Journal of the American Society for Information Science and Technology
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
New text indexing functionalities of the compressed suffix arrays
Journal of Algorithms
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
Efficient algorithms for the scaled indexing problem
Journal of Algorithms
Efficient Phrase-Based Document Indexing for Web Document Clustering
IEEE Transactions on Knowledge and Data Engineering
Inverting the Burrows—Wheeler transform
Journal of Functional Programming
Indexing text data under space constraints
Proceedings of the thirteenth ACM international conference on Information and knowledge management
An O(N^2) Algorithm for Discovering Optimal Boolean Pattern Pairs
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
WWW '05 Proceedings of the 14th international conference on World Wide Web
Algorithmic foundations of the internet
ACM SIGACT News
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
Acquiring vocabulary for predictive text entry through dynamic reuse of a small user corpus
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
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
Journal of the ACM (JACM)
Efficient Algorithms and Software for Detection of Full-Length LTR Retrotransposons
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
Newsmap: a knowledge map for online news
Decision Support Systems - Special issue: Collaborative work and knowledge management
Exact match search in sequence data using suffix trees
Proceedings of the 14th ACM international conference on Information and knowledge management
Fast Frequent String Mining Using Suffix Arrays
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Efficient algorithms for substring near neighbor problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An efficient approach for sequence matching in large DNA databases
Journal of Information Science
Dynamic programming matching for large scale information retrieval
AsianIR '03 Proceedings of the sixth international workshop on Information retrieval with Asian languages - Volume 11
An efficient DNA sequence searching method using position specific weighting scheme
Journal of Information Science
LZ trie and dictionary compression
Software—Practice & Experience
Software—Practice & Experience
An approximation to the greedy algorithm for differential compression
IBM Journal of Research and Development - Spintronics
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
Fast and space efficient string kernels using suffix arrays
ICML '06 Proceedings of the 23rd international conference on Machine learning
Suffix arrays: what are they good for?
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Reference-based indexing of sequence databases
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Clustering and indexing of experience sequences for popularity-driven recommendations
Proceedings of the 3rd ACM workshop on Continuous archival and retrival of personal experences
A data structure for a sequence of string accesses in external memory
ACM Transactions on Algorithms (TALG)
Succinct suffix arrays based on run-length encoding
Nordic Journal of Computing
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)
Constructing large suffix trees on a computational grid
Journal of Parallel and Distributed Computing
Computing suffix links for suffix trees and arrays
Information Processing Letters
Succinct data structures for flexible text retrieval systems
Journal of Discrete Algorithms
Efficient parameterized string matching
Information Processing Letters
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
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)
A taxonomy of suffix array construction algorithms
ACM Computing Surveys (CSUR)
A new suffix tree similarity measure for document clustering
Proceedings of the 16th international conference on World Wide Web
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Compressed indexes for approximate string matching
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Efficient token based clone detection with flexible tokenization
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Indexing schemes for similarity search in datasets of short protein fragments
Information Systems
Comparative n-gram analysis of whole-genome protein sequences
HLT '02 Proceedings of the second international conference on Human Language Technology Research
Theoretical Computer Science
Scalable parallel suffix array construction
Parallel Computing
Efficient token based clone detection with flexible tokenization
The 6th Joint Meeting on European software engineering conference and the ACM SIGSOFT symposium on the foundations of software engineering: companion papers
Journal of Discrete Algorithms
Fast BWT in small space by blockwise suffix sorting
Theoretical Computer Science
Theoretical Computer Science
Rank and select revisited and extended
Theoretical Computer Science
Theoretical Computer Science
The affix array data structure and its applications to RNA secondary structure analysis
Theoretical Computer Science
Fast blocking of undesirable web pages on client PC by discriminating URL using neural networks
Expert Systems with Applications: An International Journal
Fast nGram-based string search over data encoded using algebraic signatures
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
ACM Transactions on Algorithms (TALG)
Faster index for property matching
Information Processing Letters
Computing Longest Previous Factor in linear time and applications
Information Processing Letters
The SBC-tree: an index for run-length compressed sequences
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Dynamic entropy-compressed sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
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
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Lossless filter for multiple repetitions with Hamming distance
Journal of Discrete Algorithms
Better external memory suffix array construction
Journal of Experimental Algorithmics (JEA)
The chilling descent: making the transition to a conventional curriculum
Proceedings of the 2008 international workshop on Functional and declarative programming in education
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II
Dynamic Fully-Compressed Suffix Trees
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
Fast and Adaptive Variable Order Markov Chain Construction
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Succinct backward-DAWG-matching
Journal of Experimental Algorithmics (JEA)
Compressed text indexes: From theory to practice
Journal of Experimental Algorithmics (JEA)
A new method for indexing genomes using on-disk suffix trees
Proceedings of the 17th ACM conference on Information and knowledge management
Empirical evaluation of clone detection using syntax suffix trees
Empirical Software Engineering
Speeding Up Pattern Matching by Text Sampling
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Self-indexing Natural Language
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Cell probe lower bounds for succinct data structures
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell
PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
New Frontiers in Applied Data Mining
CICLing '09 Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing
Reducing Space Requirements for Disk Resident Suffix Arrays
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Counting Parameterized Border Arrays for a Binary Alphabet
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A survey of Web clustering engines
ACM Computing Surveys (CSUR)
Simple Random Access Compression
Fundamenta Informaticae
Sub-sentential alignment using substring co-occurrence counts
COLING ACL '06 Proceedings of the 21st International Conference on computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop
Storage and Retrieval of Individual Genomes
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Permuted Longest-Common-Prefix Array
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
Application of the Burrows-Wheeler Transform for searching for tandem repeats in DNA sequences
International Journal of Bioinformatics Research and Applications
Engineering a compressed suffix tree implementation
Journal of Experimental Algorithmics (JEA)
Errata for “Faster index for property matching”
Information Processing Letters
Tera-scale translation models via pattern matching
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Distributed language modeling for N-best list re-ranking
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Rank/select on dynamic compressed sequences and applications
Theoretical Computer Science
A Compressed Enhanced Suffix Array Supporting Fast String Matching
SPIRE '09 Proceedings of the 16th 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
Indexing Variable Length Substrings for Exact and Approximate 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
GAME: A simple and efficient whole genome alignment method using maximal exact match filtering
Computational Biology and Chemistry
AS-index: a structure for string search using n-grams and algebraic signatures
Proceedings of the 18th ACM conference on Information and knowledge management
Efficient pattern detection in extremely resource-constrained devices
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Succinct Index for Dynamic Dictionary Matching
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics
Construction of Aho Corasick automaton in linear time for integer alphabets
Information Processing Letters
Scalable parallel word search in multicore/multiprocessor systems
The Journal of Supercomputing
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Information Processing Letters
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
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
Efficient and scalable indexing techniques for biological sequence data
BIRD'07 Proceedings of the 1st international conference on Bioinformatics research and development
Efficient construction of FM-index using overlapping block processing for large scale texts
ECIR'07 Proceedings of the 29th European conference on IR research
Engineering a compressed suffix tree implementation
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
An incremental algorithm for efficient unique signature discoveries on DNA databases
Proceedings of the 2010 ACM Symposium on Applied Computing
Towards a wrapper-driven ontology-based framework for knowledge extraction
KSEM'07 Proceedings of the 2nd international conference on Knowledge science, engineering and management
A fast preprocessing algorithm to select gene-specific probes of DNA microarrays
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Implicit compression boosting with applications to self-indexing
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Approximate string matching with Lempel-Ziv compressed indexes
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Unsupervised spam detection based on string alienness measures
DS'07 Proceedings of the 10th international conference on Discovery science
An efficient algorithm for finding similar short substrings from large scale string data
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
HPRD: a high performance RDF database
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Improved dynamic rank-select entropy-bound structures
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A compressed self-indexed representation of XML documents
ECDL'09 Proceedings of the 13th European conference on Research and advanced technology for digital libraries
DMP-tree: A dynamic M-way prefix tree data structure for strings matching
Computers and Electrical Engineering
An efficient algorithm for unsupervised word segmentation with branching entropy and MDL
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Bidirectional search in a string with wavelet trees
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Approximate all-pairs suffix/prefix overlaps
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
Parallel and distributed compressed indexes
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
An efficient duplicate record detection using q-grams array inverted index
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Top-k ranked document search in general text databases
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Algorithms and theory of computation handbook
Practical approaches to reduce the space requirement of lempel-ziv--based compressed text indices
Journal of Experimental Algorithmics (JEA)
A language-based approach to indexing heterogeneous multimedia lifelog
International Conference on Multimodal Interfaces and the Workshop on Machine Learning for Multimodal Interaction
Sparse substring pattern set discovery using linear programming boosting
DS'10 Proceedings of the 13th international conference on Discovery science
String retrieval for multi-pattern queries
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Colored range queries and document retrieval
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
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
The indexing for one-dimensional proportionally-scaled strings
Information Processing Letters
Position heaps: A simple and dynamic text indexing data structure
Journal of Discrete Algorithms
Suffix trees for inputs larger than main memory
Information Systems
On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
Information Processing Letters
Space-efficient construction of Lempel-Ziv compressed text indexes
Information and Computation
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science
Worst case efficient single and multiple string matching in the RAM model
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Cache-oblivious index for approximate string matching
Theoretical Computer Science
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
Succinct indexes for strings, binary relations and multilabeled trees
ACM Transactions on Algorithms (TALG)
ACM Transactions on Algorithms (TALG)
Practical compressed document retrieval
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
PSAEC: an improved algorithm for short read error correction using partial suffix arrays
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
An efficient hybrid approach to correcting errors in short reads
MDAI'11 Proceedings of the 8th international conference on Modeling decisions for artificial intelligence
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Reversing longest previous factor tables is hard
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Alphabet-independent compressed text indexing
ESA'11 Proceedings of the 19th European conference on Algorithms
Near real-time suffix tree construction via the fringe marked ancestor problem
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
Compressed text indexing with wildcards
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
On suffix extensions in suffix trees
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Improved compressed indexes for full-text document retrieval
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Compressed indexes for aligned pattern matching
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Verifying and enumerating parameterized border arrays
Theoretical Computer Science
Text vs. space: efficient geo-search query processing
Proceedings of the 20th ACM international conference on Information and knowledge management
Representing document as dependency graph for document clustering
Proceedings of the 20th ACM international conference on Information and knowledge management
A linear size index for approximate pattern matching
Journal of Discrete Algorithms
Searching patterns in digital image databases
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
A new efficient indexing algorithm for one-dimensional real scaled patterns
Journal of Computer and System Sciences
Relative Lempel-Ziv factorization for efficient storage and retrieval of web collections
Proceedings of the VLDB Endowment
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
SIAM Journal on Computing
An indexing method for two-d pattern matching with applications to digital image searches
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Optimal string mining under frequency constraints
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
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
Transcription factor binding sites prediction based on sequence similarity
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
Word-based self-indexes for natural language text
ACM Transactions on Information Systems (TOIS)
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
A linear size index for approximate pattern matching
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Dynamic entropy-compressed sequences and full-text indexes
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
A new combinatorial approach to sequence comparison
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Optimal in-place sorting of vectors and records
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Space efficient algorithms for the burrows-wheeler backtransformation
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Inverted files versus suffix arrays for locating patterns in primary memory
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
O(n2 log n) time on-line construction of two-dimensional suffix trees
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
ISCSLP'06 Proceedings of the 5th international conference on Chinese Spoken Language Processing
Optimal succinctness for range minimum queries
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Practical compressed suffix trees
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Space-efficient construction of LZ-index
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
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
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
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
A modification of the landau-vishkin algorithm computing longest common extensions via suffix arrays
BSB'05 Proceedings of the 2005 Brazilian conference on Advances in Bioinformatics and Computational Biology
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
Efficient algorithms for three variants of the LPF table
Journal of Discrete Algorithms
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Evaluating subtopic retrieval methods: Clustering versus diversification of search results
Information Processing and Management: an International Journal
Search engines and web information retrieval
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Indexing DNA sequences using q-grams
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
New algorithms on wavelet trees and applications to information retrieval
Theoretical Computer Science
On demand string sorting over unbounded alphabets
Theoretical Computer Science
Bidirectional search in a string with wavelet trees and bidirectional matching statistics
Information and Computation
Approximate all-pairs suffix/prefix overlaps
Information and Computation
Towards automatic functional test execution
Proceedings of the 2012 ACM international conference on Intelligent User Interfaces
Collaborative discovery through biological language modeling interface
Ambient Intelligence in Everyday Life
Unified view of backward backtracking in short read mapping
Algorithms and Applications
A fast suffix-sorting algorithm
General Theory of Information Transfer and Combinatorics
Parameterized longest previous factor
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
p-Suffix sorting as arithmetic coding
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Counting suffix arrays and strings
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Position-Restricted substring searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Clustering near-identical sequences for fast homology search
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Fast discovery of similar sequences in large genomic collections
ECIR'06 Proceedings of the 28th European conference on Advances in Information Retrieval
Association rule centric clustering of web search results
MIWAI'11 Proceedings of the 5th international conference on Multi-Disciplinary Trends in Artificial Intelligence
Succinct indexes for circular patterns
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Parameterized longest previous factor
Theoretical Computer Science
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
Journal of Discrete Algorithms
A linearly computable measure of string complexity
Theoretical Computer Science
Indexed multi-pattern matching
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
Efficient in-memory top-k document retrieval
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
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
ALAE: accelerating local alignment with affine gap exactly in biosequence databases
Proceedings of the VLDB Endowment
Full-text search on multi-byte encoded documents
Proceedings of the 2012 ACM symposium on Document engineering
Self-Indexed Grammar-Based Compression
Fundamenta Informaticae
Simple Random Access Compression
Fundamenta Informaticae
Variations of the parameterized longest previous factor
Journal of Discrete Algorithms
p-Suffix sorting as arithmetic coding
Journal of Discrete Algorithms
On suffix extensions in suffix trees
Theoretical Computer Science
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Space-Efficient top-k document retrieval
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Towards an optimal space-and-query-time index for top-k document retrieval
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Document listing for queries with excluded pattern
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
Computing regularities in strings: A survey
European Journal of Combinatorics
Computing the Longest Previous Factor
European Journal of Combinatorics
Generalized biwords for bitext compression and translation spotting
Journal of Artificial Intelligence Research
On demand string sorting over unbounded alphabets
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Cache-oblivious index for approximate string matching
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
A Lempel-Ziv text index on secondary storage
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Compressed text indexes with fast locate
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
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 simple construction of two-dimensional suffix trees in linear time
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Optimal lightweight construction of suffix arrays for constant alphabets
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
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
DACs: Bringing direct access to variable-length codes
Information Processing and Management: an International Journal
Distributed string mining for high-throughput sequencing data
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Compressed suffix trees for repetitive texts
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Parikh matching in the streaming model
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Smaller self-indexes for natural language
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
On position restricted substring searching in succinct space
Journal of Discrete Algorithms
Improved compressed indexes for full-text document retrieval
Journal of Discrete Algorithms
Computing the longest common prefix array based on the Burrows-Wheeler transform
Journal of Discrete Algorithms
Near real-time suffix tree construction via the fringe marked ancestor problem
Journal of Discrete Algorithms
Fast q-gram mining on SLP compressed strings
Journal of Discrete Algorithms
Compressed text indexing with wildcards
Journal of Discrete Algorithms
On compressing and indexing repetitive sequences
Theoretical Computer Science
Colored range queries and document retrieval
Theoretical Computer Science
Juggling the Jigsaw: towards automated problem inference from network trouble tickets
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Trends in suffix sorting: a survey of low memory algorithms
ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122
Distributional phrasal paraphrase generation for statistical machine translation
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Sections on Paraphrasing; Intelligent Systems for Socially Aware Computing; Social Computing, Behavioral-Cultural Modeling, and Prediction
Efficient parallel construction of suffix trees for genomes larger than main memory
Proceedings of the 20th European MPI Users' Group Meeting
Practical linear-time O(1)-workspace suffix sorting for constant alphabets
ACM Transactions on Information Systems (TOIS)
Searching similar segments over textual event sequences
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Suffix Array Construction in External Memory Using D-Critical Substrings
ACM Transactions on Information Systems (TOIS)
Sparse suffix tree construction in small space
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
RCSI: scalable similarity search in thousand(s) of genomes
Proceedings of the VLDB Endowment
On the combinatorics of suffix arrays
Information Processing Letters
Generalized biwords for bitext compression and translation spotting: extended abstract
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Compressed property suffix trees
Information and Computation
Journal of Discrete Algorithms
| Hi-index | 0.03 |