## 抄録

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(^{n1.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<i≤n+1, the proposed algorithm outputs the values R(h) for all indices h with g≤h<i in O(n+(i-g)log(i-g)) time, where R is the solution of the problem.

本文言語 | English |
---|---|

ページ（範囲） | 2175-2183 |

ページ数 | 9 |

ジャーナル | Discrete Applied Mathematics |

巻 | 159 |

号 | 17 |

DOI | |

出版ステータス | Published - 2011 10 28 |

## ASJC Scopus subject areas

- 離散数学と組合せ数学
- 応用数学