Global pairwise sequence alignment

Description

Needleman-Wunsch rapid global alignment of two sequences

This tool runs EMBOSS command stretcher that calculates an optimal global alignment of two sequences using a memory efficient, Myers-Miller, version of the classic Needleman-Wunsch dynamic programming algorithm. The output is a standard alignment file. The substitution matrix, gap insertion penalty and gap extension penalties used to calculate the alignment may be specified.

The input sequences can be in any of the EMBOSS compatible sequence formats.

For more details, please check the manual page of stretcher command.

Output

Output is either an alignment report of sequence alignment file.