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

      Complete mitochondrial genome of Laeocathaica amdoana Möllendorff, 1899 and phylogenetic analysis of Camaenidae (Gastropoda: Stylommatophora: Helicoidea)

      data-paper
      ,
      Mitochondrial DNA. Part B, Resources
      Taylor & Francis
      Laeocathaica, Camaenidae, mitogenome, phylogeny

      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

          The first complete mitochondrial genome of the dart sac-bearing camaenid Laeocathaica Möllendorff, 1899 was sequenced and analyzed in this study. The whole mitogenome of Laeocathaica amdoana Möllendorff, 1899 was 14,660 bp in length and its nucleotide composition showed high AT-content of 67.45%. It had 37 genes, including 13 protein-coding genes, two ribosomal RNA genes, and 22 transfer RNA genes. The phylogeny yielded by both Bayesian inference and maximum-likelihood method suggested that Laeocathaica was closely related to the other dart sac-bearing camaenids with known complete mitochondrial genome. These genetic data are expected to provide fundamental resources for further genetic studies on the camaenids.

          Related collections

          Most cited references34

          • 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

            SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing.

            The lion's share of bacteria in various environments cannot be cloned in the laboratory and thus cannot be sequenced using existing technologies. A major goal of single-cell genomics is to complement gene-centric metagenomic data with whole-genome assemblies of uncultivated organisms. Assembly of single-cell data is challenging because of highly non-uniform read coverage as well as elevated levels of sequencing errors and chimeric reads. We describe SPAdes, a new assembler for both single-cell and standard (multicell) assembly, and demonstrate that it improves on the recently released E+V-SC assembler (specialized for single-cell data) and on popular assemblers Velvet and SoapDeNovo (for multicell data). SPAdes generates single-cell assemblies, providing information about genomes of uncultivatable bacteria that vastly exceeds what may be obtained via traditional metagenomics studies. SPAdes is available online ( http://bioinf.spbau.ru/spades ). It is distributed as open source software.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              fastp: an ultra-fast all-in-one FASTQ preprocessor

              Abstract Motivation Quality control and preprocessing of FASTQ files are essential to providing clean data for downstream analysis. Traditionally, a different tool is used for each operation, such as quality control, adapter trimming and quality filtering. These tools are often insufficiently fast as most are developed using high-level programming languages (e.g. Python and Java) and provide limited multi-threading support. Reading and loading data multiple times also renders preprocessing slow and I/O inefficient. Results We developed fastp as an ultra-fast FASTQ preprocessor with useful quality control and data-filtering features. It can perform quality control, adapter trimming, quality filtering, per-read quality pruning and many other operations with a single scan of the FASTQ data. This tool is developed in C++ and has multi-threading support. Based on our evaluation, fastp is 2–5 times faster than other FASTQ preprocessing tools such as Trimmomatic or Cutadapt despite performing far more operations than similar tools. Availability and implementation The open-source code and corresponding instructions are available at https://github.com/OpenGene/fastp.
                Bookmark

                Author and article information

                Journal
                Mitochondrial DNA B Resour
                Mitochondrial DNA B Resour
                Mitochondrial DNA. Part B, Resources
                Taylor & Francis
                2380-2359
                6 July 2023
                2023
                6 July 2023
                : 8
                : 7
                : 731-736
                Affiliations
                School of Life Sciences, Nanjing University , Nanjing, China
                Author notes

                Supplemental data for this article can be accessed online at https://doi.org/10.1080/23802359.2023.2231253.

                CONTACT Min Wu minwu1969@ 123456aliyun.com School of Life Sciences, Nanjing University , Nanjing, China
                Author information
                https://orcid.org/0000-0001-5779-5471
                https://orcid.org/0000-0002-5434-5544
                Article
                2231253
                10.1080/23802359.2023.2231253
                10327522
                b1f928e2-0b9e-4997-92ea-b2eef6dc9d1a
                © 2023 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-NonCommercial License ( http://creativecommons.org/licenses/by-nc/4.0/), which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited. The terms on which this article has been published allow the posting of the Accepted Manuscript in a repository by the author(s) or with their consent.

                History
                Page count
                Figures: 3, Tables: 1, Pages: 6, Words: 3066
                Categories
                Data Note
                Mitogenome Report

                laeocathaica,camaenidae,mitogenome,phylogeny
                laeocathaica, camaenidae, mitogenome, phylogeny

                Comments

                Comment on this article