3
votes
1answer
359 views

Cover a line segment randomly with smaller line segments

Covering a circle randomly with arcs has been well studied in the past (Geometric Probability - Solomon). But the problem when the circle is changed to a line segment doesn't seem to have been ...
5
votes
3answers
347 views

MicroArray, tesing if a sample is the same with high variance data.

I'll explain the problem but what I am looking for is a few suggested methods to approach this problem. You don't need to know what a microarray but if you are interested look here link text The info ...
4
votes
2answers
949 views

Correspondence between Viterbi algorithm and Smith-Waterman

Viterbi is an algorithm for finding the maximum likelihood assignment to the hidden variables of an HMM, given the observed variables (we know the transition and emission probabilities of the HMM). ...