@inproceedings{85ab12bdc6c343a696f216244e2a609d,
title = "On almost Monge all scores matrices",
abstract = "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 x n grid graph with r bridges.",
keywords = "All path score computations, DIST matrices, Longest common subsequences, Monge matrices, Sequence alignment",
author = "Amir Carmel and Dekel Tsur and Michal Ziv-Ukelson",
note = "Publisher Copyright: {\textcopyright} Amir Carmel, Dekel Tsur, and Michal Ziv-Ukelson.; 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016 ; Conference date: 27-06-2016 Through 29-06-2016",
year = "2016",
month = jun,
day = "1",
doi = "10.4230/LIPIcs.CPM.2016.17",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "17.1--17.12",
editor = "Roberto Grossi and Moshe Lewenstein",
booktitle = "27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016",
address = "Germany",
}