On the length of the longest exact position match in a random sequence.
- 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.
- Publication status:
- Publisher copy:
- IEEE/ACM transactions on computational biology and bioinformatics / IEEE, ACM
- Publication date:
- Source identifiers:
- Copyright date:
If you are the owner of this record, you can report an update to it here: Report update to this record