On the common substring alignment problem
Journal of Algorithms
Semi-local longest common subsequences in subquadratic time
Journal of Discrete Algorithms
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
Fast distance multiplication of unit-Monge matrices
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A new algorithm for the characteristic string problem under loose similarity criteria
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.04 |
The present article considers the problem for determining, for given two permutations over indices from 1 to n, the permutation whose distribution matrix is identical to the min-sum product of the distribution matrices of the given permutations. This problem has several applications in computing the similarity between strings. The fastest known algorithm to date for solving this problem executes in O(n^1^.^5) time, or very recently, in O(nlogn) time. The present article independently proposes another O(nlogn)-time algorithm for the same problem, which can also be used to partially solve the problem efficiently with respect to time in the sense that, for given indices g and i with 1@?g