gubbins 2.2.0-1 source package in Ubuntu

Changelog

gubbins (2.2.0-1) unstable; urgency=medium

  * Team upload.
  * New upstream release.

 -- Sascha Steinbiss <email address hidden>  Thu, 03 Nov 2016 15:25:15 +0100

Upload details

Uploaded by:
Debian Med on 2016-11-03
Uploaded to:
Sid
Original maintainer:
Debian Med
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Artful release on 2017-04-20 universe misc
Zesty release on 2016-11-04 universe misc

Downloads

File Size SHA-256 Checksum
gubbins_2.2.0-1.dsc 2.1 KiB 1fbd76fadc8e7aa952bdac58ecd1bb04740ef1285ba275e0a8773acb7774afd6
gubbins_2.2.0.orig.tar.gz 314.3 KiB 245bc70d05b9f0f3ea10e6a20203ac049d1b912c1af8cf9b90763fd38e148cb2
gubbins_2.2.0-1.debian.tar.xz 5.9 KiB a1b8d8fe50723594ee5ea9cb95dc791ebf33d916d67cb120779214977930c529

Available diffs

No changes file available.

Binary packages built by this source

gubbins: phylogenetic analysis of genome sequences

 Gubbins supports rapid phylogenetic analysis of large samples of
 recombinant bacterial whole genome sequences.
 .
 Gubbins (Genealogies Unbiased By recomBinations In Nucleotide
 Sequences) is an algorithm that iteratively identifies loci containing
 elevated densities of base substitutions while concurrently constructing
 a phylogeny based on the putative point mutations outside of these
 regions. Simulations demonstrate the algorithm generates highly accurate
 reconstructions under realistic models of short-term bacterial
 evolution, and can be run in only a few hours on alignments of hundreds
 of bacterial genome sequences.

gubbins-dbgsym: debug symbols for package gubbins

 Gubbins supports rapid phylogenetic analysis of large samples of
 recombinant bacterial whole genome sequences.
 .
 Gubbins (Genealogies Unbiased By recomBinations In Nucleotide
 Sequences) is an algorithm that iteratively identifies loci containing
 elevated densities of base substitutions while concurrently constructing
 a phylogeny based on the putative point mutations outside of these
 regions. Simulations demonstrate the algorithm generates highly accurate
 reconstructions under realistic models of short-term bacterial
 evolution, and can be run in only a few hours on alignments of hundreds
 of bacterial genome sequences.