Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions

DOI10.1016/S0166-218X(02)00288-3zbMath1020.92011OpenAlexW2093057423WikidataQ56881278 ScholiaQ56881278MaRDI QIDQ1868715

Benno Schwikowski, Martin Vingron

Publication date: 28 April 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00288-3

zbMATH Keywords

algorithmsdynamic programmingevolutionary treesmultiple alignmentsphylogenetic treescomputational molecular biologytree alignment program

Mathematics Subject Classification ID

Applications of graph theory (05C90) Dynamic programming (90C39) Biochemistry, molecular biology (92C40) Directed graphs (digraphs), tournaments (05C20) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees

Uses Software

• Balibase

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• RNA secondary structures and their prediction
• Sequence comparison with concave weighting functions
• The Steiner tree problem
• Efficient methods for multiple sequence alignment with guaranteed error bounds
• Improving the divide-and-conquer approach to sum-of-pairs multiple sequence alignment
• Aligning sequences via an evolutionary tree
• Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming
• Minimal Mutation Trees of Sequences
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Algorithms on Strings, Trees and Sequences

This page was built for publication: Weighted sequence graphs: Boosting iterated dynamic programming using locally suboptimal solutions