fasttree 2.1.10-2 source package in Ubuntu

Changelog

fasttree (2.1.10-2) unstable; urgency=medium

  [ Steffen Moeller ]
  * debian/upstream/metadata:
    - yamllint cleanliness
    - added references to registries
  * Bump Standards-Version to 4.1.0, no further changes

  [ Andreas Tille ]
  * Provide alternative name FastTree since some applications do expect
    this name
  * debhelper 11
  * Point Vcs fields to salsa.debian.org
  * Standards-Version: 4.2.1

 -- Andreas Tille <email address hidden>  Mon, 24 Sep 2018 14:54:17 +0200

Upload details

Uploaded by:
Debian Med on 2018-09-24
Uploaded to:
Sid
Original maintainer:
Debian Med
Architectures:
any
Section:
science
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Disco release on 2018-11-10 universe science

Downloads

File Size SHA-256 Checksum
fasttree_2.1.10-2.dsc 2.0 KiB 36f0901c2d761db2dd20d2e4a08fc7628b70cd2a90cb24fb695ef87ca03a9b86
fasttree_2.1.10.orig.tar.xz 92.9 KiB 51a6d4e86176786b25da6e01dc0e8f212fe794e3ed7f5e109134043cf1f13c4a
fasttree_2.1.10-2.debian.tar.xz 33.0 KiB d7732ac2716a898f0a5904295a202e343dc82b297d84f6ed60618e913c684981

Available diffs

No changes file available.

Binary packages built by this source

fasttree: phylogenetic trees from alignments of nucleotide or protein sequences

 FastTree infers approximately-maximum-likelihood phylogenetic trees from
 alignments of nucleotide or protein sequences. It handles alignments
 with up to a million of sequences in a reasonable amount of time and
 memory. For large alignments, FastTree is 100-1,000 times faster than
 PhyML 3.0 or RAxML 7.
 .
 FastTree is more accurate than PhyML 3 with default settings, and much
 more accurate than the distance-matrix methods that are traditionally
 used for large alignments. FastTree uses the Jukes-Cantor or generalized
 time-reversible (GTR) models of nucleotide evolution and the JTT
 (Jones-Taylor-Thornton 1992) model of amino acid evolution. To account
 for the varying rates of evolution across sites, FastTree uses a single
 rate for each site (the "CAT" approximation). To quickly estimate the
 reliability of each split in the tree, FastTree computes local support
 values with the Shimodaira-Hasegawa test (these are the same as PhyML 3's
 "SH-like local supports").
 .
 This package contains a single threaded version (fasttree) and a
 parallel version which uses OpenMP (fasttreMP).

fasttree-dbgsym: debug symbols for fasttree