Approximation algorithms for constrained generalized tree alignment problem Original Research Article

In generalized tree alignment problem, we are given a set image of image biologically related sequences and we are interested in a minimum cost evolutionary tree for image. In many instances of this problem partial phylogenetic tree for image is known. In such instances, we would like to make use of this knowledge to restrict the tree topologies that we consider and construct a biologically relevant minimum cost evolutionary tree. So, we propose the following natural generalization of the generalized tree alignment problem, a problem known to be MAX-SNP Hard, stated as follows: