The following pages link to Best match graphs (Q2420450):
Displaying 14 items.
- Corrigendum to: ``Best match graphs'' (Q2022091) (← links)
- Indirect identification of horizontal gene transfer (Q2040274) (← links)
- Best match graphs with binary trees (Q2062000) (← links)
- Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees (Q2192103) (← links)
- The structure of 2-colored best match graphs (Q2231786) (← 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)
- Complete characterization of incorrect orthology assignments in best match graphs (Q2659043) (← links)
- Complexity of modification problems for best match graphs (Q2661779) (← links)
- Quasi-best match graphs (Q2691571) (← links)
- Least resolved trees for two-colored best match graphs (Q5084685) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
- Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees (Q6072286) (← links)
