mafft 7.270-1 source package in Ubuntu
Changelog
mafft (7.270-1) unstable; urgency=medium * New upstream version -- Andreas Tille <email address hidden> Wed, 30 Dec 2015 19:52:50 +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 | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
mafft_7.270-1.dsc | 1.9 KiB | ad2c6277f52087b7e9ea5da7852a523c96cd17df93afe71743d21d7ac3579694 |
mafft_7.270.orig.tar.gz | 425.5 KiB | a66b95fb56ba7c9d71daa4426f3a7319048db11d85fe4fdaff3b88a6dc87cdd8 |
mafft_7.270-1.debian.tar.xz | 6.4 KiB | 8798c2bc123f0f899aa458746d0138c1c79469915e0b2287d08d9342552a62b5 |
Available diffs
- diff from 7.266-1 to 7.270-1 (15.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).