Coder Social home page Coder Social logo

integerlimit / iqtree2 Goto Github PK

View Code? Open in Web Editor NEW

This project forked from iqtree/iqtree2

0.0 0.0 0.0 65.66 MB

NEW location of IQ-TREE software for efficient phylogenomic software by maximum likelihood http://www.iqtree.org

License: GNU General Public License v2.0

Shell 0.07% C++ 68.65% Python 0.11% Perl 0.03% C 27.31% C# 0.40% Assembly 1.01% Ada 0.64% CLIPS 0.04% Pascal 0.50% SAS 0.01% Makefile 0.19% HTML 0.21% CMake 0.59% Batchfile 0.01% DIGITAL Command Language 0.20% Module Management System 0.01% M4 0.01% Roff 0.03% Nix 0.01%

iqtree2's Introduction

IQ-TREE

Github IQ-TREE 1 Releases Github IQ-TREE 2 Releases BioConda downloads Build Status License: GPL v2

Efficient and versatile phylogenomic software by maximum likelihood http://www.iqtree.org

Introduction

The IQ-TREE software was created as the successor of IQPNNI and TREE-PUZZLE (thus the name IQ-TREE). IQ-TREE was motivated by the rapid accumulation of phylogenomic data, leading to a need for efficient phylogenomic software that can handle a large amount of data and provide more complex models of sequence evolution. To this end, IQ-TREE can utilize multicore computers and distributed parallel computing to speed up the analysis. IQ-TREE automatically performs checkpointing to resume an interrupted analysis.

As input IQ-TREE accepts all common sequence alignment formats including PHYLIP, FASTA, Nexus, Clustal and MSF. As output IQ-TREE will write a self-readable report file (name suffix .iqtree), a NEWICK tree file (.treefile) which can be visualized by tree viewer programs such as FigTree, Dendroscope or iTOL.

Key features of IQ-TREE

  • Efficient search algorithm: Fast and effective stochastic algorithm to reconstruct phylogenetic trees by maximum likelihood. IQ-TREE compares favorably to RAxML and PhyML in terms of likelihood while requiring similar amount of computing time (Nguyen et al., 2015).
  • Ultrafast bootstrap: An ultrafast bootstrap approximation (UFBoot) to assess branch supports. UFBoot is 10 to 40 times faster than RAxML rapid bootstrap and obtains less biased support values (Minh et al., 2013).
  • Ultrafast model selection: An ultrafast and automatic model selection (ModelFinder) which is 10 to 100 times faster than jModelTest and ProtTest. ModelFinder also finds best-fit partitioning scheme like PartitionFinder (Kalyaanamoorthy et al., 2017).
  • Phylogenetic testing: Several fast branch tests like SH-aLRT and aBayes test (Anisimova et al., 2011) and tree topology tests like the approximately unbiased (AU) test (Shimodaira, 2002).

The strength of IQ-TREE is the availability of a wide variety of phylogenetic models:

IQ-TREE web service

For a quick start you can also try the IQ-TREE web server, which performs online computation using a dedicated computing cluster. It is very easy to use with as few as just 3 clicks! Try it out at:

User support

Please refer to the user documentation and frequently asked questions. If you have further questions and feedback, please create a topic at Github discussions. For feature requests bug reports please post a topic at Github issues.

Citations

General citation for IQ-TREE 2:

  • B.Q. Minh, H.A. Schmidt, O. Chernomor, D. Schrempf, M.D. Woodhams, A. von Haeseler, R. Lanfear (2020) IQ-TREE 2: New models and efficient methods for phylogenetic inference in the genomic era. Mol. Biol. Evol., 37:1530-1534. https://doi.org/10.1093/molbev/msaa015

Moreover, there are other papers associated with notable features in IQ-TREE, which are normally mentioned in the corresponding documentation. We ask that you also cite these papers, which are important for us to obtain fundings to continuously maintain the code of IQ-TREE. These papers are also listed below.

When using tree mixture models (MAST) please cite:

  • T.K.F. Wong, C. Cherryh, A.G. Rodrigo, M.W. Hahn, B.Q. Minh, R. Lanfear (2024) MAST: Phylogenetic Inference with Mixtures Across Sites and Trees. Syst. Biol., in press. https://doi.org/10.1093/sysbio/syae008

When computing concordance factors please cite:

When using AliSim to simulate alignments please cite:

  • N. Ly-Trong, S. Naser-Khdour, R. Lanfear, B.Q. Minh (2022) AliSim: A Fast and Versatile Phylogenetic Sequence Simulator for the Genomic Era. Mol. Biol. Evol., 39:msac092. https://doi.org/10.1093/molbev/msac092

When estimating amino-acid Q matrix please cite:

  • B.Q. Minh, C. Cao Dang, L.S. Vinh, R. Lanfear (2021) QMaker: Fast and accurate method to estimate empirical models of protein evolution. Syst. Biol., 70:1046–1060. https://doi.org/10.1093/sysbio/syab010

When using the heterotachy GHOST model "+H" please cite:

  • S.M. Crotty, B.Q. Minh, N.G. Bean, B.R. Holland, J. Tuke, L.S. Jermiin, A. von Haeseler (2020) GHOST: Recovering Historical Signal from Heterotachously Evolved Sequence Alignments. Syst. Biol., 69:249-264. https://doi.org/10.1093/sysbio/syz051

When using the tests of symmetry please cite:

  • S. Naser-Khdour, B.Q. Minh, W. Zhang, E.A. Stone, R. Lanfear (2019) The Prevalence and Impact of Model Violations in Phylogenetic Analysis. Genome Biol. Evol., 11:3341-3352. https://doi.org/10.1093/gbe/evz193

When using polymorphism-aware models please cite:

  • D. Schrempf, B.Q. Minh, A. von Haeseler, C. Kosiol (2019) Polymorphism-aware species trees with advanced mutation models, bootstrap, and rate heterogeneity. Mol. Biol. Evol., 36:1294–1301. https://doi.org/10.1093/molbev/msz043

For the ultrafast bootstrap (UFBoot) please cite:

  • D.T. Hoang, O. Chernomor, A. von Haeseler, B.Q. Minh, and L.S. Vinh (2018) UFBoot2: Improving the ultrafast bootstrap approximation. Mol. Biol. Evol., 35:518–522. https://doi.org/10.1093/molbev/msx281

When using posterior mean site frequency model (PMSF) please cite:

  • H.C. Wang, B.Q. Minh, S. Susko, A.J. Roger (2018) Modeling site heterogeneity with posterior mean site frequency profiles accelerates accurate phylogenomic estimation. Syst. Biol., 67:216–235. https://doi.org/10.1093/sysbio/syx068

When using ModelFinder please cite:

  • S. Kalyaanamoorthy, B.Q. Minh, T.K.F. Wong, A. von Haeseler, L.S. Jermiin (2017) ModelFinder: Fast model selection for accurate phylogenetic estimates. Nat. Methods, 14:587-589. https://doi.org/10.1038/nmeth.4285

When using partition models please cite:

  • O. Chernomor, A. von Haeseler, B.Q. Minh (2016) Terrace aware data structure for phylogenomic inference from supermatrices. Syst. Biol., 65:997-1008. https://doi.org/10.1093/sysbio/syw037

When using IQ-TREE web server please cite:

  • J. Trifinopoulos, L.-T. Nguyen, A. von Haeseler, B.Q. Minh (2016) W-IQ-TREE: a fast online phylogenetic tool for maximum likelihood analysis. Nucleic Acids Res., 44:W232-W235. https://doi.org/10.1093/nar/gkw256

When using IQ-TREE version 1 please cite:

  • L. Nguyen, H.A. Schmidt, A. von Haeseler, B.Q. Minh (2015) IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies. Mol. Biol. and Evol., 32:268-274. https://doi.org/10.1093/molbev/msu300

Credits and Acknowledgements

Some parts of the code were taken from the following packages/libraries: Phylogenetic likelihood library, TREE-PUZZLE, BIONJ, Nexus Class Libary, Eigen library, SPRNG library, Zlib library, gzstream library, vectorclass library, GNU scientific library.

IQ-TREE was funded by the Austrian Science Fund - FWF (grant no. I 760-B17 from 2012-2015 and and I 2508-B29 from 2016-2019), the University of Vienna (Initiativkolleg I059-N), the Australian National University, Chan-Zuckerberg Initiative (open source software for science grants), Simons Foundation, Moore Foundation, and Australian Research Council.

iqtree2's People

Contributors

bqminh avatar bredelings avatar cassiusma avatar compphylolab avatar cuongbb avatar davebx avatar diepthihoang avatar dschrempf avatar fgp avatar foldvaridominic avatar gbarca avatar heikotree avatar integerlimit avatar jamesbarbetti avatar jdaneau avatar jehops avatar lamtung avatar lukres avatar martin-g avatar mgilsci avatar michaelwoodhams avatar mphschmitt avatar nicoladm avatar njoly avatar olgachern avatar thomaskf avatar tothuhien avatar trongnhanuit avatar upsj avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.