Ubuntu
kmc package

kmc 3.2.2+dfsg-1 source package in Ubuntu

Changelog

kmc (3.2.2+dfsg-1) unstable; urgency=medium

  * New upstream version
  * Standards-Version: 4.6.2 (routine-update)
  * Use secure URI in Homepage field.
  * use-shared-libs patch: refresh; forward not-needed.
  * makefile.patch: refresh; forwarding not-needed.
  * disable-python-bindings.patch: refresh.
  * simde patch: refresh.
  * support-mixed-march.patch: refresh.
  * gcc-13.patch: new: fix build failures with gcc-13. (Closes: #1037708)

 -- Étienne Mollier <email address hidden>  Mon, 17 Jul 2023 12:35:26 +0200

Upload details

Uploaded by:
Debian Med
Uploaded to:
Sid
Original maintainer:
Debian Med
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Mantic release universe misc

Downloads

File Size SHA-256 Checksum
kmc_3.2.2+dfsg-1.dsc 2.3 KiB 6b0f9040b4a940bd1e47d1ff859ee7ea6b36ca65879fdfffcc1d8f30a1404dc5
kmc_3.2.2+dfsg.orig.tar.xz 398.7 KiB a6a489733333902f3e19bf5f6eec4a7b81f438c1b5ece65e4686b7aef41b1f36
kmc_3.2.2+dfsg-1.debian.tar.xz 32.2 KiB f984a082fa8b99ce640da243a16f7bbec0f693f4e570fca02cb789504ca9eafd

Available diffs

No changes file available.

Binary packages built by this source

kmc: count kmers in genomic sequences

 The kmc software is designed for counting k-mers (sequences of
 consecutive k symbols) in a set of reads. K-mer counting is
 important for many bioinformatics applications, e.g. developing de Bruijn
 graph assemblers.
 .
 Building de Bruijn graphs is a commonly used approach for genome
 assembly with data from second-generation sequencing.
 Unfortunately, sequencing errors (frequent in practice)
 result in huge memory requirements for de Bruijn graphs, as well
 as long build time. One of the popular approaches to handle this
 problem is filtering the input reads in such a way that unique k-mers
 (very likely obtained as a result of an error) are discarded.
 .
 Thus, KMC scans the raw reads and produces a compact representation
 of all non-unique reads accompanied with number of their occurrences.
 The algorithm implemented in KMC makes use mostly of disk space rather
 than RAM, which allows one to use KMC even on rather typical personal
 computers. When run on high-end servers (what is necessary for KMC
 competitors) it outperforms them in both memory requirements and
 speed of computation. The disk space necessary for computation is in
 order of the size of input data (usually it is smaller).

kmc-dbgsym: debug symbols for kmc
libkmc-dev: library to access KMC k-mer count files

 The kmc software is designed for counting k-mers (sequences of
 consecutive k symbols) in a set of reads. K-mer counting is
 important for many bioinformatics applications, e.g. developing de Bruijn
 graph assemblers.
 .
 This package contains the C++ library headers for accessing kmc's output
 file format.