Combinatorial views on persistent characters in phylogenetics
The so-called binary perfect phylogeny with persistent characters has recently been thoroughly studied in computational biology as it is less restrictive than the well known binary perfect phylogeny. Here, we focus on the notion of (binary) persistent characters, i.e. characters that can be realized on a phylogenetic tree by at most one $0 \rightarrow 1$ transition followed by at most one $1 \rightarrow 0$ transition in the tree, and analyze these characters under different aspects. First, we illustrate the connection between persistent characters and Maximum Parsimony, where we characterize persistent characters in terms of the first phase of the famous Fitch algorithm. Afterwards we focus on the number of persistent characters for a given phylogenetic tree. We show that this number solely depends on the balance of the tree. To be precise, we develop a formula for counting the number of persistent characters for a given phylogenetic tree based on an index of tree balance, namely the Sackin index. Lastly, we consider the question of how many (carefully chosen) binary characters together with their persistence status are needed to uniquely determine a phylogenetic tree and provide an upper bound for the number of characters needed.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On the uniqueness of the maximum parsimony tree for data with up to two substitutions: an extension of the classic Buneman theorem in phylogenetics
One of the main aims of phylogenetics is the reconstruction of the correct evolutionary tree when data concerning the underlying species set are given. These data typically come in the form of DNA, RNA or protein alignme…
PhyloGFN: Phylogenetic inference with generative flow networks
Phylogenetics is a branch of computational biology that studies the evolutionary relationships among biological entities. Its long history and numerous applications notwithstanding, inference of phylogenetic trees from s…
Variational InferenceSystematics and symmetry in molecular phylogenetic modelling: perspectives from physics
The aim of this review is to present and analyze the probabilistic models of mathematical phylogenetics which have been intensively used in recent years in biology as the cornerstone of attempts to infer and reconstruct …
Variational Combinatorial Sequential Monte Carlo for Bayesian Phylogenetics in Hyperbolic Space
Hyperbolic space naturally encodes hierarchical structures such as phylogenies (binary trees), where inward-bending geodesics reflect paths through least common ancestors, and the exponential growth of neighborhoods mirr…
Variational InferenceTanglegrams: a reduction tool for mathematical phylogenetics
Many discrete mathematics problems in phylogenetics are defined in terms of the relative labeling of pairs of leaf-labeled trees. These relative labelings are naturally formalized as tanglegrams, which have previously be…