A fast algorithm for multiplying min-sum permutations

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)2175-2183
Number of pages9
JournalDiscrete Applied Mathematics
Volume159
Issue number17
DOIs
Publication statusPublished - 2011 Oct 28

Keywords

  • Algorithms
  • Matrix multiplication
  • Semi-local string comparison

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A fast algorithm for multiplying min-sum permutations'. Together they form a unique fingerprint.

Cite this