文章基本信息

标题：On Almost Monge All Scores Matrices
本地全文：下载
作者：Amir Carmel ; Dekel Tsur ; Michal Ziv-Ukelson 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2016
卷号：54
页码：17:1-17:12
DOI：10.4230/LIPIcs.CPM.2016.17
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：The all scores matrix of a grid graph is a matrix containing the optimal scores of paths from every vertex on the first row of the graph to every vertex on the last row. This matrix is commonly used to solve diverse string comparison problems. All scores matrices have the Monge property, and this was exploited by previous works that used all scores matrices for solving various problems. In this paper, we study an extension of grid graphs that contain an additional set of edges, called bridges. Our main result is to show several properties of the all scores matrices of such graphs. We also give an O(r(nm + n2)) time algorithm for constructing the all scores matrix of an m × n grid graph with r bridges.
关键词：Sequence alignment; longest common subsequences; DIST matrices; Monge matrices; all path score computations.