Cargando…
GeFaST: An improved method for OTU assignment by generalising Swarm’s fastidious clustering approach
BACKGROUND: Massive genomic data sets from high-throughput sequencing allow for new insights into complex biological systems such as microbial communities. Analyses of their diversity and structure are typically preceded by clustering millions of 16S rRNA gene sequences into OTUs. Swarm introduced a...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6134716/ https://www.ncbi.nlm.nih.gov/pubmed/30208838 http://dx.doi.org/10.1186/s12859-018-2349-1 |
_version_ | 1783354712267948032 |
---|---|
author | Müller, Robert Nebel, Markus E. |
author_facet | Müller, Robert Nebel, Markus E. |
author_sort | Müller, Robert |
collection | PubMed |
description | BACKGROUND: Massive genomic data sets from high-throughput sequencing allow for new insights into complex biological systems such as microbial communities. Analyses of their diversity and structure are typically preceded by clustering millions of 16S rRNA gene sequences into OTUs. Swarm introduced a new clustering strategy which addresses important conceptual and performance issues of the popular de novo clustering approach. However, some parts of the new strategy, e.g. the fastidious option for increased clustering quality, come with their own restrictions. RESULTS: In this paper, we present the new exact, alignment-based de novo clustering tool GeFaST, which implements a generalisation of Swarm’s fastidious clustering. Our tool extends the fastidious option to arbitrary clustering thresholds and allows to adjust its greediness. GeFaST was evaluated on mock-community and natural data and achieved higher clustering quality and performance for small to medium clustering thresholds compared to Swarm and other de novo tools. Clustering with GeFaST was between 6 and 197 times as fast as with Swarm, while the latter required up to 38% less memory for non-fastidious clustering but at least three times as much memory for fastidious clustering. CONCLUSIONS: GeFaST extends the scope of Swarm’s clustering strategy by generalising its fastidious option, thereby allowing for gains in clustering quality, and by increasing its performance (especially in the fastidious case). Our evaluations showed that GeFaST has the potential to leverage the use of the (fastidious) clustering strategy for higher thresholds and on larger data sets. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (10.1186/s12859-018-2349-1) contains supplementary material, which is available to authorized users. |
format | Online Article Text |
id | pubmed-6134716 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2018 |
publisher | BioMed Central |
record_format | MEDLINE/PubMed |
spelling | pubmed-61347162018-09-13 GeFaST: An improved method for OTU assignment by generalising Swarm’s fastidious clustering approach Müller, Robert Nebel, Markus E. BMC Bioinformatics Software BACKGROUND: Massive genomic data sets from high-throughput sequencing allow for new insights into complex biological systems such as microbial communities. Analyses of their diversity and structure are typically preceded by clustering millions of 16S rRNA gene sequences into OTUs. Swarm introduced a new clustering strategy which addresses important conceptual and performance issues of the popular de novo clustering approach. However, some parts of the new strategy, e.g. the fastidious option for increased clustering quality, come with their own restrictions. RESULTS: In this paper, we present the new exact, alignment-based de novo clustering tool GeFaST, which implements a generalisation of Swarm’s fastidious clustering. Our tool extends the fastidious option to arbitrary clustering thresholds and allows to adjust its greediness. GeFaST was evaluated on mock-community and natural data and achieved higher clustering quality and performance for small to medium clustering thresholds compared to Swarm and other de novo tools. Clustering with GeFaST was between 6 and 197 times as fast as with Swarm, while the latter required up to 38% less memory for non-fastidious clustering but at least three times as much memory for fastidious clustering. CONCLUSIONS: GeFaST extends the scope of Swarm’s clustering strategy by generalising its fastidious option, thereby allowing for gains in clustering quality, and by increasing its performance (especially in the fastidious case). Our evaluations showed that GeFaST has the potential to leverage the use of the (fastidious) clustering strategy for higher thresholds and on larger data sets. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (10.1186/s12859-018-2349-1) contains supplementary material, which is available to authorized users. BioMed Central 2018-09-12 /pmc/articles/PMC6134716/ /pubmed/30208838 http://dx.doi.org/10.1186/s12859-018-2349-1 Text en © The Author(s) 2018 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. |
spellingShingle | Software Müller, Robert Nebel, Markus E. GeFaST: An improved method for OTU assignment by generalising Swarm’s fastidious clustering approach |
title | GeFaST: An improved method for OTU assignment by generalising Swarm’s fastidious clustering approach |
title_full | GeFaST: An improved method for OTU assignment by generalising Swarm’s fastidious clustering approach |
title_fullStr | GeFaST: An improved method for OTU assignment by generalising Swarm’s fastidious clustering approach |
title_full_unstemmed | GeFaST: An improved method for OTU assignment by generalising Swarm’s fastidious clustering approach |
title_short | GeFaST: An improved method for OTU assignment by generalising Swarm’s fastidious clustering approach |
title_sort | gefast: an improved method for otu assignment by generalising swarm’s fastidious clustering approach |
topic | Software |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6134716/ https://www.ncbi.nlm.nih.gov/pubmed/30208838 http://dx.doi.org/10.1186/s12859-018-2349-1 |
work_keys_str_mv | AT mullerrobert gefastanimprovedmethodforotuassignmentbygeneralisingswarmsfastidiousclusteringapproach AT nebelmarkuse gefastanimprovedmethodforotuassignmentbygeneralisingswarmsfastidiousclusteringapproach |