3
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      EZmito: a simple and fast tool for multiple mitogenome analyses

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Complete mitochondrial genome data are frequently applied to address phylogenetic/phylogeographic issues at different taxonomic levels in ecology and evolution. While sample preparation/sequencing is becoming more and more straightforward thanks to dropping costs for next-generation sequencing (NGS), data preparation and visualization remains a manually intensive step that may lead to errors if improperly conducted. We have elaborated, and here introduce, EZmito, a simple and intuitive, freely accessible Web Server aimed at automating some of these tasks. EZmito is divided into three main tools: EZpipe that assembles DNA matrices for phylo-mitogenomic analyses; EZskew that calculates genome, strand, and codon nucleotide compositional skews and EZcodon which computes Relative Synonymous Codon Usage statistics as well as amino acid usage frequency over multiple mitogenomes. Output is produced in tabular format as well as publication-quality graphics.

          Related collections

          Most cited references25

          • Record: found
          • Abstract: found
          • Article: found
          Is Open Access

          RAxML version 8: a tool for phylogenetic analysis and post-analysis of large phylogenies

          Motivation: Phylogenies are increasingly used in all fields of medical and biological research. Moreover, because of the next-generation sequencing revolution, datasets used for conducting phylogenetic analyses grow at an unprecedented pace. RAxML (Randomized Axelerated Maximum Likelihood) is a popular program for phylogenetic analyses of large datasets under maximum likelihood. Since the last RAxML paper in 2006, it has been continuously maintained and extended to accommodate the increasingly growing input datasets and to serve the needs of the user community. Results: I present some of the most notable new features and extensions of RAxML, such as a substantial extension of substitution models and supported data types, the introduction of SSE3, AVX and AVX2 vector intrinsics, techniques for reducing the memory requirements of the code and a plethora of operations for conducting post-analyses on sets of trees. In addition, an up-to-date 50-page user manual covering all new RAxML options is available. Availability and implementation: The code is available under GNU GPL at https://github.com/stamatak/standard-RAxML. Contact: alexandros.stamatakis@h-its.org Supplementary information: Supplementary data are available at Bioinformatics online.
            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            IQ-TREE: A Fast and Effective Stochastic Algorithm for Estimating Maximum-Likelihood Phylogenies

            Large phylogenomics data sets require fast tree inference methods, especially for maximum-likelihood (ML) phylogenies. Fast programs exist, but due to inherent heuristics to find optimal trees, it is not clear whether the best tree is found. Thus, there is need for additional approaches that employ different search strategies to find ML trees and that are at the same time as fast as currently available ML programs. We show that a combination of hill-climbing approaches and a stochastic perturbation method can be time-efficiently implemented. If we allow the same CPU time as RAxML and PhyML, then our software IQ-TREE found higher likelihoods between 62.2% and 87.1% of the studied alignments, thus efficiently exploring the tree-space. If we use the IQ-TREE stopping rule, RAxML and PhyML are faster in 75.7% and 47.1% of the DNA alignments and 42.2% and 100% of the protein alignments, respectively. However, the range of obtaining higher likelihoods with IQ-TREE improves to 73.3-97.1%.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              MUSCLE: multiple sequence alignment with high accuracy and high throughput.

              We describe MUSCLE, a new computer program for creating multiple alignments of protein sequences. Elements of the algorithm include fast distance estimation using kmer counting, progressive alignment using a new profile function we call the log-expectation score, and refinement using tree-dependent restricted partitioning. The speed and accuracy of MUSCLE are compared with T-Coffee, MAFFT and CLUSTALW on four test sets of reference alignments: BAliBASE, SABmark, SMART and a new benchmark, PREFAB. MUSCLE achieves the highest, or joint highest, rank in accuracy on each of these sets. Without refinement, MUSCLE achieves average accuracy statistically indistinguishable from T-Coffee and MAFFT, and is the fastest of the tested methods for large numbers of sequences, aligning 5000 sequences of average length 350 in 7 min on a current desktop computer. The MUSCLE program, source code and PREFAB test data are freely available at http://www.drive5. com/muscle.
                Bookmark

                Author and article information

                Journal
                Mitochondrial DNA B Resour
                Mitochondrial DNA B Resour
                Mitochondrial DNA. Part B, Resources
                Taylor & Francis
                2380-2359
                19 March 2021
                2021
                : 6
                : 3
                : 1101-1109
                Affiliations
                [a ]Department of Life Sciences, University of Siena , Siena, Italy
                [b ]Department of Life Sciences, Imperial College London , London, UK
                [c ]Department de Biodiversitat Animal i Microbiana, Institut Mediterrani d’Estudis Avancats , Esporles, Spain
                Author notes
                CONTACT Antonio Carapelli antonio.carapelli@ 123456unisi.it Department of Life Sciences, University of Siena , Siena, Italy
                Author information
                https://orcid.org/0000-0003-1918-0702
                https://orcid.org/0000-0003-0510-2535
                https://orcid.org/0000-0001-7758-5367
                https://orcid.org/0000-0001-6724-5684
                https://orcid.org/0000-0002-5260-5840
                https://orcid.org/0000-0002-0313-3357
                https://orcid.org/0000-0003-2999-6203
                https://orcid.org/0000-0002-4549-5831
                https://orcid.org/0000-0002-3165-9620
                https://orcid.org/0000-0003-0271-9855
                Article
                1899865
                10.1080/23802359.2021.1899865
                7995877
                33796755
                0a6fddb8-8863-41a9-b152-ab6558a7649d
                © 2021 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group.

                This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

                History
                Page count
                Figures: 5, Tables: 1, Pages: 9, Words: 3888
                Categories
                Research Article
                Rapid Communication

                web server,phylogeny,mitogenome,nucleotide bias,rscu
                web server, phylogeny, mitogenome, nucleotide bias, rscu

                Comments

                Comment on this article

                scite_

                Similar content562

                Cited by13

                Most referenced authors976