Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
0 answers
297 views

Sequence Alignment with general gap penalties: proof of optimal substructure

I am very well-aware of how optimal substructure for pairwise global sequence alignment using the Needleman-Wunsch algorithm works. However, I have merely seen hand-waving explanations for the ...
Andrea Russett's user avatar