Iterative clustering method for metagenomic sequences

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Metagenomics studies microbial DNA of environmental samples. The sequencing tools produce a set of genome fragments providing a challenge for metagenomics to associate them with the corresponding phylogenetic group. To solve this problem there are binning methods, which are classified into two sequencing categories: similarity and composition. This paper proposes an iterative clustering method, which aim at achieving a low sensitivity of clusters. The approach consists of iteratively run k-means reducing the training data in each step. Selection of data for next iteration depends on the result obtained in the previous, which is based on the compactness measure. The final performance clustering is evaluated according with the sensitivity of clusters. The results demonstrate that proposed model is better than the simple k-means for metagenome databases.

Cite

CITATION STYLE

APA

Bonet, I., Montoya, W., Mesa-Múnera, A., & Alzate, J. F. (2014). Iterative clustering method for metagenomic sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8891, pp. 145–154). Springer Verlag. https://doi.org/10.1007/978-3-319-13817-6_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free