Combinatorial views on persistent characters in phylogenetics

DOI10.1016/j.aam.2020.102046zbMath1440.05122arXiv1802.02520OpenAlexW3023714558MaRDI QIDQ2182613

Mareike Fischer, Kristina Wicke

Publication date: 26 May 2020

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.02520

zbMATH Keywords

maximum parsimonyFitch algorithmpersistent characterstree balance\(X\)-splitssackin index

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Enumeration in graph theory (05C30) Genetics and epigenetics (92D10) General biology and biomathematics (92B05)

Related Items (1)

Combinatorial perspectives on Dollo-\(k\) characters in phylogenetics

Uses Software

• Mathematica
• SPhyR
• SackinMinimizer

Cites Work

• Unnamed Item
• The binary perfect phylogeny with persistent characters
• A colored graph approach to perfect phylogeny with persistent characters
• The Steiner problem in phylogeny is NP-complete
• Phylogeny

This page was built for publication: Combinatorial views on persistent characters in phylogenetics