| Summary: | 碩士 === 中原大學 === 資訊工程學系 === 85 === In this thesis, we implement Fragment Assembly [6] and Double Digest[7] algorithms, which are proposed by Shih-Ping Tung, and Coding Region Prediction [5] algorithm proposed by S.M.Ossadnik, the implementation language is C++, and analyze their performance using test results.
Fragment Assembly algorithm is to assemble the segments of a DNA sequence, which are cut by two different restriction enzymes and sequencing, then use ASSEMBLER algorithm to compute the correct sequence of the DNA. The ENZYME algorithm can find a suitable second enzyme. Therefore, the problem of DNA sequence assembly can be solved in linear time.
Double Digest algorithm use the length of the segments, which are measured by get electrophoresis, to construct a bicolor double digest graph. Then the alternating Hamiltonian paths are found to obtain complete DNA sequence.
Coding Region Prediction is based on the observation that long-range correlations exist in noncoding sequences and short-range correlations exist in coding sequences. Coding Sequence Finder algorithm uses this to predict coding regions of a DNA sequence by computing the correlation a moving window.
|
|---|
