Ubuntu
mafft package

mafft 7.130-1 source package in Ubuntu

Changelog

mafft (7.130-1) unstable; urgency=low


  * New upstream release.
  * Correct ‘XS-Testsuite’ to ‘Testsuite’ in debian/control.

 -- Charles Plessy <email address hidden>  Sun, 19 Jan 2014 08:25:50 +0900

Upload details

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

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
mafft_7.130-1.dsc 1.9 KiB 97ea0e008b2ff5ebec3433f485af21be4d9b201c9eeb688a004ebac97ffc858a
mafft_7.130.orig.tar.gz 377.8 KiB 152603c018bfa66633dbfca9e7d01e67c14de37811701b980fbc021d861975e4
mafft_7.130-1.debian.tar.xz 5.6 KiB 0fda5583715310d13fd230d1f5ec67097542a9e32259fedecb4eac101add0818

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