Can I read On the correctness of Maximum Parsimony for data with few substitutions in the NNI neighborhood of phylogenetic trees on EtoBox?

On the correctness of Maximum Parsimony for data with few substitutions in the NNI neighborhood of phylogenetic trees by Fischer, Mareike is a scholarly article available to read on EtoBox.

What is On the correctness of Maximum Parsimony for data with few substitutions in the NNI neighborhood of phylogenetic trees about?

Estimating phylogenetic trees, which depict the relationships between different species, from aligned sequence data (such as DNA, RNA, or proteins) is one of the main aims of evolutionary biology. However, tree reconstruction criteria like maximum parsimony do not necessarily lead to unique trees and in some cases even fail to recognize the \enquote{correct} tree (i.e., the tree on which the data was generated). On the other hand, a recent study has shown that for an alignment containing precisely those binary characters (sites) which require up to two substitutions on a given tree, this tree will be the unique maximum parsimony tree. It is the aim of the present paper to generalize this recent result in the following sense: We show that for a tree $T$ with $n$ leaves, as long as $k<\frac{n}{8}+\frac{11}{9}-\frac{1}{18}\sqrt{9\cdot \left(\frac{n}{4}\right)^2+16}$ (or, equivalently, $n>9 k-11+\sqrt{9k^2-22 k+17} $, which in particular holds for all $n\geq 12k$), the maximum parsimony tree for the alignment containing all binary characters which require (up to or precisely) $k$ substitutions on $T$ will be unique in the NNI neighborhood of $T$ and it will coincide with $T$, too. In o

Author

Fischer, Mareike

Published

2024

Language

EN