Asymptotic Behaviour of k -Word Matches Between Two Uniformly Distributed Sequences
Kantorovitz, Miriam; Booth, Hilary; Burden, Conrad; Wilson, Susan
Given two sequences of length n over a finite alphabet A of size \A\ = d, the D2 statistic is the number of k-letter word matches between the two sequences. This statistic is used in bioinformatics for EST sequence database searches. Under the assumption
|Collections||ANU Research Publications|
|Source:||Journal of Applied Probability|
|01_Kantorovitz_Asymptotic_Behaviour_of__k_2007.pdf||461.31 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator