Exons are expression DNA sequences. A DNA sequence which includes gene has exons and introns. During transcription and translation, introns will be removed, and exons will remain to become protein. Many researchers need exon primers for PCR experiments. However, it is a difficult to find that many exon primers satisfy all primer design constraints at the same time. Here, we proposed an efficient exon primer design algorithm. The algorithm applies multiobjective genetic algorithm (MGA) instead of the single objective algorithm which can easily lend to unsuitable solutions. And a hash-index algorithm is applied to make specificity checking in a reasonable time. The algorithm has tested by a variety of mRNA sequences. These dry dock experiments show that our proposed algorithm can find primers which satisfy all exon primer design constraints.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0829105-165900 |
| Date | 29 August 2005 |
| Creators | Huang, Erh-chien |
| Contributors | Chungnan Lee, Chang-Biau Yang, Shiue, Yow-Ling, Shinn-ying Ho, Chuan Yi Tang |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0829105-165900 |
| Rights | withheld, Copyright information available at source archive |
Page generated in 0.0019 seconds