Metacon: Unsupervised Clustering of Metagenomic Contigs with Probabilistic K-Mers Statistics and Coverage Jia Qian and Matteo Comin*

Metacon: Unsupervised Clustering of Metagenomic Contigs with Probabilistic K-Mers Statistics and Coverage Jia Qian and Matteo Comin*

Qian and Comin BMC Bioinformatics 2019, 20(Suppl 9):367 https://doi.org/10.1186/s12859-019-2904-4 RESEARCH Open Access MetaCon: unsupervised clustering of metagenomic contigs with probabilistic k-mers statistics and coverage Jia Qian and Matteo Comin* From Annual Meeting of the Bioinformatics Italian Society (BITS 2018) Turin, Italy. 27 - 29 June 2018 Abstract Motivation: Sequencing technologies allow the sequencing of microbial communities directly from the environment without prior culturing. Because assembly typically produces only genome fragments, also known as contigs, it is crucial to group them into putative species for further taxonomic profiling and down-streaming functional analysis. Taxonomic analysis of microbial communities requires contig clustering, a process referred to as binning, that is still one of the most challenging tasks when analyzing metagenomic data. The major problems are the lack of taxonomically related genomes in existing reference databases, the uneven abundance ratio of species, sequencing errors, and the limitations due to binning contig of different lengths. Results: In this context we present MetaCon a novel tool for unsupervised metagenomic contig binning based on probabilistic k-mers statistics and coverage. MetaCon uses a signature based on k-mers statistics that accounts for the different probability of appearance of a k-mer in different species, also contigs of different length are clustered in two separate phases. The effectiveness of MetaCon is demonstrated in both simulated and real datasets in comparison with state-of-art binning approaches such as CONCOCT, MaxBin and MetaBAT. Keywords: Metagenomics, Unsupervised clustering, K-mers statistics Introduction is an evolutionary revise, shifting focuses from the indi- Studies in microbial ecology commonly experience a bot- vidual microbe study to a complex microbial community. tleneck effect due to difficulties in microbial isolation and As already mentioned in [3, 4], the classical genomic- cultivation [1]. Due to the difficulty in culturing most based approaches require the prior clone and culturing organisms in a laboratory, alternative methods to analyze for the further investigation. However, not all bacteria can microbial diversity are commonly used to study commu- be cultured. The advent of metagenomics succeeded to nity structure and functionality. bypass this difficulty. One such method is the sequencing of the collective To further investigate the taxonomic structure of micro- genomes (metagenomics) of all microorganisms in an bial samples, assembled sequence fragments, also known environment [2]. Metagenomics is a study of the hetero- as contigs, need be grouped into bin that ultimately rep- geneous microbes samples (e.g. soil, water, human micro- resent genomes. Contig binning serves as the key step biome) directly extracted from the natural environment toward taxonomic profiling and downstream functional with the primary goal of determining the taxonomical analysis. Therefore, accurate binning of the contigs is an identity of the microorganisms residing in the samples. It essential problem in metagenomic studies. Grouping contigs into bins of putative species is one *Correspondence: [email protected] of the hurdles faced when analyzing metagenomic data. Department of Information Engineering, University of Padova, Via Giovanni Typically, one of a few issues are encountered includ- Gradenigo 6, Padova, Italy ing: struggling to differentiate related microorganisms, © The Author(s). 2019 Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated. Qian and Comin BMC Bioinformatics 2019, 20(Suppl 9):367 Page 2 of 12 repetitive sequence regions within or across genomes, is based on the observation that relative sequence sequencing errors, and strain-level variation within the compositions are similar across different regions same species, decreasing accuracy for contigs below a size of the same genome, but differ between distinct threshold, or excluding low coverage and low abundance genomes. organisms [5, 6]. In general, current tools, use the simple k-mers counts Despite extensive studies, accurate binning of contigs as signature for a genome, and these counts are normal- remains challenging [7]. One category is reference-based ized, for ease of comparison, in a global fashion. That is (supervised), that is, reference databases are needed for all k-mers counts are normalized in the same way, irre- the assignment from contigs or reads to meaningful tax- spective of the contig/species they belong to. Moreover, ons. The classification is either based on homology, or when the similarity of two contigs is evaluated as the dis- genomic signatures such as oligonucleotide composition tance of the corresponding k-mers counts vectors, not patterns and taxonomic clades. Among the most impor- all k-mers contributed uniformly to the distance. In fact, tant methods we can recall: Megan [8], Kraken [9], Clark because k-mers have different probability to appear, the [10], SKraken [11], and MetaPhlan [12]. most probable k-mers can produce a bias in the distance. Reference-based methods require to index a database of In this study, we consider this important observation in target genomes, e.g. the NCBI/RefSeq databases of bac- order to develop a signature based on k-mers statistics that terial genomes, that is used to classify. These methods accounts for the different probability of appearance of a are usually very demanding, requiring computing capa- k-mer in different species. In general, the pairwise com- bilities with large amounts of RAM and disk space. Yet, parison of two sequences, or sets of sequences, can be per- query sequences originating from the genomes of most formed with sophisticated similarity measures, based on microbes in an environmental sample lack taxonomically k-mers statistics, derived from research in alignment-free related sequences in existing reference databases. Most statistics [23–28]. bacteria found in environmental samples are unknown Another important aspect is that long contigs carry and cannot be cultured and separated in the labora- more information than short contigs. For this reason long tory [13]. For these reasons, when using reference-based contigs, being more representative, they can be effectively methods the number of unassigned contigs can be very grouped into clusters of candidate species, whereas short high [14, 15]. contigs are often more noisy. The other category of methods is reference-free (unsu- In this paper, we propose MetaCon a method for contig pervised), where studies extract features from contigs to binning based on a new self-standardized k-mers statis- infer bins based on sequence composition [16–18], abun- tics. The main contributions of MetaCon are the fol- dance [19], or hybrids of both sequence composition and lowing: it learn the different k-mers distributions based abundance [5, 20–22]. Therefore, these approaches can on the k-mers probabilities in each contig; it uses the be applied to bin contigs from incomplete or uncultivated information carried by long contigs to guide the con- genomes. Some hybrid binning tools, such as CONCOCT struction of clusters; it can estimate the number of [5], MaxBin2.0 [20] and GroopM [21],aredesignedtobin species with a simple iterative procedure. A recent inde- contigs based on multiple related metagenomic samples. pendent benchmark [7] has reported as the best bin- Among these methods, GroopM [21] is advantageous in ning methods CONCOCT [5]andMetaBat[22]. We its visualized and interactive pipeline. On one hand, it is tested MetaCon on simulated and real metagenomes flexible, allowing users to merge and split bins, on the and compared the accuracy of binning with CON- other hand, in the absence of expert intervention, the COCT [5], MetaBat [22]andMaxBin[20]. MetaCon automatic binning results of GroopM is not as satisfac- performs better in terms of precision, recall and esti- tory as CONCOCT [5]. CONCOCT [5]makesuseof mated number of species on both simulated and real the Gaussian mixture model (GMM) to cluster contigs datasets. The results of this study find that Meta- into bins. MetaBAT [22] calculates integrated distance for Con can generate high-quality genomes from metage- pairwise contigs and then clusters contigs iteratively by nomics datasets via an automated process, which will modified K-medoids algorithm. MaxBin [20]compares enhance our ability to understand complex microbial the distributions of distances between and within the communities. same genomes. The composition of DNA, in terms of its constituent Materials and methods k-mers, is known to be a feature of the genome. All the In this section we present MetaCon and our contribu- above studies are based on the assumption that the k-mer tion to the problem of metagenomic contig binning. As frequency distributions of long fragments or whole we have already observed, most binning tools are based genome sequences are unique to each genome. More on similarity measures

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    12 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us