We thank members of the O&#8217;Halloran lab for comments on the manuscript. We thank The George Washington University Department of Biological Sciences and Columbian College of Arts and Sciences for Funding to D. O&#8217;Halloran.

1. Basic Local Alignment Search Tool (BLAST): Online Interface
<ol>
	<li>Click on this link to visit the BLAST1 web server at the National Center for Biotechnology Information (NCBI). - <a href="http://blast.ncbi.nlm.nih.gov/Blast.cgi">http://blast.ncbi.nlm.nih.gov/Blast.cgi</a>&#160; (Figure 1).</li>
	<li>Input a FASTA formatted text sequence (see Figure 2 for example) into the query box.</li>
	<li>Click the appropriate BLAST program and relevant database or individual spec...

<ol>
	<li>Altschul, S. F., Carroll, R. J., Lipman, D. J. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=Weights+for+data+related+by+a+tree.">Weights for data related by a tree.</a> J. Mol. Biol. 207 (4), 647-653 (1989).</li><li>Akaike, H. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=A+new+look+at+the+statistical+model+identification.">A new look at the statistical model identification.</a> IEEE Trans. Automat. Contr. 19 (6), 706-723 (1974).</li><li>Schwarz, G. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=Estimating+the+dimension+of+a+model.">Estimating the dimension of a model.</a> Ann. Stat. 6 (2), 461-464 (1978).</li><li>Guindon, S., Gascuel, O. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=A+simple,+fast,+and+accurate+algorithm+to+estimate+large+phylogenies+by+maximum+likelihood.">A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood.</a> Syst. Biol. 52 (5), 696-704 (2003).</li><li>Huelsenbeck, J. P., Ronquist, F. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=MRBAYES:+Bayesian+inference+of+phylogenetic+trees.">MRBAYES: Bayesian inference of phylogenetic trees.</a> Bioinformatics. 17 (8), 754-755 (2001).</li><li>Thompson, J. D., Higgins, D. G., Gibson, T. J. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=CLUSTAL+W:+Improving+the+sensitivity+of+progressive+multiple+sequence+alignment+through+sequence+weighting,+position-specific+gap+penalties+and+weight+matrix+choice.">CLUSTAL W: Improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice.</a> Nucleic Acids Res. 22 (22), 4673-4680 (1994).</li><li>Lassmann, T., Sonnhammer, E. L. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=Kalign--an+accurate+and+fast+multiple+sequence+alignment+algorithm.">Kalign--an accurate and fast multiple sequence alignment algorithm.</a> BMC Bioinformatics. 6, 298 (2005).</li><li>Katoh, K., Kuma, K., Toh, H., Miyata, T. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=MAFFT+version+5:+Improvement+in+accuracy+of+multiple+sequence+alignment.">MAFFT version 5: Improvement in accuracy of multiple sequence alignment.</a> Nucleic Acids Res. 33 (2), 511-518 (2005).</li><li>Katoh, K., Misawa, K., Kuma, K., Miyata, T. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=MAFFT:+A+novel+method+for+rapid+multiple+sequence+alignment+based+on+fast+fourier+transform.">MAFFT: A novel method for rapid multiple sequence alignment based on fast fourier transform.</a> Nucleic Acids Res. 30 (14), 3059-3066 (2002).</li><li>Edgar, R. C. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=MUSCLE:+Multiple+sequence+alignment+with+high+accuracy+and+high+throughput.">MUSCLE: Multiple sequence alignment with high accuracy and high throughput.</a> Nucleic Acids Res. 32 (5), 1792-1797 (2004).</li><li>Notredame, C., Higgins, D. G., Heringa, J. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=T-coffee:+A+novel+method+for+fast+and+accurate+multiple+sequence+alignment.">T-coffee: A novel method for fast and accurate multiple sequence alignment.</a> J. Mol. Biol. 302 (1), 205-217 (2000).</li><li>Do, C. B., Mahabhashyam, M. S., Brudno, M., Batzoglou, S. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=ProbCons:+Probabilistic+consistency-based+multiple+sequence+alignment.">ProbCons: Probabilistic consistency-based multiple sequence alignment.</a> Genome Res. 15 (2), 330-340 (2005).</li><li>Darriba, D., Taboada, G. L., Doallo, R., Posada, D. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=ProtTest+3:+Fast+selection+of+best-fit+models+of+protein+evolution.">ProtTest 3: Fast selection of best-fit models of protein evolution.</a> Bioinformatics. 27 (8), 1164-1165 (2011).</li><li>Page, R. D. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=TreeView:+An+application+to+display+phylogenetic+trees+on+personal+computers.">TreeView: An application to display phylogenetic trees on personal computers.</a> Comput. Appl. Biosci. 12 (4), 357-358 (1996).</li><li>Darriba, D., Taboada, G. L., Doallo, R., Posada, D. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=jModelTest+2:+More+models,+new+heuristics+and+parallel+computing.">jModelTest 2: More models, new heuristics and parallel computing.</a> Nat. Methods. 9 (8), 772 (2012).</li><li>Chevenet, F., Brun, C., Banuls, A. L., Jacq, B., Christen, R. <a target="_blank" href="http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed&cmd=Search&doptcmdl=Citation&defaultField=Title+Word&term=TreeDyn:+Towards+dynamic+graphics+and+annotations+for+analyses+of+trees.">TreeDyn: Towards dynamic graphics and annotations for analyses of trees.</a> BMC Bioinformatics. 7, 439 (2006).</li></ol>

