Ubuntu
mafft package

mafft 7.429-1 source package in Ubuntu

Changelog

mafft (7.429-1) unstable; urgency=medium

  * Team upload.
  * New upstream version
  * debhelper-compat 12
  * Created with routine-update script.
  * Standards-Version: 4.4.0

 -- Steffen Moeller <email address hidden>  Sat, 27 Jul 2019 12:56:27 +0200

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.429-1.dsc 1.9 KiB 15ecfa07a68cb140a794d8dfc166e09edfca6ab0f5be2341006e3485d7f640b2
mafft_7.429.orig.tar.gz 590.8 KiB 6e22e0d6130862c67233ab3a13a70febf7f5a1e0a8ab0d73420ca70496b167bc
mafft_7.429-1.debian.tar.xz 6.4 KiB d0d63d2fc2a7e812e7d59bf7a9f482eab8ef48923e71e451f9405fd048f09920

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).

mafft-dbgsym: debug symbols for mafft