mafft 7.453-1 source package in Ubuntu
Changelog
mafft (7.453-1) unstable; urgency=medium * Team upload. * New upstream version * Standards-Version: 4.4.1 * Trim trailing whitespace. * Use secure URI in Homepage field. * Set fields Upstream-Name, Upstream-Contact in debian/copyright. * Remove obsolete fields Name, Contact from debian/upstream/metadata. -- Steffen Moeller <email address hidden> Thu, 21 Nov 2019 17:27:17 +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 | |
---|---|---|---|---|
Focal | release | universe | science |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
mafft_7.453-1.dsc | 1.9 KiB | 35df510336103de5205946f4b8939c26ba87f7ce5905f3456cb9fed503db0897 |
mafft_7.453.orig.tar.gz | 598.1 KiB | 4c05dfc4d173c9a139fcaa9373fbc2c8d6a59f410a7971f7acc6268be628b1f9 |
mafft_7.453-1.debian.tar.xz | 6.5 KiB | a84ae8eb57f4058ebd46987bf7fa0732536d0c55551917f57e31a56ad1569196 |
Available diffs
- diff from 7.429-1 to 7.453-1 (22.8 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).
- mafft-dbgsym: No summary available for mafft-dbgsym in ubuntu groovy.
No description available for mafft-dbgsym in ubuntu groovy.