Research any topic before you write.
Find related topics. | Discover entities. | See connections. | Build a topical map.
In bioinformatics, MAFFT (multiple alignment using fast Fourier transform) is a program used to create multiple sequence alignments of amino acid or nucleotide sequences. Published in 2002, the first version used an algorithm based on progressive alignment, in which the sequences were clustered with the help of the fast Fourier transform. Subsequent…
History, Accuracy and results & Algorithm
Explore the main themes, entities and connections around MAFFT. Start with the topic map, then use the sections below for research and deeper semantic analysis.
Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.
High-confidence facts extracted from structured source data. Use them as anchors for further research.
Browse the full topic structure. Each item opens a new analysis centered on that subject.
Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.
See the strongest relationship patterns around the current topic before diving into the raw triples.
Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.
alignment sequences sequence algorithm alignments accuracy multiple time algorithms used complexity gap using fast fourier transform scoring guide distance tree
| Subject | Predicate | Object | Confidence | Src |
|---|---|---|---|---|
| MAFFT | Developer | Kazutaka Katoh | 1.00 | infobox |
| MAFFT | Licence | BSD, GPL, others | 1.00 | infobox |
| MAFFT | Operating system | Unix, Linux, Mac, Windows | 1.00 | infobox |
| MAFFT | Release | 2002; 24 years ago (2002) | 1.00 | infobox |
| MAFFT | Stable release | 7.526 / April 2024; 2 years ago (2024-04) | 1.00 | infobox |
| MAFFT | Type | Bioinformatics tool | 1.00 | infobox |
| MAFFT | Website | mafft.cbrc.jp/alignment/software | 1.00 | infobox |
| MAFFT | Written in | C | 1.00 | infobox |
| ClustalW | instance of | studies have shown that MAFFT performs exceptionally well when compared to other popular algorithms | 0.80 | text |
| T-Coffee | instance of | studies have shown that MAFFT performs exceptionally well when compared to other popular algorithms | 0.80 | text |
| particularly for larger datasets | instance of | studies have shown that MAFFT performs exceptionally well when compared to other popular algorithms | 0.80 | text |
| sequences with high degrees of divergence | instance of | studies have shown that MAFFT performs exceptionally well when compared to other popular algorithms | 0.80 | text |
These clusters group vocabulary that occurs around closely connected concepts in the source material.
Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.