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"?

Fft-Ns-I In Mafft

0

Entering edit mode

10.0 years ago

Aleksandr Levchuk
3.2k

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"?

1

Entering edit mode

9.3 years ago

pinocchio964
▴
10

Using the FFT algorithm and the

normalized similarity matrixdescribed 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.

Similar Posts

Loading Similar Posts

Traffic: 2166 users visited in the last hour

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