Ontology highlight
ABSTRACT: Motivation
Many bioinformatics algorithms are designed for the analysis of sequences of some uniform length, conventionally referred to as k -mers. These include de Bruijn graph assembly methods and sequence alignment tools. An efficient algorithm to enumerate the number of unique k -mers, or even better, to build a histogram of k -mer frequencies would be desirable for these tools and their downstream analysis pipelines. Among other applications, estimated frequencies can be used to predict genome sizes, measure sequencing error rates, and tune runtime parameters for analysis tools. However, calculating a k -mer histogram from large volumes of sequencing data is a challenging task.Results
Here, we present ntCard, a streaming algorithm for estimating the frequencies of k -m
SUBMITTER: Mohamadi H
PROVIDER: S-EPMC5408799 | biostudies-literature | 2017 May
REPOSITORIES: biostudies-literature