Information Processing Letters
Information and Computation
Faster algorithms for string matching with k mismatches
Journal of Algorithms - Special issue: SODA 2000
The submatrices character count problem: an efficient solution using separable values
Information and Computation
Efficient algorithms for the scaled indexing problem
Journal of Algorithms
Property matching and weighted matching
Theoretical Computer Science
Pattern Matching with Swaps for Short Patterns in Linear Time
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A new model to solve the swap matching problem and efficient algorithms for short patterns
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Cycle detection and correction
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On shortest common superstring and swap permutations
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Space lower bounds for online pattern matching
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
String matching with swaps in a weighted sequence
CIS'04 Proceedings of the First international conference on Computational and Information Science
Parallel pattern matching with swaps on a linear array
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Multi-label text categorization using k-nearest neighbor approach with m-similarity
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Cycle detection and correction
ACM Transactions on Algorithms (TALG)
Approximate period detection and correction
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Space lower bounds for online pattern matching
Theoretical Computer Science
On a compact encoding of the swap automaton
Information Processing Letters
| Hi-index | 0.00 |