Beyond representing orthology relations by trees
From MaRDI portal
Publication:1702121
DOI10.1007/s00453-016-0241-9zbMath1392.92055arXiv1603.04632OpenAlexW2301157271MaRDI QIDQ1702121
G. E. Scholz, Katharina T. Huber
Publication date: 28 February 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.04632
Related Items (5)
From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats ⋮ Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees ⋮ Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs ⋮ Recovering normal networks from shortest inter-taxa distance information ⋮ Three-way symbolic tree-maps and ultrametrics
Uses Software
Cites Work
- Unnamed Item
- On encodings of phylogenetic networks of bounded level
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
- Recovering symbolically dated, rooted trees from symbolic ultrametrics
- Orthology relations, symbolic ultrametrics, and cographs
- Trinets encode tree-child and level-2 phylogenetic networks
- Encoding and constructing 1-nested phylogenetic networks with trinets
- On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions
- Orthology Relation and Gene Tree Correction: Complexity Results
This page was built for publication: Beyond representing orthology relations by trees