# Combinatorial views on persistent characters in phylogenetics

27 Mar 2020 Wicke Kristina Fischer Mareike

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... (read more)

PDF Abstract

# Code Add Remove Mark official

No code implementations yet. Submit your code now