mafft 7.487-1 source package in Ubuntu
Changelog
mafft (7.487-1) unstable; urgency=medium * New upstream version 7.487 -- Nilesh Patra <email address hidden> Mon, 16 Aug 2021 23:33:09 +0530
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.487-1.dsc | 2.0 KiB | 8596a4be99f64ba6b92c3f7eba6d76bdf857258abe9985dbf41c138cb0628994 |
| mafft_7.487.orig.tar.gz | 591.0 KiB | ed93ef12b0aee497a4afa0bf429117b0f7cbdd65f76551a686de581b4008c879 |
| mafft_7.487-1.debian.tar.xz | 6.9 KiB | 58f9a8e5fa0a16d22b1c7944ec5ef468ab93dfcd544feed510380c0f1f036b5b |
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).
