Pages that link to "Item:Q1937881"
From MaRDI portal
The following pages link to Orthology relations, symbolic ultrametrics, and cographs (Q1937881):
Displaying 36 items.
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions (Q721942) (← links)
- Spiders can be recognized by counting their legs (Q904532) (← links)
- Reconstructing unrooted phylogenetic trees from symbolic ternary metrics (Q1670475) (← links)
- Beyond representing orthology relations by trees (Q1702121) (← links)
- Correction of weighted orthology and paralogy relations -- complexity and algorithmic results (Q1708421) (← links)
- The matroid structure of representative triple sets and triple-closure computation (Q1746594) (← links)
- Inferring phylogenetic trees from the knowledge of rare evolutionary events (Q1750644) (← links)
- Reconstructing gene trees from Fitch's xenology relation (Q1789081) (← links)
- Partial homology relations -- satisfiability in terms of di-cographs (Q1790998) (← links)
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations (Q2014353) (← links)
- Indirect identification of horizontal gene transfer (Q2040274) (← links)
- From modular decomposition trees to rooted median graphs (Q2074346) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees (Q2192103) (← links)
- Exact-2-relation graphs (Q2197422) (← links)
- Complexity of modification problems for reciprocal best match graphs (Q2290642) (← links)
- Reciprocal best match graphs (Q2299268) (← links)
- Best match graphs and reconciliation of gene trees with species trees (Q2303745) (← links)
- Three-way symbolic tree-maps and ultrametrics (Q2304088) (← links)
- Alternative characterizations of Fitch's xenology relation (Q2315209) (← links)
- Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees (Q2322864) (← links)
- Reconciling event-labeled gene trees with MUL-trees and species networks (Q2330637) (← links)
- Best match graphs (Q2420450) (← links)
- Complete characterization of incorrect orthology assignments in best match graphs (Q2659043) (← links)
- Complexity of modification problems for best match graphs (Q2661779) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions (Q3196420) (← links)
- Defining and identifying cograph communities in complex networks (Q3387608) (← links)
- Hierarchical and modularly-minimal vertex colorings (Q5058209) (← links)
- Forbidden time travel: Characterization of time-consistent tree reconciliation maps (Q5111818) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
- Orthology Relation and Gene Tree Correction: Complexity Results (Q5283821) (← links)
- Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees (Q6072286) (← links)
- Injective split systems (Q6115433) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
- Shared ancestry graphs and symbolic arboreal maps (Q6622737) (← links)
