Skip to main content

Molecular Phylogeny

  • Chapter
Applied Probability

Part of the book series: Springer Texts in Statistics ((STS))

  • 1018 Accesses

Abstract

Inferring the evolutionary relationships among related taxa (species, genera, families, or higher groupings) is one of the most fascinating problems of molecular genetics [17, 22, 23]. It is now relatively simple to sequence genes and to compare the results from several contemporary taxa. In the current chapter we will assume that the chore of aligning the DNA sequences from these taxa has been successfully accomplished. The taxa are then arranged in an evolutionary tree (or phylogeny) depicting how taxa diverge from common ancestors. A single ancestral taxon roots the binary tree describing the evolution of the contemporary taxa. The reconstruction problem can be briefly stated as finding the rooted evolutionary tree best fitting the current DNA data. Once the best tree is identified, it is also of interest to estimate the branch lengths of the tree. These tell us something about the pace of evolution. For the sake of brevity, we will focus on the problem of finding the best tree.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

10.12 References

  1. Cavender JA (1989) Mechanized derivation of linear invariants. Mol Biol Evol 6:301–316

    Google Scholar 

  2. Cressie NAC (1993) Statistics for Spatial Data. Wiley, New York

    Google Scholar 

  3. Derin H, Elliott H (1987) Modeling and segmentation of noisy and textured images using Gibbs Random Fields. IEEE Trans Pattern Anal Mach Intelligence 9:39–55

    Google Scholar 

  4. Eck RV, Dayhoff MO (1966) Atlas of Protein Sequence and Structure. National Biomedical Research Foundation, Silver Spring, MD

    Google Scholar 

  5. Felsenstein J (1978) Cases in which parsimony or compatibility methods will be positively misleading. Syst Zool 27:401–410

    Article  Google Scholar 

  6. Felsenstein J (1981) Evolutionary trees from DNA sequences: A maximum likelihood approach. J Mol Evol 17:368–376

    Article  Google Scholar 

  7. Felsenstein J, Churchill GA (1996) A hidden Markov model approach to variation among sites in rate of evolution. Mol Biol Evol 13:93–104

    Google Scholar 

  8. Fitch WM (1971) Toward defining the course of evolution: Minimum change for a specific tree topology. Syst Zool 20:406–416

    Article  Google Scholar 

  9. Goldman N, Yang Z (1994) A codon-based model of nucleotide substitution for protein-coding DNA sequences. Mol Biol Evol 11:725–736

    Google Scholar 

  10. Hartigan JA (1973) Minimum mutation fits to a given tree. Biometrics 29:53–65

    Article  Google Scholar 

  11. Hirsch MW, Smale S (1974) Differential Equations, Dynamical Systems, and Linear Algebra. Academic Press, New York

    MATH  Google Scholar 

  12. Kelly FP (1979) Reversibility and Stochastic Networks. Wiley, New York

    MATH  Google Scholar 

  13. Kimura M (1980) A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences. J Mol Evol 16:111–120

    Article  Google Scholar 

  14. Lake JA (1987) A rate-independent technique for analysis of nucleic acid sequences: evolutionary parsimony. Mol Biol Evol 4:167–191

    Google Scholar 

  15. Lake JA (1988) Origin of the eukaryotic nucleus determined by rate-invariant analysis of rRNA sequences. Nature 331:184–186

    Article  Google Scholar 

  16. Lamperti J (1977) Stochastic Processes. A Survey of the Mathematical Theory. Springer-Verlag, New York

    MATH  Google Scholar 

  17. Li W-H, Graur D (1991) Fundamentals of Molecular Evolution. Sinauer, Sunderland, MA

    Google Scholar 

  18. Rosen KH (1995) Discrete Mathematics and its Applications, 3rd ed. McGraw-Hill, New York

    Google Scholar 

  19. Schadt E, Lange K (2001) Codon and rate variation models in molecular phylogeny.

    Google Scholar 

  20. Solberg JJ (1975) A graph theoretic formula for the steady state distribution of a finite Markov process. Management Sci 21:1040–1048

    Article  MathSciNet  MATH  Google Scholar 

  21. Thompson CJ (1972) Mathematical Statistical Mechanics. Princeton University Press, Princeton, NJ

    MATH  Google Scholar 

  22. Waterman MS (1995) Introduction to Computational Biology: Maps, Sequences, and Genomes. Chapman and Hall, London

    MATH  Google Scholar 

  23. Weir BS (1996) Genetic Data Analysis II. Sinauer, Sunderland, MA

    Google Scholar 

  24. Winkler G (1995) Image Analysis, Random Fields, and Dynamic Monte Carlo. Springer-Verlag, New York

    MATH  Google Scholar 

  25. Yang Z (1994) Estimating the pattern of nucleotide substitution. J Mol Evol 39:105–111

    Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

(2003). Molecular Phylogeny. In: Applied Probability. Springer Texts in Statistics. Springer, New York, NY. https://doi.org/10.1007/978-0-387-22711-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-22711-5_10

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-00425-9

  • Online ISBN: 978-0-387-22711-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics