Unknown

Dataset Information

Centroid based clustering of high throughput sequencing reads based on n-mer counts.


ABSTRACT:

Background

Many problems in computational biology require alignment-free sequence comparisons. One of the common tasks involving sequence comparison is sequence clustering. Here we apply methods of alignment-free comparison (in particular, comparison using sequence composition) to the challenge of sequence clustering.

Results

We study several centroid based algorithms for clustering sequences based on word counts. Study of their performance shows that using k-means algorithm with or without the data whitening is efficient from the computational point of view. A higher clustering accuracy can be achieved using the soft expectation maximization method, whereby each sequence is attributed to each cluster with a specific probability. We implement an open source tool for alignmen

SUBMITTER: Solovyov A 

PROVIDER: S-EPMC3848435 | biostudies-literature | 2013 Sep

REPOSITORIES: biostudies-literature