Abstract:
A computer algorithm for restriction-site mapping consists of a generator of partial maps and a consistency checker. Restriction-site mapping involves locating certain restriction sites on a circular plasmid, on a linear phage or on some other sequence of DNA. This paper examines consistency checking and argues that a method based on separation theory extracts the maximum amount of information from fragment lengths in digest data. It results in the minimum number of false maps being generated. This paper examines the problem of placing the strongest constraints that can be deduced from the experimental data, on maps being generated by
…………….So on ..........(download any of the following links to get complete paper presentation in word document)
Ziddu Link
Uploaded.to Link
Mediafire Link
Adrive Link
Rapidshare Link
No comments:
Post a Comment