mafft 7.123-1 source package in Ubuntu
Changelog
mafft (7.123-1) unstable; urgency=low * New upstream version. * Correct watch file, which was downloading the non-free version. This error did not affect the current stable release of Debian. * debian/tests/with-example-data: disable multithreading to stabilise output. -- Charles Plessy <email address hidden> Wed, 16 Oct 2013 08:22:20 +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 | Published | Component | Section | |
---|---|---|---|---|
Trusty | release | universe | science |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
mafft_7.123-1.dsc | 1.9 KiB | b2f953f835d835fcecb4a31787b474e66c60759ff5314330666239bf7bf51e51 |
mafft_7.123.orig.tar.gz | 371.0 KiB | 0757400411711406b1ead32fdc3f4d835d5cec9c888d075c9d9ef861ede204f7 |
mafft_7.123-1.debian.tar.gz | 5.9 KiB | 033e4516b40a90412ff20742d44579601e3de06f85eb4be71af2f198d90710df |
Available diffs
- diff from 6.940-1 to 7.123-1 (177.5 KiB)
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).