Fft-Ns-I In Mafft
2
0
Entering edit mode
10.0 years ago

In the MAFFT paper what does FFT-NS-i stand for?

I understand it's an iterative refinement method. FFT must be Fast Fourier transform. i must be iterative, but what is "NS"?

• 2.8k views
ADD COMMENT
1
Entering edit mode
10.0 years ago
Andreas ★ 2.5k

Not sure what the abbreviation is actually supposed to mean, but it directly translates into the retree (tree iteration) option, i.e. NS2 is --retree 2. This table shows a list of all names and commands that are actually used.

Andreas

ADD COMMENT
1
Entering edit mode
9.3 years ago
pinocchio964 ▴ 10

Using the FFT algorithm and the normalized similarity matrix described above, input sequences are progressively aligned following the branching order of sequences in the guide tree. This method is hereafter referred to as FFT-NS-1.

So... NS means normalized similarity matrix. I think what it is maybe similar to Gramian matrix in linear algebra.

ADD COMMENT

Login before adding your answer.

Traffic: 2166 users visited in the last hour
Help About
FAQ
Access RSS
API
Stats

Use of this site constitutes acceptance of our User Agreement and Privacy Policy.

Powered by the version 2.3.6