Skip navigation
Skip navigation

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

CollectionsANU Research Publications
Date published: 2007
Type: Journal article
Source: Journal of Applied Probability
DOI: 10.1239/jap/1189717545


File Description SizeFormat Image
01_Kantorovitz_Asymptotic_Behaviour_of__k_2007.pdf461.31 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator