SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:kth-176956"
 

Search: onr:"swepub:oai:DiVA.org:kth-176956" > ARK :

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

ARK : Aggregation of Reads by K-Means for Estimation of Bacterial Community Composition

Koslicki, David (author)
Chatterjee, Saikat (author)
KTH,Kommunikationsteori
Shahrivar, Damon (author)
show more...
Walker, Alan W. (author)
Francis, Suzanna C. (author)
Fraser, Louise J. (author)
Vehkaperae, Mikko (author)
Lan, Yueheng (author)
Corander, Jukka (author)
show less...
 (creator_code:org_t)
2015-10-23
2015
English.
In: PLOS ONE. - : PUBLIC LIBRARY SCIENCE. - 1932-6203. ; 10:10
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • Motivation Estimation of bacterial community composition from high-throughput sequenced 16S rRNA gene amplicons is a key task in microbial ecology. Since the sequence data from each sample typically consist of a large number of reads and are adversely impacted by different levels of biological and technical noise, accurate analysis of such large datasets is challenging. Results There has been a recent surge of interest in using compressed sensing inspired and convex-optimization based methods to solve the estimation problem for bacterial community composition. These methods typically rely on summarizing the sequence data by frequencies of low-order k-mers and matching this information statistically with a taxonomically structured database. Here we show that the accuracy of the resulting community composition estimates can be substantially improved by aggregating the reads from a sample with an unsupervised machine learning approach prior to the estimation phase. The aggregation of reads is a pre-processing approach where we use a standard K-means clustering algorithm that partitions a large set of reads into subsets with reasonable computational cost to provide several vectors of first order statistics instead of only single statistical summarization in terms of k-mer frequencies. The output of the clustering is then processed further to obtain the final estimate for each sample. The resulting method is called Aggregation of Reads by K-means (ARK), and it is based on a statistical argument via mixture density formulation. ARK is found to improve the fidelity and robustness of several recently introduced methods, with only a modest increase in computational complexity. Availability An open source, platform-independent implementation of the method in the Julia programming language is freely available at https://github.com/dkoslicki/ARK. A Matlab implementation is available at http://www.ee.kth.se/ctsoftware.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Signalbehandling (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Signal Processing (hsv//eng)

Keyword

Split Vector Quantization
LSF Parameters
Sequences
Megan

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

  • PLOS ONE (Search for host publication in LIBRIS)

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view