Skip to main content
Top

2015 | OriginalPaper | Chapter

14. Phylogenetics

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Phylogenetics is the study of evolutionary relationships among organisms. Sequence alignment is commonly performed as the first step of phylogenetics to determine the similarities of DNA and protein sequences. Searching these relationships is needed to analyze diseases, predict the genetic structures of pathogens, and also to classify the organisms. We pursue an evolutionary structure called the phylogenetic tree with leaves representing the living organisms called taxa and the intermediate nodes as the hypothetical ancestors. We start this chapter by stating the terms of phylogenetic terminology. We then describe various methods of constructing phylogenetic trees and propose a simple distributed algorithm to construct such trees. In the maximum parsimony problem, we are given the evolutionary tree and a number of taxa, and our aim is to label nodes of this tree that explains data with minimum number of mutations. We review a number of algorithms for this purpose and introduce a new algorithm for distributed parsimony implementation. After reviewing the probabilistic maximum likelihood method of constructing phylogenetic trees, we provide a brief review of distributed approaches that use maximum likelihood. Phylogenetic networks are more general as they exhibit events such as horizontal gene transfer and recombination which cannot be represented by the evolutionary trees. We discuss these networks briefly to conclude this chapter.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Addario-Berry L, Hallett MT, Lagergren J (2003) Towards identifying lateral gene transfer events. In: Proceedings of 8th pacific symposium on biocomputing (PSB03), pp 279–290 Addario-Berry L, Hallett MT, Lagergren J (2003) Towards identifying lateral gene transfer events. In: Proceedings of 8th pacific symposium on biocomputing (PSB03), pp 279–290
2.
go back to reference Bandelt HJ, Forster P, Sykes BC, Richards MB (1995) Mitochondrial portraits of human populations using median networks. Genetics 141:743–753 Bandelt HJ, Forster P, Sykes BC, Richards MB (1995) Mitochondrial portraits of human populations using median networks. Genetics 141:743–753
3.
go back to reference Bandelt HJ, Forster P, Rohl A (1999) Median-joining networks for inferring intraspecific phylogenies. Mol Biol Evol 16(1):37–48CrossRef Bandelt HJ, Forster P, Rohl A (1999) Median-joining networks for inferring intraspecific phylogenies. Mol Biol Evol 16(1):37–48CrossRef
4.
go back to reference Bandelt HJ, Macaulay V, Richards M (2000) Median networks: speedy construction and greedy reduction, one simulation, and two case studies from human mtDNA. Mol Phyl Evol 16:8–28CrossRef Bandelt HJ, Macaulay V, Richards M (2000) Median networks: speedy construction and greedy reduction, one simulation, and two case studies from human mtDNA. Mol Phyl Evol 16:8–28CrossRef
5.
go back to reference Blouin C, Butt D, Hickey G, Rau-Chaplin A (2005) Fast parallel maximum likelihood-based protein phylogeny. In: Proceedings of 18th international conference on parallel and distributed computing systems, ISCA, pp 281–287 Blouin C, Butt D, Hickey G, Rau-Chaplin A (2005) Fast parallel maximum likelihood-based protein phylogeny. In: Proceedings of 18th international conference on parallel and distributed computing systems, ISCA, pp 281–287
6.
go back to reference Colijn C, Gardy J (2014) Phylogenetic tree shapes resolve disease transmission patterns. Evol Med Public Health 2014:96–108CrossRef Colijn C, Gardy J (2014) Phylogenetic tree shapes resolve disease transmission patterns. Evol Med Public Health 2014:96–108CrossRef
7.
go back to reference DasGupta B, He X, Jiang T, Li M, Tromp J, Zhang L (2000) On computing the nearest neighbor interchange distance. Proceedings of DIMACS workshop on discrete problems with medical applications 55:125–143MathSciNetCrossRefMATH DasGupta B, He X, Jiang T, Li M, Tromp J, Zhang L (2000) On computing the nearest neighbor interchange distance. Proceedings of DIMACS workshop on discrete problems with medical applications 55:125–143MathSciNetCrossRefMATH
8.
go back to reference Doolittle WF (1999) Phylogenetic classification and the Universal Tree. Science 284:2124–2128CrossRef Doolittle WF (1999) Phylogenetic classification and the Universal Tree. Science 284:2124–2128CrossRef
10.
go back to reference Felsenstein J (1981) Evolutionary trees from DNA sequences: a maximum likelihood approach. J Mol Evol 17(6):368–376 Felsenstein J (1981) Evolutionary trees from DNA sequences: a maximum likelihood approach. J Mol Evol 17(6):368–376
11.
go back to reference Felsenstein J (1991) PHYLIP: phylogenetic inference package. University of Washington, Seattle Felsenstein J (1991) PHYLIP: phylogenetic inference package. University of Washington, Seattle
12.
go back to reference Felsenstein J (2004) Inferring Phylogenies. 2nd edn. Sinauer Associates Inc., Chapter 2 Felsenstein J (2004) Inferring Phylogenies. 2nd edn. Sinauer Associates Inc., Chapter 2
13.
go back to reference Fitch WM (1971) Toward defining course of evolution: minimum change for a specified tree topology. Syst Zool 20:406–416CrossRef Fitch WM (1971) Toward defining course of evolution: minimum change for a specified tree topology. Syst Zool 20:406–416CrossRef
14.
go back to reference Gast M, Hauptmann M (2012) Efficient parallel computation of nearest neighbor interchange distances. CoRR abs/1205.3402 Gast M, Hauptmann M (2012) Efficient parallel computation of nearest neighbor interchange distances. CoRR abs/1205.3402
15.
go back to reference Griffiths RC, Marjoram P (1997) An ancestral recombination graph. In: Donnelly P, Tavare S (eds) Progress in population genetics and human evolution, volume 87 of IMA volumes of mathematics and its applications. Springer, Berlin (Germany), pp 257–270CrossRef Griffiths RC, Marjoram P (1997) An ancestral recombination graph. In: Donnelly P, Tavare S (eds) Progress in population genetics and human evolution, volume 87 of IMA volumes of mathematics and its applications. Springer, Berlin (Germany), pp 257–270CrossRef
17.
go back to reference Hallett MT, Lagergren J (2001) Efficient algorithms for lateral gene transfer problems. Proceedings 5th annunal international conference on computational molecular biology (RECOMB01). ACM Press, New York, pp 149–156 Hallett MT, Lagergren J (2001) Efficient algorithms for lateral gene transfer problems. Proceedings 5th annunal international conference on computational molecular biology (RECOMB01). ACM Press, New York, pp 149–156
19.
go back to reference Huber KT, Watson EE, Hendy MD (2001) An algorithm for constructing local regions in a phylogenetic network. Mol Phyl Evol 19(1):1–8CrossRef Huber KT, Watson EE, Hendy MD (2001) An algorithm for constructing local regions in a phylogenetic network. Mol Phyl Evol 19(1):1–8CrossRef
20.
go back to reference Huson DH (1998) SplitsTree: a program for analyzing and visualizing evolutionary data. Bioinformatics 14(1):68–73CrossRef Huson DH (1998) SplitsTree: a program for analyzing and visualizing evolutionary data. Bioinformatics 14(1):68–73CrossRef
21.
go back to reference Huson DH, Scornavacca C (2011) A survey of combinatorial methods for phylogenetic networks. Genome Biol Evol 3:23–35CrossRef Huson DH, Scornavacca C (2011) A survey of combinatorial methods for phylogenetic networks. Genome Biol Evol 3:23–35CrossRef
22.
go back to reference Huson DH, Rupp R, Scornavacca C (2010) Phylogenetic networks. Cambridge University Press Huson DH, Rupp R, Scornavacca C (2010) Phylogenetic networks. Cambridge University Press
23.
go back to reference Jin G, Nakhleh L, Snir S, Tuller T (2007) Inferring phylogenetic networks by the maximum parsimony criterion: a case study. Mol Biol Evol 24(1):324–337CrossRef Jin G, Nakhleh L, Snir S, Tuller T (2007) Inferring phylogenetic networks by the maximum parsimony criterion: a case study. Mol Biol Evol 24(1):324–337CrossRef
24.
go back to reference Keane TM, Naughton TJ, Travers SA, McInerney JO, McCormack GP (2005) DPRml: distributed phylogeny reconstruction by maximum likelihood. Bioinformatics 21(7):969–974CrossRef Keane TM, Naughton TJ, Travers SA, McInerney JO, McCormack GP (2005) DPRml: distributed phylogeny reconstruction by maximum likelihood. Bioinformatics 21(7):969–974CrossRef
25.
go back to reference Keane TM, Naughton TJ, McInerney JO (2007) MultiPhyl: a high-throughput phylogenomics webserver using distributed computting. Nucleic Acids Res 35(2):3337 Keane TM, Naughton TJ, McInerney JO (2007) MultiPhyl: a high-throughput phylogenomics webserver using distributed computting. Nucleic Acids Res 35(2):3337
26.
go back to reference Kumar S, Tamura K, Nei M (1993) MEGA: molecular evolutionary genetics analysis, ver. 1.01. The Pennsylvania State University, University Park, PA Kumar S, Tamura K, Nei M (1993) MEGA: molecular evolutionary genetics analysis, ver. 1.01. The Pennsylvania State University, University Park, PA
27.
go back to reference Lemey P, Salemi M, Vandamme A-M (eds) (2009) The phylogenetic handbook: a practical approach to phylogenetic analysis and hypothesis testing, 2nd edn. Cambridge University Press. ISBN-10: 0521730716. ISBN-13: 978-0521730716 Lemey P, Salemi M, Vandamme A-M (eds) (2009) The phylogenetic handbook: a practical approach to phylogenetic analysis and hypothesis testing, 2nd edn. Cambridge University Press. ISBN-10: 0521730716. ISBN-13: 978-0521730716
28.
go back to reference Linder CR, Moret BME, Nakhleh L, Warnow T (2004) Network (Reticulate) Evolution: biology, models, and algorithms. School of Biological Sciences. In, The ninth pacific symposium on biocomputing Linder CR, Moret BME, Nakhleh L, Warnow T (2004) Network (Reticulate) Evolution: biology, models, and algorithms. School of Biological Sciences. In, The ninth pacific symposium on biocomputing
29.
go back to reference Nakhleh L (2010) Evolutionary phylogenetic networks: models and issues. In: Heath L, Ramakrishnan, N (eds) The problem solving handbook for computational biology and bioinformatics. Springer, pp 125–158 Nakhleh L (2010) Evolutionary phylogenetic networks: models and issues. In: Heath L, Ramakrishnan, N (eds) The problem solving handbook for computational biology and bioinformatics. Springer, pp 125–158
30.
go back to reference Nasibov EN, Ulutagay G (2008) FN-DBSCAN: a novel density-based clustering method with fuzzy neighborhood relations. In: Proceedings of 8th international conference application of fuzzy systems and soft computing (ICAFS-2008), pp 101–110 Nasibov EN, Ulutagay G (2008) FN-DBSCAN: a novel density-based clustering method with fuzzy neighborhood relations. In: Proceedings of 8th international conference application of fuzzy systems and soft computing (ICAFS-2008), pp 101–110
32.
33.
go back to reference Ruzgar R, Erciyes K (2012) Clustering based distributed phylogenetic tree construction. Expert Syst Appl 39(1):89–98CrossRef Ruzgar R, Erciyes K (2012) Clustering based distributed phylogenetic tree construction. Expert Syst Appl 39(1):89–98CrossRef
34.
go back to reference Saitou N, Nei M (1987) The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol BioI Evol 4(4):406–425 Saitou N, Nei M (1987) The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol BioI Evol 4(4):406–425
36.
go back to reference Stamatakis A (2004) Distributed and parallel algorithms and systems for inference of huge phylogenetic trees based on the maximum likelihood method. Ph.D. thesis, Technische Universitat, Munchen, Germany Stamatakis A (2004) Distributed and parallel algorithms and systems for inference of huge phylogenetic trees based on the maximum likelihood method. Ph.D. thesis, Technische Universitat, Munchen, Germany
37.
go back to reference Schmidt HA, Strimmer K, Vingron M, Haeseler A (2002) Tree-puzzle: maximum likelihood phylogenetic analysis using quartets and parallel computing. Bioinformatics 18(3):502–504CrossRef Schmidt HA, Strimmer K, Vingron M, Haeseler A (2002) Tree-puzzle: maximum likelihood phylogenetic analysis using quartets and parallel computing. Bioinformatics 18(3):502–504CrossRef
38.
go back to reference Studier J, Keppler K (1988) A note on the neighbor-joining algorithm of Saitou and Nei. Mol BioI Evol 5(6):729–731 Studier J, Keppler K (1988) A note on the neighbor-joining algorithm of Saitou and Nei. Mol BioI Evol 5(6):729–731
39.
go back to reference Sung W-K (2009) Algorithms in bioinformatics: a practical introduction. CRC Press (Taylor and Francis Group), Chap 8 Sung W-K (2009) Algorithms in bioinformatics: a practical introduction. CRC Press (Taylor and Francis Group), Chap 8
40.
go back to reference Yang Z (2007) PAML 4: phylogenetic analysis by maximum likelihood. Mol Biol Evol 24(8):1586–1591CrossRef Yang Z (2007) PAML 4: phylogenetic analysis by maximum likelihood. Mol Biol Evol 24(8):1586–1591CrossRef
41.
go back to reference Zhou BB, Till M, Zomaya A (2004) Parallel implementation of maximum likelihood methods for phylogenetic analysis. In: Proceedings of 18th international symposium parallel and distributed processing (IPDPS 2004) Zhou BB, Till M, Zomaya A (2004) Parallel implementation of maximum likelihood methods for phylogenetic analysis. In: Proceedings of 18th international symposium parallel and distributed processing (IPDPS 2004)
Metadata
Title
Phylogenetics
Author
K. Erciyes
Copyright Year
2015
DOI
https://doi.org/10.1007/978-3-319-24966-7_14

Premium Partner