gubbins 1.4.5-1 source package in Ubuntu

Changelog

gubbins (1.4.5-1) unstable; urgency=medium

  * New upstream version
  * Secure Vcs-Git

 -- Andreas Tille <email address hidden>  Wed, 27 Jan 2016 19:53:33 +0100

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
Xenial release universe misc

Downloads

File Size SHA-256 Checksum
gubbins_1.4.5-1.dsc 2.1 KiB 944b80e4ab82cf5e54c3862b1ebd690b53343cd90ac86763d62c79667ca7ceba
gubbins_1.4.5.orig.tar.gz 312.4 KiB 89249278750a15223133a76517c73de34270600c31d3e7847a37095d489cb62b
gubbins_1.4.5-1.debian.tar.xz 4.9 KiB 9ad9de6b28658ce984bb207df9358d87cfa19c5b112240c9565a0a346d199fef

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.