z-logo
open-access-imgOpen Access
Choosing a Method for Phylogenetic Prediction
Author(s) -
David W. Mount
Publication year - 2008
Publication title -
cold spring harbor protocols
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.674
H-Index - 51
eISSN - 1940-3402
pISSN - 1559-6095
DOI - 10.1101/pdb.ip49
Subject(s) - phylogenetic tree , maximum parsimony , set (abstract data type) , maximum likelihood , tree (set theory) , tree rearrangement , computer science , variation (astronomy) , phylogenetic network , statistics , biology , mathematics , combinatorics , genetics , clade , physics , gene , astrophysics , programming language
Three methods--maximum parsimony, distance, and maximum likelihood--are generally used to find the evolutionary tree or trees that best account for the observed variation in a group of sequences. Each of these methods uses a different type of analysis. Programs based on distance methods are commonly used in the molecular biology laboratory because they are straightforward and can be used with a large number of sequences. Maximum likelihood methods are more challenging and require a greater understanding of the evolutionary models on which they are based. Because they involve so many computational steps and because the number of steps increases dramatically with the number of sequences, maximum likelihood programs are limited to a smaller number of sequences. They can be implemented on a supercomputer in order to analyze a greater number of sequences. This article presents an overview for the researcher who has a set of related sequences and wants to analyze them to predict the best trees that depict the phylogenetic relationships among the sequences.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom