1 Search Results for "Tsur, Dekel"

Document
DOI: 10.4230/LIPIcs.CPM.2016.17
On Almost Monge All Scores Matrices

Authors: Amir Carmel, Dekel Tsur, and Michal Ziv-Ukelson

Published in: LIPIcs, Volume 54, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)

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 × n grid graph with r bridges.
Cite as

Amir Carmel, Dekel Tsur, and Michal Ziv-Ukelson. On Almost Monge All Scores Matrices. In 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 54, pp. 17:1-17:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{carmel_et_al:LIPIcs.CPM.2016.17,
  author =	{Carmel, Amir and Tsur, Dekel and Ziv-Ukelson, Michal},
  title =	{{On Almost Monge All Scores Matrices}},
  booktitle =	{27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)},
  pages =	{17:1--17:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-012-5},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{54},
  editor =	{Grossi, Roberto and Lewenstein, Moshe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.17},
  URN =		{urn:nbn:de:0030-drops-60770},
  doi =		{10.4230/LIPIcs.CPM.2016.17},
  annote =	{Keywords: Sequence alignment, longest common subsequences, DIST matrices, Monge matrices, all path score computations.}
}
  • Refine by Author
  • 1 Carmel, Amir
  • 1 Tsur, Dekel
  • 1 Ziv-Ukelson, Michal

  • Refine by Classification

  • Refine by Keyword
  • 1 DIST matrices
  • 1 Monge matrices
  • 1 Sequence alignment
  • 1 all path score computations.
  • 1 longest common subsequences

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2016

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact