论文信息 - The Probability of Unique Solutions of Sequencing by Hybridization

The Probability of Unique Solutions of Sequencing by Hybridization

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.

[1] A D Mirzabekov,et al. [DNA sequencing by hybridization with oligonucleotides immobilized in a gel. Chemical ligation as a method of expanding the prospects for the method]. , 1994, Molekuliarnaia biologiia.

[2] Esko Ukkonen,et al. Approximate String Matching with q-grams and Maximal Matches , 1992, Theor. Comput. Sci..

[3] P. Pevzner,et al. Improved chips for sequencing by hybridization. , 1991, Journal of biomolecular structure & dynamics.

[4] Richard M. Karp,et al. Mapping the genome: some combinatorial problems arising in molecular biology , 1993, STOC.

[5] R. Drmanac,et al. Sequencing of megabase plus DNA by hybridization: theory of the method. , 1989, Genomics.

[6] Lee Aaron Newberg,et al. Physical mapping of chromosomes: A combinatorial problem in molecular biology , 1995, SODA '93.

[7] Stephen Suen,et al. A correlation inequality and a Poisson limit theorem for nonoverlapping balanced subgraphs of a random graph , 1990, Random Struct. Algorithms.

[8] W. Bains,et al. A novel method for nucleic acid sequence determination. , 1988, Journal of theoretical biology.

[9] P. Pevzner. 1-Tuple DNA sequencing: computer analysis. , 1989, Journal of biomolecular structure & dynamics.