Best match graphs and reconciliation of gene trees with species trees
DOI10.1007/s00285-020-01469-yzbMath1434.05035arXiv1904.12021OpenAlexW3004232123WikidataQ89459439 ScholiaQ89459439MaRDI QIDQ2303745
Peter F. Stadler, Marc Hellmuth, Marcos E. González Laffitte, Maribel Hernandez-Rosales, Alitzel López Sánchez, Dulce I. Valdivia, Manuela Geiß
Publication date: 5 March 2020
Published in: Journal of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.12021
Trees (05C05) Applications of graph theory (05C90) Taxonomy, cladistics, statistics in mathematical biology (92B10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (8)
Uses Software
Cites Work
- Unnamed Item
- Exact algorithms for cluster editing: Evaluation and experiments
- Complexity and parameterized algorithms for cograph editing
- Theory of 2-structures. I: Clans, basic subclasses, and morphisms
- Theory of 2-structures. II: Representation through labeled tree families
- Complement reducible graphs
- Recovering symbolically dated, rooted trees from symbolic ultrametrics
- Reconstructing gene trees from Fitch's xenology relation
- Orthology relations, symbolic ultrametrics, and cographs
- Finding and listing induced paths and cycles
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
- Corrigendum to: ``Best match graphs
- Reciprocal best match graphs
- Alternative characterizations of Fitch's xenology relation
- Reconciling event-labeled gene trees with MUL-trees and species networks
- Best match graphs
- DLS-trees: a model of evolutionary scenarios
- Recognizing $P_4 $-Sparse Graphs in Linear Time
This page was built for publication: Best match graphs and reconciliation of gene trees with species trees