Inferring phylogenetic trees from the knowledge of rare evolutionary events

DOI10.1007/s00285-017-1194-6zbMath1386.05186arXiv1612.09093OpenAlexW2565775743WikidataQ46245569 ScholiaQ46245569MaRDI QIDQ1750644

Marc Hellmuth, Peter F. Stadler, Yangjing Long, Maribel Hernandez-Rosales

Publication date: 22 May 2018

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

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

zbMATH Keywords

rare eventsbinary relationsphylogenetic combinatorics

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90)

Related Items (6)

Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees ⋮ Exact-2-relation graphs ⋮ A short note on undirected Fitch graphs ⋮ Alternative characterizations of Fitch's xenology relation ⋮ From modular decomposition trees to rooted median graphs ⋮ Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees

Uses Software

• CREx

Cites Work

• Unnamed Item
• Exact leaf powers
• Extension operations on sets of leaf-labelled trees
• Exploring pairwise compatibility graphs
• Orthology relations, symbolic ultrametrics, and cographs
• The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
• Quasi-independence, homology and the unity of type: a topological theory of characters
• Alignments of mitochondrial genome arrangements: applications to metazoan phylogeny
• Pairwise Compatibility Graphs: A Survey
• On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions
• Discovering Pairwise Compatibility Graphs
• On the tandem duplication-random loss model of genome rearrangement
• On Graphs That Are Not PCGs
• Pairwise Compatibility Graphs

This page was built for publication: Inferring phylogenetic trees from the knowledge of rare evolutionary events