Efficient all path score computations on grid graphs

DOI10.1007/978-3-642-38905-4_21MaRDI QIDQ4928574zbMATH OpenOpenAlexFDO

Authors Ury Matarazzo, Dekel Tsur, Michal Ziv-Ukelson

Publication date 14 June 2013

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38905-4_21

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Efficient all path score computations on grid graphs
• On almost Monge all scores matrices
• scientific article; zbMATH DE number 6792426
• All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
• All-pairs bottleneck paths in vertex weighted graphs

Cited in

(3)

• On almost Monge all scores matrices
• Efficient all path score computations on grid graphs
• All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings

This page was built for publication: Efficient all path score computations on grid graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928574)