title: On the length of the longest exact position match in a random sequence.
abstract: A mixed Poisson approximation and a Poisson approximation for the length of the longest exact match of a random sequence across another sequence are provided, where the match is required to start at position 1 in the first sequence. This problem arises when looking for suitable anchors in whole genome alignments.
authors.affiliation: Keble College and Department of Statistics, University of Oxford, UK. reinert@stats ox.ac.uk
authors.forename: Gesine
authors.initials: G
authors.lastname: Reinert
authors.forename: Michael S
authors.initials: MS
authors.lastname: Waterman
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods; D015233:Models, Statistical; D016415:Sequence Alignment / Q000379:methods / Q000706:statistics & numerical data*