360 likes | 531 Views
Mid-labeled Partial Digest. Student : 蕭禕廷 Advisor : 傅恆霖 教授. Contents. 1. Introduction 2. Partial Digest 3. Mid-labeled Partial Digest. 1. Introduction. DNA. T C A G G T C A C A. A G T C C A G T G T. Restriction Enzyme ( 限制內切酶 ). EcoRI. G A A T T C. C T T A A G.
E N D
Mid-labeled Partial Digest Student: 蕭禕廷 Advisor: 傅恆霖 教授
Contents • 1. Introduction • 2. Partial Digest • 3. Mid-labeled Partial Digest
DNA T C A G G T C A C A A G T C C A G T G T
Restriction Enzyme (限制內切酶) EcoRI G A A T TC C T T A AG
Restriction Sites(切位) EcoRI G A A T TC G A A T TC G A A T TC C T T A AG C T T A AG C T T A AG Restriction Sites
Partial DigestProblem • Partial digestproblemis to find , by knowing .
Partial DigestProblemAlgorithm • Skiena et al.gave an algorithm
Partial DigestProblemAlgorithm • Each node needs time. • The total cost is . ?
Mid-Labeled Partial Digest partial digest
Mid-Labeled Partial Digest • , • contains exactly labels
* $ $
$ $ $ $ * $ $
Mid-Labeled Partial Digest Algorithm $ done ?
Mid-Labeled Partial Digest Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . .
Mid-Labeled Partial Digest Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . .
Mid-Labeled Partial Digest Algorithm • Each node needs . • The total time is • . Stirling`s approximation : The total time is
Conclusion • For partial digest problem, Skiena et al.gave an algorithm. • For mid-labeled partial digest problem, there is an algorithm for adding labels inside DNA. • for .
References • T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, Second Edition, 2001. • B. Lewin, Genes VII, 2000. • S. S. Skiena, W. D. Smith and P. Lemke, Reconstructing Sets From Interpoint Distances, SOCG, 1990. • D. B. West, Introduction to graph theory, 1996.