Ubuntu
mafft package

mafft 6.940-1 source package in Ubuntu

Changelog

mafft (6.940-1) unstable; urgency=low


  [ Charles Plessy ]
  * New upstream release (no new license nor copyright statement).
  * Removed unnecessary build-dependance on quilt.
  * Test for regressions with autopkgtest insted of doing it at build time.
    (debian/control, debian/tests/control, debian/tests/with-example-data)
  * debian/control:
    - Removed 'Pre-Depends: dpkg (>= 1.15.6)' now that Ubuntu LTS 12.04 is out.
    - Increment Standards-Version to show conformance with Policy 3.9.4.
    - Removed DM-Upload-Allowed field.
    - Normalised with the command cme fix dpkg-control.
    - Use Debhelper 9 (also debian/compat).
  * Pass dpkg build flags in debian/rules.

  [ Andreas Tille ]
  * debian/upstream:
     - Single Reference field instead of Reference-*
     - Add additional reference from tasks file
     - Authors in BibTeX conform format

 -- Charles Plessy <email address hidden>  Sun, 14 Oct 2012 15:42:54 +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_6.940-1.dsc 1.9 KiB 3dfbaaa3724f6c300109c9bb0fa19fca13e1fe3540c8355161e29f6c0bdd1a1b
mafft_6.940.orig.tar.gz 357.9 KiB d941d9a4814274ae9e76b306d6613b8e28b8133f4172fcc1f63c3e0cf4ab42bc
mafft_6.940-1.debian.tar.gz 5.6 KiB e5f4ec06c48a24d3e5d5ce81eb767acbb5f82053f3b918488107608a59a5590a

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