We have nothing to disclose.&#160;

Our hope for this article is that it will serve as a starting point to guide researchers or students that are new to phylogenetics. Genome sequencing projects have become less expensive over the last few years and as a consequence the user demand for this technology is increasing, and now the production of large sequence datasets is commonplace in small labs. These datasets often provide researchers with sets of genes that require a phylogenetic framework to begin to understand their function. Furthermore, because phylog...

In order to understand how two (or more) species evolved, it is first necessary to obtain sequence or morphological data from each sample; these data represent quantities that we can use to measure their relationship through evolutionary space. Just like when measuring linear distance, having more data available (e.g. miles, inches, microns) will equate to a more accurate measurement. Ergo, the accuracy with which a researcher can deduce evolutionary distance is heavily influenced by the volume of informative data available to measure relationships. Furthermore, because different samples evolve at different rates and by different mechanisms, the method that we use to measure the relationship between two taxa also directly influences the accuracy of evolutionary measurements.&#160;Therefore, because evolutionary relationships are not directly observed but instead are extrapolated from sequence or morphological data, the problem of inferring evolutionary relationships becomes one of statistics. Phylogenetics is the branch of biology concerned with applying statistical models to patterns of evolution in order to optimally reconstruct the evolutionary history between taxa. This reconstruction between taxa is referred to as the taxa&#8217;s phylogeny.
To help bridge the gap in expertise between molecular biologists and evolutionary biologists we describe here a step by step pipeline for inferring phylogenies from a set of sequences. Firstly, we detail the steps involved in database interrogation using the Basic Local Alignment Search Tool (BLAST1) algorithm through the web based interface and also by using local executables; this is often the first step in obtaining a list of similar sequences to an unidentified query, although some researchers may also be interested in gathering data for a single group via web interfaces such as Phylota (http://www.phylota.net/). BLAST is an algorithm for comparing primary amino acid or nucleotide sequence data against a database of sequences to search for &#8220;hits&#8221; that resemble the query sequence. The BLAST program was designed by Stephen Altschul et al. at the National Institutes of Health (NIH)1. The BLAST server consists of a number of different programs, and here is a list of some of the most common BLAST programs:
i) Nucleotide-nucleotide BLAST (blastn): This program requires a DNA sequence input and returns the most similar DNA sequences from the DNA database that the user specifies (e.g. for a specific organism).
ii) Protein-protein BLAST (blastp): Here the user inputs a protein sequence and the program returns the most similar protein sequences from the protein database that the user specifies.
iii) Position-Specific Iterative BLAST (PSI-BLAST) (blastpgp): The user input is a protein sequence which returns a set of closely related proteins, and from this dataset a conserved profile is generated. Next a new query is generated using only these conserved &#8220;motifs&#8221; which is used to interrogate a protein database and this returns a larger group of proteins from which a new set of conserved &#8220;motifs&#8221; are extracted and then used to interrogate a protein database until an even larger set of proteins are retuned and another profile is generated and the process repeated. By including related proteins into the query in each step this program allows the user to identify sequences that are more divergent.
iv) Nucleotide 6-frame translation-protein (blastx): Here the user provides a nucleotide sequence input which is converted into the six-frame conceptual translation products (i.e. both strands) against a protein sequence database.
v) Nucleotide 6-frame translation-nucleotide 6-frame translation (tblastx): This program takes a DNA nucleotide sequence input and translates the input into all six-frame conceptual translation products which it compares against the six-frame translations of a nucleotide sequence database.
vi) Protein-nucleotide 6-frame translation (tblastn): This program uses a protein sequence input to compare against all six reading frames of a nucleotide sequence database.
Next, we describe commonly used programs for generating a Multiple Sequence Alignment (MSA) from a sequence dataset, and this is followed by a user guide to programs that determine the best-fit models of evolution for a sequence dataset. Phylogenetic reconstruction is a statistical problem, and because of this, phylogenetic methods need to incorporate a statistical framework. This statistical framework becomes an evolutionary model that incorporates sequence change within the dataset. This evolutionary model is comprised of a set of assumptions about the process of nucleotide or amino-acid substitutions, and the best-fit model for a particular dataset can be selected through statistical testing. The fit to the data of different models can be compared via likelihood ratio tests (LRTs) or information criteria to select the best-fit model within a set of possible ones. Two common information criteria are the Akaike information criterion (AIC)2 and the Bayesian information criterion (BIC)3. Once an optimal alignment is generated, there are many different methods to create a phylogeny from the aligned data. There are numerous methods of inferring evolutionary relationships; broadly, they can be divided into two categories: distance-based methods and sequence-based methods. Distance-based methods compute pairwise distances from sequences, and then use these distances to obtain the tree. Sequence-based methods use the sequence alignment directly, and usually search the tree space using an optimality criterion. We outline two sequence-based methods for reconstructing phylogenetic relationships: these are PhyML4 which implements the maximum likelihood framework, and MrBayes5 which uses Bayesian Markov Chain Monte Carlo inference. Likelihood and Bayesian methods provide a statistical framework for phylogenetic reconstruction. By providing user information on commonly used tree-building tools, we introduce the reader to the necessary data required to infer phylogenetic relationships.

