******************************************************************************** ******************************************************************************** ***** IQPNNI: Moving Fast Through Tree Space and Stopping in Time ***** ******************************************************************************** ******************************************************************************** Copyright (C) 2005 by Le Sy Vinh, Bui Quang Minh, Heiko A. Schmidt, and Arndt von Haeseler Copyright (C) 2004 by Le Sy Vinh and Arndt von Haeseler This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License Please refer to http://www.opensource.org/licenses/gpl-license.html for details. ================================================================================ The method is described in detail in the following article: Le Sy Vinh and Arndt von Haeseler (2004) IQPNNI: Moving fast through tree space and stopping in time, Mol. Biol. Evol. 21(8):1565-1571 http://dx.doi.org/10.1093/molbev/msh176dd ================================================================================ Main Contributors Le Sy Vinh NIC, Forschungszentrum Juelich, Germany vinh(AT)cs.uni-duesseldorf.de Arndt von Haeseler Bioinformatics Institute, Heinrich Heine University Duesseldorf, Germany haeseler(AT)cs.uni-duesseldorf.de Heiko A. Schmidt NIC, Forschungszentrum Juelich, Germany hschmidt(AT)cs.uni-duesseldorf.de Bui Quang Minh Albert Ludwigs University Freiburg, Germany minh(AT)cs.uni-duesseldorf.de ================================================================================ NEW FEATURES: We have already included new features into IQPNNI version 3.0.b1 1. The program now runs at least twice faster (applying Newton's method instead of Brent's algorithm and some other algorithmic means) 2. Running in Parallel with Message Passing Interface (MPI) *NOTE*: - The option to change rate heterogeneity is now 'r' instead of 'w'. - The stopping rule is now switched off by default, which can be changed using the 's' option. Features added in older Versions: IQPNNI 2.x 1. General Time Reversible model of evolution 2. Site-specific substitution rates 3. Checking pointing: If the program was crashed or stopped by users, it can continue from the last stopped point. ================================================================================ SHORT DESCRIPTION: IQPNNI is a computer program to reconstruct the evolutionary relationships among contemporary species. It is menu-driven program which allows users to specify the parameter values or let the program estimate them from the input data (a nucleotide or amino acid alignment in PHYLIP format). The options are classified into four main groups, general options, IQP options, substitution process options, and rate heterogeneity options. ================================================================================ AVAILABLE OPTIONS: ------------------ IQPNNI used a text-based menu-driven interface like: GENERAL OPTIONS o Display as outgroup? A-14-133 n Number of iterations? 88 s Stopping rule? No IQP OPTIONS p Probability of deleting a sequence? 0.5 k Number representatives? 4 SUBSTITUTION PROCESS d Type of sequence input data? Nucleotides m Model of substitution? HKY85 (Hasegawa et al. 1985) t Ts/Tv ratio (0.5 for JC69)? Estimate from data f Base frequencies? Estimate from data RATE HETEROGENEITY r Model of rate heterogeneity? Uniform rate quit [q], confirm [y],or change [menu] settings: In the following the available options will be briefly introduced: GENERAL OPTIONS The option 'o': Users can specify a sequence as the outgroup sequence. The final tree with the highest likelihood will be rooted with respect to the outgroup sequence. The option 'n': Users can specify the number of iterations or use the default value. The option 's': Users can choose one of four possibilities to stop the program. 1. The first possibility is "s Stopping rule? No" It means that the program will stop after 'n' iterations. 2. The second possibility is "s Stopping rule (if applicable)? Yes, but at least 'n' iterations" It is similar to the fourth possibility, but the program will run at least 'n' iterations. 3. The third possibility is "s Stopping rule (if applicable)? Yes, but at most 'n' iterations" It is similar to the fourth possibility, but the program will run at most 'n' iterations. 4. The last possibility is "s Stopping rule (if applicable)? Yes" It means that the program will stop and output the optimal tree with 95% confidence if at least three better trees found during the search, otherwise it will stop after 'n' iterations. IQP OPTIONS The option 'p': Users can specify the probability of deleting a sequence or let the program estimate it from the input data. Note that, when the sequence length is very long users should increase the value of p and try different runs with various choices of p. The option 'k': One can specify number of representatives leaves for a rooted tree. However, we strongly recommend to use the default value. THE SUBSTITUTION PROCESS If the input data is nucleotide the program can work with JC69 (Juke and Cantor, 1969), K2P (Kimura's 2-Parameter model, 1980), F81 (Felsenstein, 1981), and HKY85 (Hasegawa et al., 1985), TN93 (Tamura and Nei, 1993) and General Time Reversible models (GTR, e.g., Tavare, 1986) of evolution. For amino acids, the following models are available: Dayhoff (Dayhoff et al., 1978), JTT (Jones et al., 1992), VT (Mueller and Vingron, 2000), mtREV (Adachi and Hasegawa, 1996), WAG (Whelan and Goldman, 2000). The BLOSUM62 matrix by Henikoff and Henikoff (1992) should better not be used for phylogenetic reconstruction, because it was constructed for database searches and does not reflect an evolutionary process. The option 'd': Users must specify the type of sequence input data: 1. Nucleotides or 2. Amino acids. The option 'f': Users can specify the base frequencies or let the program estimate them from the input data. The option 't': If HKY85 or TN93 model are chosen, one can specify the transition/transversion ratio (between 0.2 and 32.0) or let the program estimate it from the input data (default). The option 'u': For the TN93 model one can also enter the py/pu ratio (the ratio of pyrimidine transition rate to purine transition rate) between 0.2 and 32.0, or let the program estimate it from the input data (default). The option 'g': If users choose General Time Reversible model, they can specify six different rate parameters: 1. Transversion rate from A to C, 2. Transition rate from A to G, 3. Transversion rate from A to T, 4. Transversion rate from C to G, 5. Transition rate from C to T, 6. Transversion rate from G to T, or let the program estimate them from the input data. RATE HETEROGENEITY The program can also assume rate heterogeneity. Users can either choose uniform rate over all sites (rate homogeneity, default), site-specific substitution rates (cf. Sonja Meyer and Arndt von Haeseler, Identifying Site-Specific Substitution Rates, Mol. Biol. Evol. 20(2).2003), or Gamma distributed rates. The option 'r': To switch among 3 types: Uniform rate, Gamma distributed rate site specific rate. The option 'a': If users choose Gamma distributed rate, they can specify the Gamma distribution shape parameter alpha (between 0.1 and 100.0) or let IQPNNI program estimate it from the input data (default). The option 'c': If users choose Gamma distributed rates, they can specify a number of Gamma rate categories between 2 and 32. The default is 4 categories. ================================================================================ Installation: ------------- See below for information how to install/build the different versions of the IQPNNI software. Executable versions of the sequential, that is, non-parallel program are intended for a number of operating systems. The parallel program (pIQPNNI) has to be build from the sources, as is the sequential program if a binary release does not exist for you operating system. Sequential Version - Binary release: ------------------------------------ 1) You might want to download the executable version of IQPNNI for your operating system if it is available (iqpnni-XXX-OS.tar.gz or iqpnni-XXX-OS.zip, where XXX is the current version number and OS the operating system) from its web page . 2) Extract the files (e.g., with tar xvzf 'iqpnni-XXX-OS.tar.gz' under Unix) This should create a directory iqpnni-XXX. 3) You will find the executable in iqpnni-XXX/src This executable you should rename to 'iqpnni' (or 'iqpnni.exe on Windows systems) and copy it to your system's search path such that it is found by your system. If you encounter problems, please ask your local administrator for help. Sequential Version - Source package: ------------------------------------ To build IQPNNI from the sources you need a functional C++ compiler installed (This is usually the case on UNIX/Linux systems. For Windows you might want to obtain CygWin or XCode for MacOSX). Then you can follow the procedure below: 1) Download the current version of the software (iqpnni-XXX.tar.gz or iqpnni-XXX.zip, where XXX is the current version number) from its web page . 2) Extract the files (e.g., with tar xvzf 'iqpnni-XXX.tar.gz' under Unix) This should create a directory iqpnni-XXX. 3) Change into this directory. 4) To compile the program, type the following: ./configure This should configure the package for the build. You might also want to refer to the INSTALL file for more (general) details. make This compiles and builds the executable 'iqpnni' (or 'iqpnni.exe' on Windows systems) to be found in the 'src' directory. This executable can copied to your system's search path such that it is found by your system or it can be installed to the default destination (e.g., /usr/local/bin on UNIX/Linux) using make install If you encounter problems, please ask your local administrator for help. Parallel Version - Binary release: ---------------------------------- There will be no binary version of the parallel program because it depends on the MPI library you have installed locally. Parallel Version - Source package: ---------------------------------- To build the MPI-parallel version of IQPNNI (pIQPNNI) you need a functional C++ compiler installed (This is usually the case on UNIX/Linux systems. For Windows you might want to obtain CygWin or XCode for MacOSX). In addition you have to install an implementation of the MPI (Message Passing Interface) library. There is a list of (free) implementations at http://www.lammpi.org/mpi/implementations/ available. Then you can follow the procedure below: 1) Download the current version of the software (iqpnni-XXX.tar.gz or iqpnni-XXX.zip, where XXX is the current version number) from its web page . 2) Extract the files (e.g., with tar xvzf 'iqpnni-XXX.tar.gz' under Unix) This should create a directory iqpnni-XXX. 3) Change into this directory. 4) To compile the program, you have to run the configure script with the environment variable CXX set to the MPI-C++ compiler of your local MPI implementation and turn on the preprocessor directive PARALLEL, e.g. env CXX=mpiCC CXXFLAGS="-DPARALLEL -O2" ./configure This should configure the package for the build using mpiCC as the C++ compiler. You might also want to refer to the INSTALL file for more (general) details. make This compiles and builds the executable 'iqpnni' (or 'iqpnni.exe' on Windows systems) to be found in the 'src' directory. This executable should be renamed to 'piqpnni' and copied to your system's search path such that it is found by your system. 5) To run the parallel version please refer to the documentation of your locally installed MPI implementation and/or ask your local system administrator. If you encounter problems, please ask your local administrator for help. ================================================================================ References: to be added ================================================================================ CREDITS: Some parts of the code were taken from TREE-PUZZLE package: Heiko A. Schmidt, Korbinian Strimmer, Martin Vingron, and Arndt von Haeseler, (2002) TREE-PUZZLE: Maximum likelihood phylogenetic analysis using quartets and parallel computing, Bioinformatics, 18:502-504 The source code to construct the BIONJ tree were taken from BIONJ software: Oliver Gascuel (1997) BIONJ: An Improved Version of the NJ Algorithm Based on a Simple Model of Sequence Data, Mol. Bio. Evol., 14:685-695 ******************************************************************************** * This program is distributed in the hope that it will be useful, but * * WITHOUT ANY WARRANTY; without even the implied warranty of * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * * General Public License for more details. * ********************************************************************************