Efficient all path score computations on grid graphs

DOI10.1016/j.tcs.2013.07.018zbMath1282.68204MaRDI QIDQ2437757

Dekel Tsur, Michal Ziv-Ukelson, Ury Matarazzo

Publication date: 13 March 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.018

zbMATH Keywords

sequence alignment; all path score computations

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

05C85: Graph algorithms (graph-theoretic aspects)

68W32: Algorithms on strings