The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Order-n correction for regular languages
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Complete inverted files for efficient text retrieval and analysis
Journal of the ACM (JACM)
Data compression with finite windows
Communications of the ACM
Algorithms for string searching
ACM SIGIR Forum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automata-driven indexing of Prolog clauses
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of the ACM (JACM)
The shortest feedback shift register that can generate a given sequence
CRYPTO '89 Proceedings on Advances in cryptology
Alphabet independent two dimensional matching
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
(Un)expected behavior of typical suffix trees
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Pattern matching in a digitized image
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Sparse dynamic programming I: linear cost functions
Journal of the ACM (JACM)
Parallel construction and query of suffix trees for two-dimensional matrices
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An object-oriented genetics information system
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Combinatorial pattern discovery for scientific data: some preliminary results
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Journal of Computer and System Sciences
Linear pattern matching of repeated substrings
ACM SIGACT News
Optimal parallel suffix tree construction
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Symmetry breaking for suffix tree construction
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Large-scale assembly of DNA strings and space-efficient construction of suffix trees
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Estimating alphanumeric selectivity in the presence of wildcards
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Discovering Patterns from Large and Dynamic Sequential Data
Journal of Intelligent Information Systems
Journal of Mathematical Imaging and Vision
Delta algorithms: an empirical analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
q-gram based database searching using a suffix array (QUASAR)
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Enhanced code compression for embedded RISC processors
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Substring selectivity estimation
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Pattern Matching Image Compression: Algorithmic and Empirical Results
IEEE Transactions on Pattern Analysis and Machine Intelligence
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
The Suffix of a square matrix, with applications
SODA '93 Proceedings of the fourth 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
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for dynamic text indexing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Let sleeping files lie: pattern matching in Z-compressed files
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Adaptive query processing for time-series data
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Efficient pattern matching with scaling
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Linear Algorithm for Data Compression via String Matching
Journal of the ACM (JACM)
Data compression via textual substitution
Journal of the ACM (JACM)
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Selectively estimation for Boolean queries
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
On effective multi-dimensional indexing for strings
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Faster algorithms for string matching with k mismatches
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Pattern matching in dynamic texts
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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)
The string-to-string correction problem with block moves
ACM Transactions on Computer Systems (TOCS)
On improving the worst case running time of the Boyer-Moore string matching algorithm
Communications of the ACM
A linear lower bound on index size for text retrieval
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Two-dimensional substring indexing
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Analyzing and compressing assembly code
SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
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
The effectiveness study of various music information retrieval approaches
Proceedings of the eleventh international conference on Information and knowledge management
A speed-up for the commute between subword trees and DAWGs
Information Processing Letters
A Data Structure for Circular String Analysis and Visualization
IEEE Transactions on Computers
Computing Display Conflicts in String Visualization
IEEE Transactions on Computers
Tries for Approximate String Matching
IEEE Transactions on Knowledge and Data Engineering
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
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Space-Economical Construction of Index Structures for All Suffixes of a String
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Multi-Dimensional Substring Selectivity Estimation
VLDB '99 Proceedings of the 25th 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
Generalization of a Suffix Tree for RNA Structural Pattern Matching
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Indexing and Dictionary Matching with One Error
WADS '99 Proceedings of the 6th 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
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
Discovering and Matching Elastic Rules from Sequence Databases
ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Mining Structured Association Patterns from Databases
PADKK '00 Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current Issues and New Applications
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
The S2-Tree: An Index Structure for Subsequence Matching of Spatial Objects
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
Compact Directed Acyclic Word Graphs for a Sliding Window
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
Massively Parallel Suffix Array Construction
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Validation and Decomposition of Partially Occluded Images
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
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
Advanced Compiler Optimization for Calm RISC8 Low-End Embedded Processor
CC '00 Proceedings of the 9th International Conference on Compiler Construction
A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Efficient Data Mining from Large Text Databases
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Finding Maximal Quasiperiodicities in Strings
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Improving Static Compression Schemes by Alphabet Extension
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Linear Bidirectional On-Line Construction of Affix Trees
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
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
Characteristic Sets of Strings Common to Semi-structured Documents
DS '99 Proceedings of the Second International Conference on Discovery Science
A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Finding Maximal Pairs with Bounded Gap
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Augmenting Suffix Trees, with Applications
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Range Searching Over Tree Cross Products
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
A Metric Index for Approximate String Matching
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
One-dimensional and multi-dimensional substring selectivity estimation
The VLDB Journal — The International Journal on Very Large Data Bases
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
Software—Practice & Experience
Subject space: a state-persistent model for publish/subscribe systems
CASCON '02 Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research
PPM Performance with BWT Complexity: A New Method for Lossless Data Compression
DCC '00 Proceedings of the Conference on Data Compression
An Index Structure for Pattern Similarity Searching in DNA Microarray Data
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Accelerating Approximate Subsequence Search on Large Protein Sequence Databases
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Towards Automatic Clustering of Protein Sequences
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
Finding Maximal Repetitions in a Word in Linear Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Building a complete inverted file for a set of text files in linear time
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On finding duplication and near-duplication in large software systems
WCRE '95 Proceedings of the Second Working Conference on Reverse Engineering
Bidirectional construction of suffix trees
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Generalized substring selectivity estimation
Journal of Computer and System Sciences - Special issue on PODS 2000
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Two-dimensional substring indexing
Journal of Computer and System Sciences - Special issu on PODS 2001
ViST: a dynamic index method for querying XML data by tree structures
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Truncated suffix trees and their application to data compression
Theoretical Computer Science
The SCP and Compressed Domain Analysis of Biological Sequences
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Lyndon words, permutations and trees
Theoretical Computer Science - WORDS
Data structuring application for string problems in biological sequences
ICCMSE '03 Proceedings of the international conference on Computational methods in sciences and engineering
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
A parallel algorithm for the extraction of structured motifs
Proceedings of the 2004 ACM symposium on Applied computing
Random Structures & Algorithms
Honeycomb: creating intrusion detection signatures using honeypots
ACM SIGCOMM Computer Communication Review
MARSYAS: a framework for audio analysis
Organised Sound
Efficient K-NN search in polyphonic music databases using a lower bounding mechanism
MIR '03 Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval
Finding anchors for genomic sequence comparison
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Constructing chromosome scale suffix trees
APBC '04 Proceedings of the second conference on Asia-Pacific bioinformatics - Volume 29
Engineering a Fast Online Persistent Suffix Tree Construction
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
String transformation learning
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
A memory-based approach to learning shallow natural language patterns
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
When indexing equals compression: experiments with compressing suffix arrays and applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Compression boosting in optimal linear time using the Burrows-Wheeler Transform
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
Compact directed acyclic word graphs for a sliding window
Journal of Discrete Algorithms - SPIRE 2002
Verbumculus and the discovery of unusual words
Journal of Computer Science and Technology - Special issue on bioinformatics
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
Fast prefix matching of bounded strings
Journal of Experimental Algorithmics (JEA)
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
Efficient algorithms for the scaled indexing problem
Journal of Algorithms
Discovering user profiles for web personalized recommendation
Journal of Computer Science and Technology
Indexing text data under space constraints
Proceedings of the thirteenth ACM international conference on Information and knowledge management
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
Antisequential Suffix Sorting for BWT-Based Data Compression
IEEE Transactions on Computers
Ternary directed acyclic word graphs
Theoretical Computer Science - Implementation and application of automata
On the Sequencing of Tree Structures for XML Indexing
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Partial words and the critical factorization theorem
Journal of Combinatorial Theory Series A
Dynamic dictionary matching and compressed suffix trees
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Pattern-based similarity search for microarray data
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Journal of the ACM (JACM)
Boosting textual compression in optimal linear time
Journal of the ACM (JACM)
PSIST: Indexing Protein Structures Using Suffix Trees
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
Enhanced code density of embedded CISC processors with echo technology
CODES+ISSS '05 Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Practical methods for constructing suffix trees
The VLDB Journal — The International Journal on Very Large Data Bases
Exact match search in sequence data using suffix trees
Proceedings of the 14th ACM international conference on Information and knowledge management
A Genetic Engineering Approach to Genetic Algorithms
Evolutionary Computation
Oblivious string embeddings and edit distance approximations
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Software—Practice & Experience
q-Gram Matching Using Tree Models
IEEE Transactions on Knowledge and Data Engineering
Evaluating structural summaries as access methods for XML
Proceedings of the 15th international conference on World Wide Web
An Efficient Algorithm for the Identification of Structured Motifs in DNA Promoter Sequences
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
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
Reducing the human overhead in text categorization
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Polymorphic worm detection and defense: system design, experimental methodology, and data resources
Proceedings of the 2006 SIGCOMM workshop on Large-scale attack defense
Reference-based indexing of sequence databases
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
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)
Discovering and Matching Elastic Rules from Sequence Databases
Fundamenta Informaticae - Intelligent Systems
Computing suffix links for suffix trees and arrays
Information Processing Letters
All maximal-pairs in step-leap representation of melodic sequence
Information Sciences: an International Journal
Data & Knowledge Engineering
Dynamic text and static pattern matching
ACM Transactions on Algorithms (TALG)
Compressed indexes for dynamic text collections
ACM Transactions on Algorithms (TALG)
Algorithms for extracting motifs from biological weighted sequences
Journal of Discrete Algorithms
Linear time algorithm for the longest common repeat problem
Journal of Discrete Algorithms
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
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
HAT-trie: a cache-conscious trie-based data structure for strings
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Compressed indexes for approximate string matching
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Ultra-succinct representation of ordered trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
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
Partial words and the critical factorization theorem revisited
Theoretical Computer Science
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
Comparison and Evaluation of Clone Detection Tools
IEEE Transactions on Software Engineering
Finding Clones with Dup: Analysis of an Experiment
IEEE Transactions on Software Engineering
OASIS: an online and accurate technique for local-alignment searches on biological sequences
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Practical suffix tree construction
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Text document clustering based on frequent word meaning sequences
Data & Knowledge Engineering
The affix array data structure and its applications to RNA secondary structure analysis
Theoretical Computer Science
PSIST: A scalable approach to indexing protein structures using suffix trees
Journal of Parallel and Distributed Computing
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Faster index for property matching
Information Processing Letters
True suffix tree approach for discovering non-trivial repeating patterns in a music object
Multimedia Tools and Applications
Real-time indexing over fixed finite alphabets
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Comparing bacterial genomes from linear orders of patterns
Discrete Applied Mathematics
Compacting music signatures for efficient music retrieval
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
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
International Journal of Bioinformatics Research and Applications
Improving suffix array locality for fast pattern matching on disk
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Faster path indexes for search in XML data
ADC '08 Proceedings of the nineteenth conference on Australasian database - Volume 75
Generating links by mining quotations
Proceedings of the nineteenth ACM conference on Hypertext and hypermedia
Fast profile matching algorithms – A survey
Theoretical Computer Science
Property matching and weighted matching
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
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
An efficient parallel approach for identifying protein families in large-scale metagenomic data sets
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
Optimal prefix and suffix queries on texts
Information Processing Letters
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
An Efficient XML Index Structure with Bottom-Up Query Processing
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Chinese Word Segmentation for Terrorism-Related Contents
PAISI, PACCF and SOCO '08 Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics
On-line construction of compact suffix vectors and maximal repeats
Theoretical Computer Science
Proceedings of the VLDB Endowment
Empirical evaluation of clone detection using syntax suffix trees
Empirical Software Engineering
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
Real-valued feature indexing for music databases
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Improving on-line construction of two-dimensional suffix trees for square matrices
Information Processing Letters
On the Construction of an Antidictionary with Linear Complexity Using the Suffix Tree
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Comparison and evaluation of code clone detection techniques and tools: A qualitative approach
Science of Computer Programming
Discovering subword associations in strings in time linear in the output size
Journal of Discrete Algorithms
Reducing Space Requirements for Disk Resident Suffix Arrays
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Scalable multi-feature index structure for music databases
Information Sciences: an International Journal
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Procedural Abstraction with Reverse Prefix Trees
Proceedings of the 7th annual IEEE/ACM International Symposium on Code Generation and Optimization
Pairwise sequence alignment algorithms: a survey
Proceedings of the 2009 conference on Information Science, Technology and Applications
Efficient discovery of unusual patterns in time series
New Generation Computing
Serial and parallel methods for i/o efficient suffix tree construction
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Generalized Substring Compression
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques
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)
Finding the longest common nonsuperstring in linear time
Information Processing Letters
Suffix tree characterization of maximal motifs in biological sequences
Theoretical Computer Science
On-Line Construction of Parameterized Suffix Trees
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
Efficient Index for Retrieving Top-k Most Frequent Documents
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Mining Peculiar Compositions of Frequent Substrings from Sparse Text Data Using Background Texts
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
Space-economical partial gram indices for exact substring matching
Proceedings of the 18th ACM conference on Information and knowledge management
Suffix trees for very large genomic sequences
Proceedings of the 18th ACM conference on Information and knowledge management
Privacy-preserving genomic computation through program specialization
Proceedings of the 16th ACM conference on Computer and communications security
Indexing genomic sequences on the IBM Blue Gene
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Mining Local Correlation Patterns in Sets of Sequences
DS '09 Proceedings of the 12th International Conference on Discovery Science
Succinct Index for Dynamic Dictionary Matching
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Efficient sparse self-similarity matrix construction for repeating sequence detection
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics
Clone detection and elimination for Haskell
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Geometric suffix tree: Indexing protein 3-D structures
Journal of the ACM (JACM)
Quantitative analysis of treebanks using frequent subtree mining methods
TextGraphs-4 Proceedings of the 2009 Workshop on Graph-based Methods for Natural Language Processing
Construction of Aho Corasick automaton in linear time for integer alphabets
Information Processing Letters
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Scalable parallel word search in multicore/multiprocessor systems
The Journal of Supercomputing
Suffix tree construction algorithms on modern hardware
Proceedings of the 13th International Conference on Extending Database Technology
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Dynamic extended suffix arrays
Journal of Discrete Algorithms
Suffix trees and string complexity
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
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
Fast construction of generalized suffix trees over a very large alphabet
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Ternary directed acyclic word graphs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Efficient and scalable indexing techniques for biological sequence data
BIRD'07 Proceedings of the 1st international conference on Bioinformatics research and development
Suffix automata and standard sturmian words
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Prefix-shuffled geometric suffix tree
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
Space efficient indexes for string matching with don't cares
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Efficient computation of shortest absent words in a genomic sequence
Information Processing Letters
An annotated k-deep prefix tree for (1-k)-mer based sequence comparisons
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
Service Oriented Computing and Applications
I/O efficient algorithms for serial and parallel suffix tree construction
ACM Transactions on Database Systems (TODS)
Representing sequences in description logics
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Engineering scalable, cache and space efficient tries for strings
The VLDB Journal — The International Journal on Very Large Data Bases
Road network reconstruction for organizing paths
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Multiple genome alignment based on longest path in directed acyclic graphs
International Journal of Bioinformatics Research and Applications
A minimal periods algorithm with applications
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
The property suffix tree with dynamic properties
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
Efficient index for retrieving top-k most frequent documents
Journal of Discrete Algorithms
Algorithms and theory of computation handbook
Finding Patterns In Given Intervals
Fundamenta Informaticae
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
IEEE Transactions on Information Technology in Biomedicine
On-line construction of parameterized suffix trees for large alphabets
Information Processing Letters
Faster compressed dictionary matching
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Suffix trees for inputs larger than main memory
Information Systems
Domain-specific Chinese word segmentation using suffix tree and mutual information
Information Systems Frontiers
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science
Cache-oblivious index for approximate string matching
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
Context-based online configuration-error detection
USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part I
Sparse and truncated suffix trees on variable-length codes
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Quick greedy computation for minimum common string partitions
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Refining causality: who copied from whom?
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
A new algorithm for sparse suffix trees
BSB'11 Proceedings of the 6th Brazilian conference on Advances in bioinformatics and computational biology
ERA: efficient serial and parallel suffix tree construction for very long strings
Proceedings of the VLDB Endowment
Persistency in suffix trees with applications to string interval problems
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
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
Compressed text indexing with wildcards
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
Verifying and enumerating parameterized border arrays
Theoretical Computer Science
Web Site Community Analysis Based on Suffix Tree and Clustering Algorithm
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
A linear size index for approximate pattern matching
Journal of Discrete Algorithms
A new efficient indexing algorithm for one-dimensional real scaled patterns
Journal of Computer and System Sciences
A new unsupervised approach to word segmentation
Computational Linguistics
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
Discovering consensus patterns in biological databases
VDMB'06 Proceedings of the First international conference on Data Mining and Bioinformatics
Extracting statistics indicators from tables of basic structure
Pattern Recognition and Image Analysis
Search-Optimized suffix-tree storage for biological applications
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
A linear size index for approximate pattern matching
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
On-Line linear-time construction of word suffix trees
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
Geometric suffix tree: a new index structure for protein 3-d structures
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
Indexing of sequences of sets for efficient exact and similar subsequence matching
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
WSDL term tokenization methods for IR-style Web services discovery
Science of Computer Programming
Ultra-succinct representation of ordered trees with applications
Journal of Computer and System Sciences
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
Dotted suffix trees a structure for approximate text indexing
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
Practical compressed suffix trees
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Locally consistent parsing and applications to approximate string comparisons
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Suffix tree based data compression
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Approximate matching in the L1 metric
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
Rotamer-pair energy calculations using a trie data structure
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
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
Indexing and searching a mass spectrometry database
Algorithms and Applications
From nondeterministic suffix automaton to lazy suffix tree
Algorithms and Applications
Indexing a dictionary for subset matching queries
Algorithms and Applications
Unified view of backward backtracking in short read mapping
Algorithms and Applications
Towards real-time suffix tree construction
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
Information retrieval of sequential data in heterogeneous XML databases
AMR'05 Proceedings of the Third international conference on Adaptive Multimedia Retrieval: user, context, and feedback
Efficient enumeration of phylogenetically informative substrings
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Improving suffix tree clustering with new ranking and similarity measures
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
BpMatch: An Efficient Algorithm for a Segmental Analysis of Genomic Sequences
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
Full-text search on multi-byte encoded documents
Proceedings of the 2012 ACM symposium on Document engineering
On suffix extensions in suffix trees
Theoretical Computer Science
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial 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
Compact Suffix Array — A Space-Efficient Full-Text Index
Fundamenta Informaticae - Computing Patterns in Strings
Discovering and Matching Elastic Rules from Sequence Databases
Fundamenta Informaticae - Intelligent Systems
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
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
Cache-oblivious index for approximate string matching
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
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
Range non-overlapping indexing and successive list indexing
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
An XML data query method based on structure-encoded
WISM'12 Proceedings of the 2012 international conference on Web Information Systems and Mining
Compressed suffix trees for repetitive texts
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Efficient LZ78 factorization of grammar compressed text
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
Near real-time suffix tree construction via the fringe marked ancestor problem
Journal of Discrete Algorithms
Resource requirement prediction using clone detection technique
Future Generation Computer Systems
The user side of sustainability: Modeling behavior and energy usage in the home
Pervasive and Mobile Computing
Faster compressed dictionary matching
Theoretical Computer Science
Compressed text indexing with wildcards
Journal of Discrete Algorithms
Attributing authorship of revisioned content
Proceedings of the 22nd international conference on World Wide Web
Efficient parallel construction of suffix trees for genomes larger than main memory
Proceedings of the 20th European MPI Users' Group Meeting
Viewing functions as token sequences to highlight similarities in source code
Science of Computer Programming
Efficient subsequence search in databases
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Fast computation of entropic profiles for the detection of conservation in genomes
PRIB'13 Proceedings of the 8th IAPR international conference on Pattern Recognition in Bioinformatics
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
RACE: a scalable and elastic parallel system for discovering repeats in very long sequences
Proceedings of the VLDB Endowment
Efficient techniques on retrieving bio-information for active U-healthcare
Personal and Ubiquitous Computing
Inferring strings from suffix trees and links on a binary alphabet
Discrete Applied Mathematics
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)
Journal of Discrete Algorithms
| Hi-index | 0.07 |
A new algorithm is presented for constructing auxiliary digital search trees to aid in exact-match substring searching. This algorithm has the same asymptotic running time bound as previously published algorithms, but is more economical in space. Some implementation considerations are discussed, and new work on the modification of these search trees in response to incremental changes in the strings they index (the update problem) is presented.