2 ms·
Yes, for pairwise sequence alignment. The globally optimized multiple sequence alignment problem is NP-complete.
by dalke 14y ago
Yes, for pairwise sequence alignment. The globally optimized multiple sequence alignment problem is NP-complete.
2 ms·