A fast algorithm for multiplying min-sum permutations
From MaRDI portal
Publication:411869
DOI10.1016/j.dam.2011.06.022zbMath1236.05007MaRDI QIDQ411869
Publication date: 30 April 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.06.022
05A05: Permutations, words, matrices
Related Items
Unnamed Item, A substring-substring LCS data structure, A data structure for substring-substring LCS length queries, A faster reduction of the dynamic time warping distance to the longest increasing subsequence length, An almost quadratic time algorithm for sparse spliced alignment
Cites Work