Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests

Details Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests

2011-08-12

arxiv.org/abs/1108.2664v1

Biology

Quantitative Biology

Populations and Evolution

45 pages, 12 figures

Scientific paper

We present new and improved approximation and FPT algorithms for computing rooted and unrooted maximum agreement forests (MAFs) of pairs of phylogenetic trees. Their sizes correspond to the subtree-prune-and-regraft distances and the tree-bisection-and-reconnection distances of the trees, respectively. We also provide the first bounded search tree FPT algorithm for computing rooted maximum acyclic agreement forests (MAAFs) of pairs of phylogenetic trees, whose sizes are the hybridization numbers of these pairs of trees. These distance metrics are essential tools for understanding reticulate evolution.

Affiliated with

Also associated with

No associations

Rating

Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests 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 Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-16733