Ubuntu
mafft package

mafft 7.307-1 source package in Ubuntu

Changelog

mafft (7.307-1) unstable; urgency=medium

  * New upstream version
  * debhelper 10
  * update d/copyright
  * d/watch: version=4

 -- Andreas Tille <email address hidden>  Mon, 09 Jan 2017 15:58:36 +0100

Upload details

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

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
mafft_7.307-1.dsc 1.9 KiB 3cef033e7499bc96282721515df9ea952d5fa92987e86527cdbd9fae92df1ffa
mafft_7.307.orig.tar.gz 448.4 KiB 53334006823fa3f3537b7553f7809d825f6e2d4bafba5a140772accc7ea8068a
mafft_7.307-1.debian.tar.xz 6.4 KiB 55f796de3cd1abf0a16738def2a865fdd8459b453a2fb5ea2edbedfb470dc4bf

Available diffs

No changes file available.

Binary packages built by this source

mafft: Multiple alignment program for amino acid or nucleotide sequences

 MAFFT is a multiple sequence alignment program which offers three
 accuracy-oriented methods:
  * L-INS-i (probably most accurate; recommended for <200 sequences;
    iterative refinement method incorporating local pairwise alignment
    information),
  * G-INS-i (suitable for sequences of similar lengths; recommended for
    <200 sequences; iterative refinement method incorporating global
    pairwise alignment information),
  * E-INS-i (suitable for sequences containing large unalignable regions;
    recommended for <200 sequences),
 and five speed-oriented methods:
  * FFT-NS-i (iterative refinement method; two cycles only),
  * FFT-NS-i (iterative refinement method; max. 1000 iterations),
  * FFT-NS-2 (fast; progressive method),
  * FFT-NS-1 (very fast; recommended for >2000 sequences; progressive
    method with a rough guide tree),
  * NW-NS-PartTree-1 (recommended for ∼50,000 sequences; progressive
    method with the PartTree algorithm).