Approximation algorithms for tree alignment with a given phylogeny
- 1 September 1996
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 16 (3) , 302-315
- https://doi.org/10.1007/bf01955679
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- On better heuristic for Euclidean Steiner minimum treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient methods for multiple sequence alignment with guaranteed error boundsBulletin of Mathematical Biology, 1993
- The shortest network under a given topologyJournal of Algorithms, 1992
- A survey of multiple sequence comparison methodsBulletin of Mathematical Biology, 1992
- Steiner tree problemsNetworks, 1992
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- The Steiner problem with edge lengths 1 and 2Information Processing Letters, 1989
- Trees, Stars, and Multiple Biological Sequence AlignmentSIAM Journal on Applied Mathematics, 1989
- The Multiple Sequence Alignment Problem in BiologySIAM Journal on Applied Mathematics, 1988
- Methods for Computing Wagner TreesSystematic Zoology, 1970