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

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

Benno Schwikowski, Martin Vingron

Publication date: 28 April 2003

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

zbMATH Keywords

algorithms; dynamic programming; evolutionary trees; multiple alignments; phylogenetic trees; computational molecular biology; tree alignment program

Mathematics Subject Classification ID

05C90: Applications of graph theory

90C39: Dynamic programming

92C40: Biochemistry, molecular biology

05C20: Directed graphs (digraphs), tournaments

92-08: Computational methods for problems pertaining to biology

Related Items

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