Complete characterization of incorrect orthology assignments in best match graphs (Q2659043)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7327685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complete characterization of incorrect orthology assignments in best match graphs |
scientific article; zbMATH DE number 7327685 |
Statements
Complete characterization of incorrect orthology assignments in best match graphs (English)
0 references
25 March 2021
0 references
orthology detection
0 references
best matches
0 references
unambiguous orthologs
0 references
colored graphs
0 references
cograph
0 references
tree reconciliation
0 references
polynomial-time algorithm
0 references
0 references
0.8795377612113953
0 references
0.7965182662010193
0 references
0.7623053193092346
0 references
0.7524189949035645
0 references
0.7512016296386719
0 references
