Ubuntu
mafft package

mafft 7.266-1 source package in Ubuntu

Changelog

mafft (7.266-1) unstable; urgency=medium

  * New upstream version
  * Fix bashism
    Closes: #772305

 -- Andreas Tille <email address hidden>  Sat, 05 Dec 2015 23:44:00 +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.266-1.dsc 1.9 KiB a28454673811923119ef49714f9cbd14504f85a56f2cd68c7b30a3004a4f8f30
mafft_7.266.orig.tar.gz 430.2 KiB 59d4921e13377bb2c8e1f0a007e94b3e698e2c546ce8facc9daa530bc673e707
mafft_7.266-1.debian.tar.xz 6.4 KiB e414190c1f4c600739197c361ca0aa48215e0a9f04c42ac7e0e5b5becfef29da

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