Approximation algorithms for constrained generalized tree alignment problem

DOI10.1016/j.dam.2008.10.009zbMath1186.68593OpenAlexW2075314926MaRDI QIDQ1028112

Srikrishnan Divakaran

Publication date: 30 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2008.10.009

zbMATH Keywords

analysis of algorithmsbioinformaticscomputational biologyapproximation algorithmsgeneralized tree alignment

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cites Work

• Efficient methods for multiple sequence alignment with guaranteed error bounds
• Approximation algorithms for tree alignment with a given phylogeny
• Aligning sequences via an evolutionary tree
• Trees, Stars, and Multiple Biological Sequence Alignment
• Minimal Mutation Trees of Sequences
• Algorithms on Strings, Trees and Sequences
• Improved Approximations for the Steiner Tree Problem
• Improved Approximation Algorithms for Tree Alignment
• A More Efficient Approximation Scheme for Tree Alignment
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs

This page was built for publication: Approximation algorithms for constrained generalized tree alignment problem