Non-hereditary maximum parsimony trees

Biology – Quantitative Biology – Populations and Evolution

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

22 pages, 10 figures

Scientific paper

In this paper, we investigate a conjecture by von Haeseler concerning the Maximum Parsimony method for phylogenetic estimation, which was published by the Newton Institute in Cambridge on a list of open phylogenetic problems in 2007. This conjecture deals with the question whether Maximum Parsimony trees are hereditary. The conjecture suggests that a Maximum Parsimony tree for a particular (DNA) alignment necessarily has subtrees of all possible sizes which are most parsimonious for the corresponding subalignments. We answer the conjecture affirmatively for binary alignments on five taxa but also show how to construct examples for which Maximum Parsimony trees are not hereditary. Apart from showing that a most parsimonious tree cannot generally be reduced to a most parsimonious tree on fewer taxa, we also show that compatible most parsimonious quartets do not have to provide a most parsimonious supertree. Last, we show that our results can be generalized to Maximum Likelihood for certain nucleotide substitution models.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Non-hereditary maximum parsimony 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 Non-hereditary maximum parsimony trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-hereditary maximum parsimony trees will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-613002

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.