Indirect identification of horizontal gene transfer

DOI10.1007/s00285-021-01631-0zbMath1467.92134arXiv2012.08897OpenAlexW3180775633WikidataQ113905498 ScholiaQ113905498MaRDI QIDQ2040274

Marc Hellmuth, Nicolas Wieseke, David Schaller, Manuel Lafond, Peter F. Stadler

Publication date: 13 July 2021

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

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

zbMATH Keywords

binary relationhorizontal gene transferpolynomial-time recognition algorithmxenologyFitch graphgene familiesindirect phylogenetic methodslater-divergence-time

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Genetics and epigenetics (92D10)

Related Items (2)

From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats ⋮ Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees

Cites Work

• Unnamed Item
• The cluster deletion problem for cographs
• Rooted maximum agreement supertrees
• Complement reducible graphs
• Jungles: A new solution to the host/parasite phylogeny reconciliation problem
• Correction of weighted orthology and paralogy relations -- complexity and algorithmic results
• Reconstructing gene trees from Fitch's xenology relation
• Near-complete multipartite graphs and forbidden induced subgraphs
• Cluster graph modification problems
• Extension operations on sets of leaf-labelled trees
• Orthology relations, symbolic ultrametrics, and cographs
• The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
• Corrigendum to: ``Best match graphs
• Complexity of modification problems for reciprocal best match graphs
• Reciprocal best match graphs
• Best match graphs and reconciliation of gene trees with species trees
• Alternative characterizations of Fitch's xenology relation
• Best match graphs
• Gene tree reconciliation including transfers with replacement is NP-hard and FPT
• NP-completeness results for edge modification problems
• DLS-trees: a model of evolutionary scenarios
• Complete characterization of incorrect orthology assignments in best match graphs
• Complexity of modification problems for best match graphs
• The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
• Inferring Evolutionary Scenarios in the Duplication, Loss and Horizontal Gene Transfer Model
• H-trees: a Model of Evolutionary Scenarios with Horizontal Gene Transfer
• ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
• A Linear Recognition Algorithm for Cographs
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• Forbidden time travel: Characterization of time-consistent tree reconciliation maps
• Cograph editing: Merging modules is equivalent to editing P_4s
• A short note on undirected Fitch graphs

This page was built for publication: Indirect identification of horizontal gene transfer