Abstract
ABSTRACT
We determine the asymptotic limiting probability as m → ∞ that a random string of length m over some alphabet ∑ 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.
Get full access to this article
View all access options for this article.