An Algorithm for Finding a Common Structure Shared by a Family of Strings
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal parallel suffix-prefix matching algorithm and applications
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Parallel tree pattern matching
Journal of Symbolic Computation
Journal of the ACM (JACM)
Computer analysis of user interfaces based on repetition in transcripts of user sessions
ACM Transactions on Information Systems (TOIS)
Alphabet independent two dimensional matching
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A constant-time optimal parallel string-matching algorithm
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Pattern matching in a digitized image
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Highly efficient dictionary matching in parallel
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
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
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
Non-standard stringology: algorithms and complexity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A constant-time optimal parallel string-matching algorithm
Journal of the ACM (JACM)
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Identifying satellites in nucleic acid sequences
RECOMB '98 Proceedings of the second 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
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
APE: learning user's habits to automate repetitive tasks
Proceedings of the 5th international conference on Intelligent user interfaces
Approximate nearest neighbors and sequence comparison with block operations
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Optimal conversion of extended-entry decision tables with general cost criteria
Communications of the ACM
The string edit distance matching problem with moves
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Extraction of Recurrent Patterns from Stratified Ordered Trees
EMCL '01 Proceedings of the 12th European Conference on Machine Learning
Indexing and Dictionary Matching with One Error
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
An Improved Algorithm for Sequence Comparison with Block Reversals
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
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
Engineering a Lightweight Suffix Array Construction Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Optimal parallel algorithms for string matching
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Prototyping of Efficient Hardware Algorithms for Data Compression in Future Communication Systems
RSP '01 Proceedings of the 12th International Workshop on Rapid System Prototyping
Efficient text fingerprinting via Parikh mapping
Journal of Discrete Algorithms
Encoding of primary structures of biological macromolecules within a data mining perspective
Journal of Computer Science and Technology - Special issue on bioinformatics
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
An efficient algorithm for sequence comparison with block reversals
Theoretical Computer Science - Latin American theorotical informatics
Antisequential Suffix Sorting for BWT-Based Data Compression
IEEE Transactions on Computers
New voting strategies designed for the classification of nucleic sequences
Knowledge and Information Systems
Substring compression problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A short survey on the state of the art in matching and unification problems
ACM SIGSAM Bulletin
Detecção de padrões repetitivos em seqüências de ações sobre ruído em aplicações por demonstração
CLIHC '05 Proceedings of the 2005 Latin American conference on Human-computer interaction
The string edit distance matching problem with moves
ACM Transactions on Algorithms (TALG)
Analyzing the input stream for character- level errors in unconstrained text entry evaluations
ACM Transactions on Computer-Human Interaction (TOCHI)
Efficient one-dimensional real scaled matching
Journal of Discrete Algorithms
Linear time algorithm for the longest common repeat problem
Journal of Discrete Algorithms
A taxonomy of suffix array construction algorithms
ACM Computing Surveys (CSUR)
Efficient Algorithms for the Inverse Sort Transform
IEEE Transactions on Computers
Theoretical Computer Science
KMRCRelat Algorithm for finding repeated words in sequences: Application on biological sequences
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science,Software Engineering, Information Technology, e-Business, and Applications, 2003
Extension and use of KMRCRelat algorithm for biological problems
Journal of Computational Methods in Sciences and Engineering - Selected papers from the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, 2004
Faster Algorithm for the Set Variant of the String Barcoding Problem
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Approximate String Matching with Address Bit Errors
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
LCS Approximation via Embedding into Local Non-repetitive Strings
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Clone detection via structural abstraction
Software Quality Control
Masking patterns in sequences: A new class of motif discovery with don't cares
Theoretical Computer Science
Compressing and indexing labeled trees, with applications
Journal of the ACM (JACM)
Approximate string matching with address bit errors
Theoretical Computer Science
FastWrap: an efficient wrapper for tabular data extraction from the web
IRI'09 Proceedings of the 10th IEEE international conference on Information Reuse & Integration
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Fast lightweight suffix array construction and checking
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Biological sequences encoding for supervised classification
BIRD'07 Proceedings of the 1st international conference on Bioinformatics research and development
Indexing a dictionary for subset matching queries
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
LCS approximation via embedding into locally non-repetitive strings
Information and Computation
Characterization of contour regularities based on the Levenshtein edit distance
Pattern Recognition Letters
XPath evaluation in linear time
Journal of the ACM (JACM)
Scalable detection of frequent substrings by grammar-based compression
DS'11 Proceedings of the 14th international conference on Discovery science
Computing all subtree repeats in ordered ranked trees
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
External string sorting: faster and cache-oblivious
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Detection of repetitive patterns in action sequences with noise in programming by demonstration
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
Incremental inference of relational motifs with a degenerate alphabet
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
An offline approach for whole-program paths analysis using suffix arrays
LCPC'04 Proceedings of the 17th international conference on Languages and Compilers for High Performance Computing
Validating the knuth-morris-pratt failure function, fast and online
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
String rearrangement metrics: a survey
Algorithms and Applications
Longest common extensions via fingerprinting
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Recent developments in the theory of data structures
Computer Languages
Feature extraction in protein sequences classification: a new stability measure
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Parikh matching in the streaming model
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Various improvements to text fingerprinting
Journal of Discrete Algorithms
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
Theory of Computing Systems
| Hi-index | 0.02 |
In this paper we look at a number of matching problems and devise general techniques for attacking such problems. In particular, we describe a strategy for constructing efficient algorithms for solving two types of matching problems. We use this strategy to develop explicit algorithms for these two problems applied to strings (where the patterns are substrings) and arrays (where the patterns are subarrays or blocks). We also develop algorithms for these and related problems for trees, where the patterns are subtrees. Certain special cases of these algorithms are also discussed. Although we do not claim that these algorithms are optimal, we analyze each algorithm to estimate its computational cost. This provides some basis for choosing which algorithm is most desirable in any given situation.