The Probability of Unique Solutions of Sequencing by Hybridization
- 1 January 1994
- journal article
- Published by Mary Ann Liebert Inc in Journal of Computational Biology
- Vol. 1 (2) , 105-110
- https://doi.org/10.1089/cmb.1994.1.105
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Approximate string-matching with q-grams and maximal matchesTheoretical Computer Science, 1992
- Improved Chips for Sequencing by HybridizationJournal of Biomolecular Structure and Dynamics, 1991
- A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graphRandom Structures & Algorithms, 1990
- l-Tuple DNA Sequencing: Computer AnalysisJournal of Biomolecular Structure and Dynamics, 1989
- Sequencing of megabase plus DNA by hybridization: Theory of the methodGenomics, 1989
- A novel method for nucleic acid sequence determinationJournal of Theoretical Biology, 1988