Partial Homology Relations - Satisfiability in Terms of Di-Cographs
Directed cographs (di-cographs) play a crucial role in the reconstruction of evolutionary histories of genes based on homology relations which are binary relations between genes. A variety of methods based on pairwise sequence comparisons can be used to infer such homology relations (e.g. orthology, paralogy, xenology). They are satisfiable if the relations can be explained by an event-labeled gene tree, i.e., they can simultaneously co-exist in an evolutionary history of the underlying genes. Every gene tree is equivalently interpreted as a so-called cotree that entirely encodes the structure of a di-cograph. Thus, satisfiable homology relations must necessarily form a di-cograph. The inferred homology relations might not cover each pair of genes and thus, provide only partial knowledge on the full set of homology relations. Moreover, for particular pairs of genes, it might be known with a high degree of certainty that they are not orthologs (resp. paralogs, xenologs) which yields forbidden pairs of genes. Motivated by this observation, we characterize (partial) satisfiable homology relations with or without forbidden gene pairs, provide a quadratic-time algorithm for their recognition and for the computation of a cotree that explains the given relations.
KeywordsDirected cographs Partial relations Forbidden relations Recognition algorithm Homology Orthology Paralogy Xenology
This contribution is supported in part by the Independent Research Fund Denmark, Natural Sciences, grant DFF-7014-00041.
- 4.Altenhoff, A.M., Škunca, N., Glover, N., Train, C.M., Sueki, A., Piližota, I., Gori, K., Tomiczek, B., Müller, S., Redestig, H., Gonnet, G.H., Dessimoz, C.: The OMA orthology database in 2015: function predictions, better plant support, synteny view and other improvements. Nucleic Acids Res. 43(D1), D240–D249 (2015)CrossRefGoogle Scholar
- 11.Dessimoz, C., Margadant, D., Gonnet, G.H.: DLIGHT – lateral gene transfer detection using pairwise evolutionary distances in a statistical framework. In: Vingron, M., Wong, L. (eds.) RECOMB 2008. LNCS, vol. 4955, pp. 315–330. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78839-3_27CrossRefGoogle Scholar
- 12.Dondi, R., El-Mabrouk, N., Lafond, M.: Correction of weighted orthology and paralogy relations - complexity and algorithmic results. In: Frith, M., Storm Pedersen, C.N. (eds.) WABI 2016. LNCS, vol. 9838, pp. 121–136. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-43681-4_10CrossRefGoogle Scholar
- 21.Hellmuth, M., Wieseke, N.: On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions. J. Comb. Optim. 1–26 (2017)Google Scholar
- 26.Lawrence, J.G., Hartl, D.L.: Inference of horizontal genetic transfer from molecular data: an approach using the bootstrap. Genetics 131(3), 753–760 (1992)Google Scholar