fitgcp 0.0.20150429-2 source package in Ubuntu

Changelog

fitgcp (0.0.20150429-2) unstable; urgency=medium

  * debhelper 11
  * Point Vcs fields to salsa.debian.org
  * Standards-Version: 4.2.0
  * Remove ancient field X-Python-Version
  * Add dh-python to Build-Depends

 -- Andreas Tille <email address hidden>  Fri, 17 Aug 2018 16:26:41 +0200

Upload details

Uploaded by:
Debian Med on 2018-08-17
Uploaded to:
Sid
Original maintainer:
Debian Med
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Disco release on 2018-10-30 universe misc
Cosmic release on 2018-08-22 universe misc

Downloads

File Size SHA-256 Checksum
fitgcp_0.0.20150429-2.dsc 1.9 KiB 62ec1a147297439a735f4e4435ed100ae7cbc04cce2307768a69344b1270055f
fitgcp_0.0.20150429.orig.tar.xz 8.2 KiB f18c9c2155dcf7eaf0bedd349d6accbe051110a6958478fcb58507cfa062390e
fitgcp_0.0.20150429-2.debian.tar.xz 4.7 KiB aff9c8e829ec764575b5d7f05c93c9c8190ab5068d3db5b421dac4a43cd44ab1

Available diffs

No changes file available.

Binary packages built by this source

fitgcp: fitting genome coverage distributions with mixture models

 Genome coverage, the number of sequencing reads mapped to a position in
 a genome, is an insightful indicator of irregularities within sequencing
 experiments. While the average genome coverage is frequently used within
 algorithms in computational genomics, the complete information available
 in coverage profiles (i.e. histograms over all coverages) is currently
 not exploited to its full extent. Thus, biases such as fragmented or
 erroneous reference genomes often remain unaccounted for. Making this
 information accessible can improve the quality of sequencing experiments
 and quantitative analyses.
 .
 fitGCP is a framework for fitting mixtures of probability distributions
 to genome coverage profiles. Besides commonly used distributions, fitGCP
 uses distributions tailored to account for common artifacts. The mixture
 models are iteratively fitted based on the Expectation-Maximization
 algorithm.