mafft 7.467-1 source package in Ubuntu

Changelog

mafft (7.467-1) unstable; urgency=medium

  * Team upload.
  * New upstream version

 -- Steffen Moeller <email address hidden>  Fri, 15 May 2020 13:15:02 +0200

Upload details

Uploaded by:
Debian Med on 2020-05-15
Uploaded to:
Sid
Original maintainer:
Debian Med
Architectures:
any
Section:
science
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Groovy release on 2020-05-15 universe science

Downloads

File Size SHA-256 Checksum
mafft_7.467-1.dsc 1.9 KiB a74276b489b21c717f7a14dc1c79796479c88792732136b44460b23941327922
mafft_7.467.orig.tar.gz 599.7 KiB 8ba90a3b098902f6b6bcaaa9287ff221e0d4811c94e5150cfd32d0f3229342b6
mafft_7.467-1.debian.tar.xz 7.1 KiB 7359695723f2ebe9a5a53dbe56121947a020545f1d9fd98070ef89671bee55a2

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