We consider a sequence matching problem involving the optimal alignment score for contiguous subsequences, rewarding matches and penalizing for deletions and mismatches. This score is used by ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback