On a cyclic string-to-string correction problem
Information Processing Letters
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
A fast algorithm for computing longest common subsequences
Communications of the ACM
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
On the common substring alignment problem
Journal of Algorithms
Parallel dynamic programming for solving the string editing problem on a CGM/BSP
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Parallel Algorithms for the Longest Common Subsequence Problem
IEEE Transactions on Parallel and Distributed Systems
A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
New Algorithms for the Longest Common Subsequence Problem
New Algorithms for the Longest Common Subsequence Problem
Semi-local longest common subsequences in subquadratic time
Journal of Discrete Algorithms
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Efficient representations of row-sorted 1-variant matrices for parallel string applications
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
New algorithms for efficient parallel string comparison
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Multiplication algorithms for Monge matrices
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Monge properties of sequence alignment
Theoretical Computer Science
Efficient high-similarity string comparison: the waterfall algorithm
Proceedings of the Joint EDBT/ICDT 2013 Workshops
| Hi-index | 0.05 |
Given two strings A and B of lengths n"a and n"b, n"a=