Dyer M, Frieze A, Suen S
Department of Mathematics, Carnegie Mellon University, Pittsburgh, PA 15213, USA.
J Comput Biol. 1994 Summer;1(2):105-10. doi: 10.1089/cmb.1994.1.105.
We determine the asymptotic limiting probability as m-->infinity that a random string of length m over some alphabet sigma can be determined uniquely by its substrings of length l. This is an abstraction of a problem faced when trying to sequence DNA clones by SBH.
我们确定当(m\to\infty)时,在某个字母表(\sigma)上长度为(m)的随机字符串可由其长度为(l)的子串唯一确定的渐近极限概率。这是通过SBH对DNA克隆进行测序时所面临问题的一种抽象。