Journal of Computer and System Sciences
Linear pattern matching of repeated substrings
ACM SIGACT News
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
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
Parallel Algorithms for the Analysis of Biological Sequences
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
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
Generalization of a Suffix Tree for RNA Structural Pattern Matching
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Indexing and Dictionary Matching with One Error
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
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
Indexing and Mining of the Local Patterns in Sequence Database
IDEAL '02 Proceedings of the Third International Conference on Intelligent Data Engineering and Automated Learning
Constructing the Suffix Tree of a Tree with a Large Alphabet
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Suffix Vector: A Space-Efficient Suffix Tree Representation
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Space-Efficient Data Structures for Flexible Text Retrieval Systems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
An Improved Algorithm for Sequence Comparison with Block Reversals
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Optimal Exact Strring Matching Based on Suffix Arrays
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Compact Directed Acyclic Word Graphs for a Sliding Window
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Discovering Local Patterns from Multiple Temporal Sequences
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
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
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
Efficient Implementation of Lazy Suffix Trees
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
GD '99 Proceedings of the 7th International Symposium on Graph Drawing
Finding Maximal Quasiperiodicities in Strings
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Using Suffix Trees for Gapped Motif Discovery
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
The Minimum DAWG for All Suffixes of a String and Its Applications
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Finding Maximal Pairs with Bounded Gap
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Range Searching Over Tree Cross Products
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Fast and Sensitive Probe Selection for DNA Chips Using Jumps in Matching Statistics
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
An Algebra for Inductive Query Evaluation
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Engineering a Fast Online Persistent Suffix Tree Construction
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Structuring labeled trees for optimal succinctness, and beyond
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
q-Gram Matching Using Tree Models
IEEE Transactions on Knowledge and Data Engineering
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
Journal of Discrete Algorithms
Compressed indexes for approximate string matching
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Journal of Discrete Algorithms
Algorithms for String Pattern Discovery
MDAI '07 Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence
Dynamic Fully-Compressed Suffix Trees
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
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
An Online Algorithm for Finding the Longest Previous Factors
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Efficient on-line repetition detection
Theoretical Computer Science
On-line construction of compact suffix vectors and maximal repeats
Theoretical Computer Science
Improved count suffix trees for natural language data
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Succinct backward-DAWG-matching
Journal of Experimental Algorithmics (JEA)
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
Indexed Hierarchical Approximate String Matching
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
Data compression procedures utilizing the similarity of data
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
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
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
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
The design of a similarity based deduplication system
SYSTOR '09 Proceedings of SYSTOR 2009: The Israeli Experimental Systems Conference
Scalable multi-feature index structure for music databases
Information Sciences: an International Journal
Procedural Abstraction with Reverse Prefix Trees
Proceedings of the 7th annual IEEE/ACM International Symposium on Code Generation and Optimization
Simple Random Access Compression
Fundamenta Informaticae
Pairwise sequence alignment algorithms: a survey
Proceedings of the 2009 conference on Information Science, Technology and Applications
A stochastic memoizer for sequence data
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
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
Efficient construction of maximal and minimal representations of motifs of a string
Theoretical Computer Science
Generalized Substring Compression
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
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
Engineering a compressed suffix tree implementation
Journal of Experimental Algorithmics (JEA)
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
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
Efficient Index for Retrieving Top-k Most Frequent Documents
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
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
STC+ and NM-STC: Two Novel Online Results Clustering Methods for Web Searching
WISE '09 Proceedings of the 10th International Conference on Web Information Systems Engineering
Succinct Index for Dynamic Dictionary Matching
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Range Non-overlapping Indexing
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics
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
Efficient algorithms for the block edit problems
Information and Computation
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Dynamic extended suffix arrays
Journal of Discrete Algorithms
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
A faster query algorithm for the text fingerprinting problem
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Approximate swap and mismatch edit distance
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
Prefix-shuffled geometric suffix tree
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Space efficient indexes for string matching with don't cares
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Squeezing long sequence data for efficient similarity search
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Towards a multi-scale approach for source code approximate match report
Proceedings of the 4th International Workshop on Software Clones
String matching with up to k swaps and mismatches
Information and Computation
I/O efficient algorithms for serial and parallel suffix tree construction
ACM Transactions on Database Systems (TODS)
The approximate swap and mismatch edit distance
Theoretical Computer Science
Result-size estimation for information-retrieval subqueries
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
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
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
Fast index for approximate string matching
Journal of Discrete Algorithms
Efficient index for retrieving top-k most frequent documents
Journal of Discrete Algorithms
Algorithms and theory of computation handbook
Size Matters: Space/Time Tradeoffs to Improve GPGPU Applications Performance
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
IEEE Transactions on Information Technology in Biomedicine
On-line construction of parameterized suffix trees for large alphabets
Information Processing Letters
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
Training parse trees for efficient VF coding
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Faster compressed dictionary matching
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
Position heaps: A simple and dynamic text indexing data structure
Journal of Discrete Algorithms
Journal of Discrete Algorithms
Domain-specific Chinese word segmentation using suffix tree and mutual information
Information Systems Frontiers
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
Cache-oblivious index for approximate string matching
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
Inverted indexes for phrases and strings
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Succincter text indexing with wildcards
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
Identify fixed-path phishing attack by STC
Proceedings of the 8th Annual Collaboration, Electronic messaging, Anti-Abuse and Spam Conference
Compressed directed acyclic word graph with application in local alignment
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Adaptive context modeling for deception detection in emails
MLDM'11 Proceedings of the 7th international conference on Machine learning and data mining in pattern recognition
Alphabet-independent compressed text indexing
ESA'11 Proceedings of the 19th European conference on Algorithms
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
On-line construction of position heaps
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
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
An efficient algorithm for mining string databases under constraints
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
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
Extracting statistics indicators from tables of basic structure
Pattern Recognition and Image Analysis
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Word-based self-indexes for natural language text
ACM Transactions on Information Systems (TOIS)
Top-k document retrieval in optimal time and linear space
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
Property matching and weighted matching
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
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
Ultra-succinct representation of ordered trees with applications
Journal of Computer and System Sciences
Sparse directed acyclic word graphs
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
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
Succinct text indexes on large alphabet
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
AISS: an index for non-timestamped set subsequence queries
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Practical compressed suffix trees
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
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
Succinct suffix arrays based on run-length encoding
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
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Indexing DNA sequences using q-grams
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
On demand string sorting over unbounded alphabets
Theoretical Computer Science
Approximate all-pairs suffix/prefix overlaps
Information and Computation
Collaborative discovery through biological language modeling interface
Ambient Intelligence in Everyday Life
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
Reversal distance for strings with duplicates: linear time approximation using hitting set
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Towards real-time suffix tree construction
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Rank-Sensitive data structures
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Efficient enumeration of phylogenetically informative substrings
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Information Processing and Management: an International Journal
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
Succinct indexes for circular patterns
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
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)
Recent developments in the theory of data structures
Computer Languages
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
Trie-based apriori motif discovery approach
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
Minimum Unique Substrings and Maximum Repeats
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Simple Random Access Compression
Fundamenta Informaticae
On suffix extensions in suffix trees
Theoretical Computer Science
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
String indexing for patterns with wildcards
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Compact Suffix Array — A Space-Efficient Full-Text Index
Fundamenta Informaticae - Computing Patterns in Strings
A randomized Numerical Aligner (rNA)
Journal of Computer and System Sciences
A comparison of index-based lempel-Ziv LZ77 factorization algorithms
ACM Computing Surveys (CSUR)
Computing regularities in strings: A survey
European Journal of Combinatorics
Measuring structural similarity of semistructured data based on information-theoretic approaches
The VLDB Journal — The International Journal on Very Large Data Bases
An efficient algorithm for identifying the most contributory substring
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
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
Compressed text indexes with fast locate
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
Approximate period detection and correction
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
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
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
Two scalable algorithms for associative text classification
Information Processing and Management: an International Journal
Prioritized grammar enumeration: symbolic regression by dynamic programming
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Compressed indexes for text with wildcards
Theoretical Computer Science
Colored range queries and document retrieval
Theoretical Computer Science
Attributing authorship of revisioned content
Proceedings of the 22nd international conference on World Wide Web
On-line construction of position heaps
Journal of Discrete Algorithms
Viewing functions as token sequences to highlight similarities in source code
Science of Computer Programming
Searching similar segments over textual event sequences
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Finding frequent sub-trajectories with time constraints
Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing
Masher: Mapping Long(er) Reads with Hash-based Genome Indexing on GPUs
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
Compressed automata for dictionary matching
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
The gapped spectrum kernel for support vector machines
MLDM'13 Proceedings of the 9th international conference on Machine Learning and Data Mining in Pattern Recognition
String analysis by sliding positioning strategy
Journal of Computer and System Sciences
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences
ACM Computing Surveys (CSUR)
Compressed property suffix trees
Information and Computation
Inferring strings from suffix trees and links on a binary alphabet
Discrete Applied Mathematics
Multi-pattern matching with bidirectional indexes
Journal of Discrete Algorithms
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.01 |
In 1970, Knuth, Pratt, and Morris [1] showed how to do basic pattern matching in linear time. Related problems, such as those discussed in [4], have previously been solved by efficient but sub-optimal algorithms. In this paper, we introduce an interesting data structure called a bi-tree. A linear time algorithm for obtaining a compacted version of a bi-tree associated with a given string is presented. With this construction as the basic tool, we indicate how to solve several pattern matching problems, including some from [4] in linear time.