Abstract
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 biologists comparing pairs of DNA or protein sequences. We prove that for two sequences of length
Citation
Richard Arratia. Michael S. Waterman. "A Phase Transition for the Score in Matching Random Sequences Allowing Deletions." Ann. Appl. Probab. 4 (1) 200 - 225, February, 1994. https://doi.org/10.1214/aoap/1177005208
Information