<table border="0" cellpadding="0" cellspacing="0" width="713">
	<colgroup>
		<col />
		<col />
		<col />
		<col />
	</colgroup>
	<tbody>
		<tr height="21">
			<td height="21" style="height:21px;">BLAST webpage&#160;</td>
			<td></td>
			<td></td>
			<td><a href="http://blast.ncbi.nlm.nih.gov/Blast.cgi">http://blast.ncbi.nlm.nih.gov/Blast.cgi</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">BLAST executables&#160;</td>
			<td></td>
			<td></td>
			<td><a href="ftp://ftp.ncbi.nlm.nih.gov/blast/executables/blast+/LATEST/">ftp://ftp.ncbi.nlm.nih.gov/blast/executables/blast+/LATEST/</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">Preformatted BLAST databases</td>
			<td></td>
			<td></td>
			<td><a href="ftp://ftp.ncbi.nlm.nih.gov/blast/db/">ftp://ftp.ncbi.nlm.nih.gov/blast/db/</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">Clustal</td>
			<td></td>
			<td></td>
			<td><a href="http://www.clustal.org/">http://www.clustal.org/</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">Kalign</td>
			<td></td>
			<td></td>
			<td><a href="http://msa.sbc.su.se/cgi-bin/msa.cgi">http://msa.sbc.su.se/cgi-bin/msa.cgi</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">MAFFT</td>
			<td></td>
			<td></td>
			<td><a href="http://mafft.cbrc.jp/alignment/software/">http://mafft.cbrc.jp/alignment/software/</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">MUSCLE</td>
			<td></td>
			<td></td>
			<td><a href="http://www.drive5.com/muscle/">http://www.drive5.com/muscle/</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">T-Coffee</td>
			<td></td>
			<td></td>
			<td><a href="http://www.tcoffee.org/Projects/tcoffee/">http://www.tcoffee.org/Projects/tcoffee/</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">PROBCONS</td>
			<td></td>
			<td></td>
			<td><a href="http://toolkit.tuebingen.mpg.de/probcons">http://toolkit.tuebingen.mpg.de/probcons&#160;</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">Se-Al&#160;</td>
			<td></td>
			<td></td>
			<td><a href="http://tree.bio.ed.ac.uk/software/seal/">http://tree.bio.ed.ac.uk/software/seal/</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">BSEdit&#160;</td>
			<td></td>
			<td></td>
			<td><a href="http://www.bsedit.org/">http://www.bsedit.org/</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">JalView</td>
			<td></td>
			<td></td>
			<td><a href="http://www.jalview.org/">http://www.jalview.org/</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">SeaView</td>
			<td></td>
			<td></td>
			<td><a href="http://pbil.univ-lyon1.fr/software/seaview.html">http://pbil.univ-lyon1.fr/software/seaview.html</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">ProtTest&#160;</td>
			<td></td>
			<td></td>
			<td style="width:447px;"><a href="https://code.google.com/p/prottest3/">https://code.google.com/p/prottest3/</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">Java Runtime&#160;</td>
			<td></td>
			<td></td>
			<td><a href="http://www.java.com/en/download/chrome.jsp">http://www.java.com/en/download/chrome.jsp</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">Readseq</td>
			<td></td>
			<td></td>
			<td><a href="http://iubio.bio.indiana.edu/cgi-bin/readseq.cgi">http://iubio.bio.indiana.edu/cgi-bin/readseq.cgi</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">jModelTest</td>
			<td></td>
			<td></td>
			<td style="width:447px;"><a href="https://code.google.com/p/jmodeltest2/">https://code.google.com/p/jmodeltest2/</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">PhyML</td>
			<td></td>
			<td></td>
			<td><a href="https://code.google.com/p/phyml/">https://code.google.com/p/phyml/</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">MrBayes</td>
			<td></td>
			<td></td>
			<td><a href="http://mrbayes.sourceforge.net/download.php">http://mrbayes.sourceforge.net/download.php</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">TreeView</td>
			<td></td>
			<td></td>
			<td><a href="http://taxonomy.zoology.gla.ac.uk/rod/treeview.html">http://taxonomy.zoology.gla.ac.uk/rod/treeview.html</a></td>
		</tr>
		<tr height="21">
			<td height="21" style="height:21px;">TreeDyn</td>
			<td></td>
			<td></td>
			<td style="width:447px;"><a href="http://www.treedyn.org/">http://www.treedyn.org/</a></td>
		</tr>
	</tbody>
</table>

a practical guide to phylogenetics for nonexperts

Many researchers, across incredibly diverse foci, are applying phylogenetics to their research question(s). However, many researchers are new to this topic and so it presents inherent problems. Here we compile a practical introduction to phylogenetics for nonexperts.&#160;We outline in a step-by-step manner, a pipeline for generating reliable phylogenies from gene sequence datasets. We begin with a user-guide for similarity search tools via online interfaces as well as local executables. Next, we explore programs for generating multiple sequence alignments followed by protocols for using software to determine best-fit models of evolution. We then outline protocols for reconstructing phylogenetic relationships via maximum likelihood and Bayesian criteria&#160;and finally describe tools for visualizing phylogenetic trees. While this is not by any means an exhaustive description of phylogenetic approaches, it does provide the reader with practical starting information on key software applications commonly utilized by phylogeneticists. The vision for this article would be that it could serve as a practical training tool for researchers embarking on phylogenetic studies&#160;and also serve as an educational resource that could be incorporated into a classroom or teaching-lab.

Finding similarities to a query allows researchers to ascribe a potential identity to new sequences and also infer relationships between sequences. The file input type for BLAST1 is FASTA formatted text sequence or GenBank accession number. FASTA formatted sequence begins with a description line indicated by a &#8220;&#62;&#8221; sign (Figure 2). The description must follow immediately after the &#8220;&#62;&#8221; sign, the sequence (i.e. nucleotides or amino acids) follow the descri...

Watch this Scientific Journal Video about A Practical Guide to Phylogenetics for Nonexperts at JoVE.com

A Practical Guide to Phylogenetics for Nonexperts

Here we describe a step-by-step pipeline for generating reliable phylogenies from nucleotide or amino acid sequence datasets. This guide aims to serve researchers or students new to phylogenetic analysis.&#160;

Many researchers, across incredibly diverse foci, are applying phylogenetics to their research question(s). However, many researchers are new to this ...

a-practical-guide-to-phylogenetics-for-nonexperts

Research

JoVE Journal

Biology

35.1K Görüntüleme.  The George Washington University.  Burada nükleotid ya da amino asit dizisi veri setleri güvenilir filogenezlerini üretilmesi için adım adım boru hattını açıklar. Bu kılavuz, araştırmacılar veya filogenetik analize yeni öğrencilere hizmet etmeyi amaçlamaktadır. 