A first step towards computing all hybridization networks for two rooted binary phylogenetic trees

Details A first step towards computing all hybridization networks for two rooted binary phylogenetic trees A first step towards computing all hybridization networks for two rooted binary phylogenetic trees

2011-09-15

arxiv.org/abs/1109.3268v1

Biology

Quantitative Biology

Populations and Evolution

21 pages, 5 figures

Scientific paper

Recently, considerable effort has been put into developing fast algorithms to reconstruct a rooted phylogenetic network that explains two rooted phylogenetic trees and has a minimum number of hybridization vertices. With the standard approach to tackle this problem being combinatorial, the reconstructed network is rarely unique. From a biological point of view, it is therefore of importance to not only compute one network, but all possible networks. In this paper, we make a first step towards approaching this goal by presenting the first algorithm---called allMAAFs---that calculates all maximum-acyclic-agreement forests for two rooted binary phylogenetic trees on the same set of taxa.

Affiliated with

Also associated with

No associations

Rating

A first step towards computing all hybridization networks for two rooted binary phylogenetic trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A first step towards computing all hybridization networks for two rooted binary phylogenetic trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A first step towards computing all hybridization networks for two rooted binary phylogenetic trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-672539