Skip to main content
SpringerLink
Log in

Orthology Relation and Gene Tree Correction: Complexity Results

  • Conference paper
  • First Online:
Algorithms in Bioinformatics (WABI 2015)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 9289))

Included in the following conference series:

Abstract

Tree-oriented methods for inferring orthology and paralogy relations between genes are based on reconciling a gene tree with a species tree. On the other hand, many tree-free methods, mainly based on sequence similarity, are also available. The link between orthology relations and gene trees has been formally considered recently from the angle of reconstructing phylogenies from orthology relations. Here, we rather consider this link from a correction point of view. While a gene tree induces a set of relations, the converse is not always true, as a set of relations is not necessarily in agreement with any gene tree. How can we minimally correct an infeasible set of relations? On the other hand, given a gene tree and a set of relations, how to minimally correct a gene tree in order to fit the set of relations? In this paper, various objective functions are considered for the minimality criterion, among them the Robinson-Foulds distance between the initial and corrected gene tree. All considered problem variants are shown to be NP-complete.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    It has been pointed out to us that the term ‘relation graph’ is also used in phylogenetics in the form of a generalization of a median network to a set of partitions. To make it clear, relation graphs in this paper have nothing to do with this notion.

References

  1. Aho, A.V., Sagiv, Y., Szymanski, T.G., Ullman, J.D.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM J. Comp. 10, 405–421 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  2. Altenhoff, A.M., Gil, M., Gonnet, G.H., Dessimoz, C.: Inferring hierarchical orthologous groups from orthologous gene pairs. PLoS One 8(1), e53786 (2013)

    Article  Google Scholar 

  3. Berglund, A.C., Sjolund, E., Ostlund, G., Sonnhammer, E.L.: InParanoid 6: eukaryotic ortholog clusters with inparalogs. Nucl. Acids Res. 36, 263–266 (2008)

    Article  Google Scholar 

  4. Bretscher, A., Corneil, D.G., Habib, M., Paul, C.: A simple linear time LexBFS cograph recognition algorithm. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 119–130. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  5. Chaudhary, R., Burleigh, J.G., Eulenstein, O.: Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence. BMC Bioinf. 13(Supp. 10), S11 (2011)

    Google Scholar 

  6. Chen, K., Durand, D., Farach-Colton, M.: Notung: dating gene duplications using gene family trees. J. Comp. Biol. 7, 429–447 (2000)

    Article  Google Scholar 

  7. The Gene Ontology Consortium: Gene ontology: tool for the unification of biology. Nat. Genet. 25(1), 25–29 (2000)

    Article  Google Scholar 

  8. Datta, R.S., Meacham, C., Samad, B., Neyer, C., Sjölander, K.: Berkeley PHOG: PhyloFacts orthology group prediction web server. Nucl. Acids Res. 37, W84–W89 (2009)

    Article  Google Scholar 

  9. Doroftei, A., El-Mabrouk, N.: Removing noise from gene trees. In: Przytycka, T.M., Sagot, M.-F. (eds.) WABI 2011. LNCS, vol. 6833, pp. 76–91. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. El-Mallah, E.S., Colbourn, C.J.: The complexity of some edge deletion problems. IEEE Trans. Circ. Syst. 35(3), 354–362 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fitch, W.M.: Homology a personal view on some of the problems. TIG 16(5), 227–231 (2000)

    Article  Google Scholar 

  12. Goodman, M., Czelusniak, J., Moore, G.W., Romero-Herrera, A.E., Matsuda, G.: Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst. Zool. 28, 132–163 (1979)

    Article  Google Scholar 

  13. Gorecki, P., Eulenstein, O.: Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem. BMC Bioinf. 13(Supp 10), S14 (2011)

    Google Scholar 

  14. Górecki, P., Eulenstein, O.: A linear time algorithm for error-corrected reconciliation of unrooted gene trees. In: Chen, J., Wang, J., Zelikovsky, A. (eds.) ISBRA 2011. LNCS, vol. 6674, pp. 148–159. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Hellmuth, M., Hernandez-Rosales, M., Huber, K., Moulton, V., Stadler, P., Wieseke, N.: Orthology relations, symbolic ultrametrics, and cographs. J. Math. Biol. 66(1–2), 399–420 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  16. Hellmuth, M., Wieseke, N., Lechner, M., Middendorf, M., Stadler, P.F., Lenhof, H-P.: Phylogenomics with paralogs. In: PNAS (2014)

    Google Scholar 

  17. Hernandez-Rosales, M., Hellmuth, M., Wieseke, N., Huber, K.T., Moulton, V., Stadler, P.: From event-labeled gene trees to species trees. BMC Bioinf. 13(Suppl. 19), 56 (2012)

    Google Scholar 

  18. Huerta-Cepas, J., Capella-Gutierrez, S., Pryszcz, L.P., Denisov, I., Kormes, D., Marcet-Houben, M., Gabaldón, T.: Phylomedb v3.0: an expanding repository of genome-wide collections of trees, alignments and phylogeny-based orthology and paralogy predictions. Nucl. Acids Res. 39, D556–D560 (2011)

    Article  Google Scholar 

  19. Lafond, M., El-Mabrouk, N.: Orthology and paralogy constraints: satisfiability and consistency. BMC Genom. 15(Suppl. 6), S12 (2014)

    Article  Google Scholar 

  20. Lafond, M., Semeria, M., Swenson, K.M., Tannier, E., El-Mabrouk, N.: Gene tree correction guided by orthology. BMC Bioinf. 14(Suppl. 15), S5 (2013)

    Article  Google Scholar 

  21. Lafond, M., Swenson, K.M., El-Mabrouk, N.: Models and algorithms for genome evolution. In: Chauve, C., El-Mabrouk, N., Tannier, E. (eds.) Error detection and correction of gene trees, pp. 261–285. Springer, Heidelberg (2013)

    Google Scholar 

  22. Lechner, M., Findeib, S.S., Steiner, L., Marz, M., Stadler, P.F., Prohaska, S.J.: Proteinortho: detection of (co-)orthologs in large-scale analysis. BMC Bioinf. 12, 124 (2011)

    Article  Google Scholar 

  23. Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is np-complete. J. Comput. Syst. Sci. 20(2), 219–230 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  24. Li Jr, L., Stoeckert, C.J., Roos, D.S.: OrthoMCL: identification of ortholog groups for eukaryotic genomes. Genome Res. 13, 2178–2189 (2003)

    Article  Google Scholar 

  25. Liu, Y., Wang, J., Guo, J., Chen, J.: Cograph editing: complexity and parameterized algorithms. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol. 6842, pp. 110–121. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  26. Mi, H., Muruganujan, A., Thomas, P.D.: Panther in 2013: modeling the evolution of gene function, and other gene attributes, in the context of phylogenetic trees. Nucl. Acids Res. 41, D377–D386 (2012)

    Article  Google Scholar 

  27. Michael, R.G., David, S.J.: Computers and intractability: a guide to the theory of np-completeness. WH Freeman & Co., San Francisco (1979)

    MATH  Google Scholar 

  28. Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Appl. Math. 113(1), 109–128 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  29. Ohno, S.: Evolution by Gene Duplication. Springer, Berlin (1970)

    Book  Google Scholar 

  30. Penel, S., Arigon, A.M., Dufayard, J.F., Sertier, A.S., Daubin, V., Duret, L., Gouy, M., Perrière, G.: Databases of homologous gene families for comparative genomics. BMC Bioinf. 10, S3–S6 (2009)

    Article  Google Scholar 

  31. Pryszcz, L.P., Huerta-Cepas, J., Gabaldón, T.: MetaPhOrs: orthology and paralogy predictions from multiple phylogenetic evidence using a consistency-based confidence score. Nucl. Acids Res. 39, e32 (2011)

    Article  Google Scholar 

  32. Robinson, D., Foulds, L.: Comparison of phylogenetic trees. Math. Biosc. 53, 131–147 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  33. Swenson, K.M., Doroftei, A., El-Mabrouk, N.: Gene tree correction for reconciliation and species tree inference. Alg. Mol. Biol. 7(1), 31 (2012)

    Article  Google Scholar 

  34. Tatusov, R.L., Galperin, M.Y., Natale, D.A., Koonin, E.V.: The COG database: a tool for genome-scale analysis of protein functions and evolution. Nucl. Acids Res. 28, 33–36 (2000)

    Article  Google Scholar 

  35. Nguyen, T.H., Ranwez, V., Pointet, S., Chifolleau, A.M., Doyon, J.P., Berry, V.: Reconciliation and local gene tree rearrangement can be of mutual profit. Alg. Mol. Biol. 8(8), 12 (2013)

    Article  Google Scholar 

  36. Vilella, A.J., Severin, J., Ureta-Vidal, A., Heng, L., Durbin, R., Birney, E.: EnsemblCompara gene trees: complete, duplication-aware phylogenetic trees in vertebrates. Gen. Res. 19, 327–335 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Université de Montréal, Montréal, QC, Canada

    Manuel Lafond & Nadia El-Mabrouk

Authors
  1. Manuel Lafond
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nadia El-Mabrouk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Manuel Lafond .

Editor information

Editors and Affiliations

  1. University of Maryland, College Park, Maryland, USA

    Mihai Pop

  2. University of Lille, Lille, France

    Hélène Touzet

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lafond, M., El-Mabrouk, N. (2015). Orthology Relation and Gene Tree Correction: Complexity Results. In: Pop, M., Touzet, H. (eds) Algorithms in Bioinformatics. WABI 2015. Lecture Notes in Computer Science(), vol 9289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48221-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-48221-6_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-48220-9

  • Online ISBN: 978-3-662-48221-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation