Ubuntu
mafft package

mafft 7.123-1ubuntu1 source package in Ubuntu

Changelog

mafft (7.123-1ubuntu1) trusty; urgency=low

  * debian/tests/with-example-data: Don't write progress to stderr on success.
 -- Martin Pitt <email address hidden>   Tue, 29 Oct 2013 11:29:22 +0100

Upload details

Uploaded by:
Martin Pitt
Uploaded to:
Trusty
Original maintainer:
Ubuntu Developers
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.123.orig.tar.gz 371.0 KiB 0757400411711406b1ead32fdc3f4d835d5cec9c888d075c9d9ef861ede204f7
mafft_7.123-1ubuntu1.debian.tar.gz 5.9 KiB bc510e5d360d217284e2141eec5f3ce9ad5556445f203da6d896aa7d6267e487
mafft_7.123-1ubuntu1.dsc 2.0 KiB 794d83859c98fd964413882e881464cccd9b0c517a86ac1e59bcc76947b0b7ca

View changes file

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