The structure of 2-colored best match graphs

DOI10.1016/j.dam.2021.08.007zbMath1473.05111arXiv2009.00447OpenAlexW3197986383MaRDI QIDQ2231786

Annachiara Korchmaros

Publication date: 30 September 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

acyclic orientationphylogenetic combinatoricsbest match digraphs

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Genetics and epigenetics (92D10) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Least resolved trees for two-colored best match graphs ⋮ Quasi-best match graphs

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles and paths of many lengths in bipartite digraphs
• Partition of a directed bipartite graph into two directed cycles
• The Magma algebra system. I: The user language
• Sufficient conditions for Hamiltonian cycles in bipartite digraphs
• Corrigendum to: ``Best match graphs
• Oriented bipartite graphs and the Goldbach graph
• Reciprocal best match graphs
• Best match graphs and reconciliation of gene trees with species trees
• Best match graphs
• A formal model of concurrent systems based on bipartite directed acyclic graph
• Complete characterization of incorrect orthology assignments in best match graphs
• Complexity of modification problems for best match graphs
• Factoring directed graphs with respect to the cardinal product in polynomial time II
• Topological sorting of large networks
• Factoring directed graphs with respect to the cardinal product in polynomial time
• Longest paths and cycles in bipartite oriented graphs
• Long paths and cycles in oriented graphs
• A Note on Bipartite Graphs Without 2 k -Cycles

This page was built for publication: The structure of 2-colored best match graphs