A sub-quadratic sequence alignment algorithm for unrestricted cost matrices
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete 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
Sparse LCS common substring alignment
Information Processing Letters
Dynamic programming algorithms for the mosaic longest common subsequence problem
Information Processing Letters
Two algorithms for LCS Consecutive Suffix Alignment
Journal of Computer and System Sciences
Efficient algorithms for finding interleaving relationship between sequences
Information Processing Letters
An all-substrings common subsequence algorithm
Discrete Applied Mathematics
Sequence Alignment Algorithms for Run-Length-Encoded Strings
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Semi-local longest common subsequences in subquadratic time
Journal of Discrete Algorithms
LCS Approximation via Embedding into Local Non-repetitive Strings
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Sparse LCS common substring alignment
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
LCS approximation via embedding into locally non-repetitive strings
Information and Computation
Note: A fast algorithm for multiplying min-sum permutations
Discrete Applied Mathematics
Alignment with non-overlapping inversions in O(n3)-time
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
All semi-local longest common subsequences in subquadratic time
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
On the complexity of sparse exon assembly
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Alignments with non-overlapping moves, inversions and tandem duplications in O(n4) time
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Multi-pattern matching with bidirectional indexes
Journal of Discrete Algorithms
Hi-index | 0.00 |