Tight bounds on the complexity of the Boyer-Moore string matching algorithm
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Fast text searching: allowing errors
Communications of the ACM
(Un)expected behavior of typical suffix trees
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Hybrid pattern recognition system capable of self-modification
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Combinatorial pattern discovery for scientific data: some preliminary results
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
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
Discovering Patterns from Large and Dynamic Sequential Data
Journal of Intelligent Information Systems
Approximate string matching: a simpler faster algorithm
Proceedings of the ninth 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
Efficient pattern matching with scaling
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Approximate nearest neighbors and sequence comparison with block operations
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Faster algorithms for string matching with k mismatches
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
Information Processing Letters
New and faster filters for multiple approximate string matching
Random Structures & Algorithms
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Faster Bit-Parallel Approximate String Matching
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
A New Indexing Method for Approximate String Matching
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Information and Computation
String regularities with don't cares
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Generalizations of suffix arrays to multi-dimensional matrices
Theoretical Computer Science
Frequent-subsequence-based prediction of outer membrane proteins
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
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
A survey on tree edit distance and related problems
Theoretical Computer Science
Approximate string matching using compressed suffix arrays
Theoretical Computer Science
An approximate multi-word matching algorithm for robust document retrieval
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
The string edit distance matching problem with moves
ACM Transactions on Algorithms (TALG)
Duplicate Record Detection: A Survey
IEEE Transactions on Knowledge and Data Engineering
A programmable array processor architecture for flexible approximate string matching algorithms
Journal of Parallel and Distributed Computing
Optimal spaced seeds for faster approximate string matching
Journal of Computer and System Sciences
Text document clustering based on frequent word meaning sequences
Data & Knowledge Engineering
Processor array architectures for flexible approximate string matching
Journal of Systems Architecture: the EUROMICRO Journal
The design of a similarity based deduplication system
SYSTOR '09 Proceedings of SYSTOR 2009: The Israeli Experimental Systems Conference
Binding Structural Properties to Node and Path Constraints in XML Path Retrieval
Advanced Internet Based Systems and Applications
Some theoretical challenges in digital geometry: A perspective
Discrete Applied Mathematics
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
ACM Transactions on Algorithms (TALG)
Human activity encoding and recognition using low-level visual features
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Text clustering approach based on maximal frequent term sets
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Efficient algorithms for the block edit problems
Information and Computation
String distance metrics for reference matching and search query correction
BIS'07 Proceedings of the 10th international conference on Business information systems
Approximate swap and mismatch edit distance
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Structural similarity evaluation between XML documents and DTDs
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
Parallelisation of sequence comparison algorithms using hybridised parallel techniques
HONET'09 Proceedings of the 6th international conference on High capacity optical networks and enabling technologies
The approximate swap and mismatch edit distance
Theoretical Computer Science
The longest common extension problem revisited and applications to approximate string searching
Journal of Discrete Algorithms
Exact and efficient proximity graph computation
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Towards flexible code clone detection, management, and refactoring in IDE
Proceedings of the 5th International Workshop on Software Clones
Extracting statistics indicators from tables of basic structure
Pattern Recognition and Image Analysis
Optimal spaced seeds for faster approximate string matching
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Finding patterns with variable length gaps or don’t cares
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Random access to grammar-compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fast algorithms for comparison of similar unordered trees
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A parallel algorithm for fixed-length approximate string-matching with k-mismatches
Algorithms and Applications
An algorithmic framework for motif discovery problems in weighted sequences
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Restricted transposition invariant approximate string matching under edit distance
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Faster approximate pattern matching in compressed repetitive texts
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
IDE-based real-time focused search for near-miss clones
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Fast and cache-oblivious dynamic programming with local dependencies
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
Time-Space trade-offs for longest common extensions
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Local exact pattern matching for non-fixed RNA structures
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
Cycle detection and correction
ACM Transactions on Algorithms (TALG)
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Faster algorithm for computing the edit distance between SLP-Compressed strings
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Clustering with Proximity Graphs: Exact and Efficient Algorithms
International Journal of Knowledge-Based Organizations
Time-space trade-offs for longest common extensions
Journal of Discrete Algorithms
| Hi-index | 0.04 |