Skip to main content

Gene Trees and Species Trees: The Gene-Duplication Problem is Fixed-Parameter Tractable

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1663))

Included in the following conference series:

Abstract

Gene Duplication is the problem of computing an optimal species tree for a given set of gene trees under the Gene-Duplication Model (first introduced by Goodman et al.). The problem is known to be NP-complete. We give a fixed-parameter-tractable algorithm solving the problem parameterized by the number of gene duplications necessary to rectify the gene trees with respect to the species tree.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. S. Benner and A. Ellington. Evolution and Structural Theory. The frontier between chemistry and biochemistry. Bioorg. Chem. Frontiers 1 (1990), 1–70.

    Article  Google Scholar 

  2. R. G. Downey and M. R. Fellows. Parameterized Complexity, Springer, 1998.

    Google Scholar 

  3. R. Downey, M. Fellows, and U. Stege. “Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability,” in The Future of Discr. Mathem.: Proc. of the 1st DIMATIA Symp., AMS-DIMACS, to appear.

    Google Scholar 

  4. R. G. Downey, M. R. Fellows, and U. Stege. Computational Tractability: The View From Mars, to appear in the Bulletin of the EATCS.

    Google Scholar 

  5. J. Felsenstein. Phylogenies from Molecular Sequences: Inference and Reliability. Annu. Rev. Genet. (1988), 22, 521–65.

    Article  Google Scholar 

  6. M. Fellows, M. Hallett, and U. Stege. “On the Multiple Gene Duplication Problem”, Algorithms and Computation, 9th International Symposium, ISAAC’98, LNCS 1533 (December 1998).

    Google Scholar 

  7. W. Fitch, E. Margoliash. “Construction of Phylogenetic Tree,” Sci. 155 (1967).

    Google Scholar 

  8. M. Goodman, J. Czelusniak, G. Moore, A. Romero-Herrera, G. Matsuda. “Fitting the Gene Lineage into its Species Lineage: A parsimony strategy illustrated by cladograms constructed from globin sequences,” Syst. Zool. (1979), 28.

    Google Scholar 

  9. R. Guigó, I. Muchnik, and T. F. Smith. “Reconstruction of Ancient Molecular Phylogeny,” Molec. Phylogenet. and Evol. (1996),6:2, 189–213.

    Article  Google Scholar 

  10. J. Hein, T. Jiang, L. Wang, and K. Zhang. “On the Complexity of Comparing Evolutionary Trees”, DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 71 (1996).

    Google Scholar 

  11. B. Ma, M. Li, and L. Zhang. “On Reconstructing Species Trees from Gene Trees in Term of Duplications and Losses,” Recomb 98.

    Google Scholar 

  12. R. D. M. Page. “Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas,” Syst. Biol. 43 (1994), 58–77.

    Google Scholar 

  13. D. L. Swofford. “When are phylogeny estimates from molecular and morphological data incongruent?” in Phylogenetic analysis of DNA sequences, Oxford Univ. Press (1991), pp. 295–333

    Google Scholar 

  14. L. Zhang. “On a Mirkin-Muchnik-Smith Conjecture for Comparing Molecular Phylogenies,” Journal of Comp. Biol. (1997) 4:2, 177–187.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stege, U. (1999). Gene Trees and Species Trees: The Gene-Duplication Problem is Fixed-Parameter Tractable. In: Dehne, F., Sack, JR., Gupta, A., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1999. Lecture Notes in Computer Science, vol 1663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48447-7_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-48447-7_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66279-2

  • Online ISBN: 978-3-540-48447-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics