ASIA unversity:Item 310904400/8141
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94286/110023 (86%)
造訪人次 : 21700092      線上人數 : 504
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/8141


    題名: Primer Design for Multiplex PCR Using a Genetic Algorithm
    作者: H.Y. Huang;F.M. Lin;H. D. Huang;J.T. Horng
    貢獻者: Department of Bioinformatics
    日期: 2007
    上傳時間: 2010-03-19 08:24:39 (UTC+0)
    出版者: Asia University
    摘要: Multiplex Polymerase chain reaction (PCR) is the term used when more than one pair of primers is used in a polymerase chain reaction. The goal of multiplex PCR is to amplify several segments of target DNA simultaneously and thereby to conserve template DNA, save time, and minimize expense. The success of the experiment is dependent on primer design. However, this can be a dreary task as there are many constrains
    such as melting temperatures, primer length, GC content and complementarity that need to be optimized to obtain a good PCR product. In our investigations, we found few primer design tools for multiplex PCR and there was no suitable tool for our partners who want to
    use a multiplex PCR genotypic assay. The tool draws on a genetic algorithm where stochastic approaches based on the concept of biological evolution, biological genetics and genetic operations on chromosomes are used to find an optimal solution for multiplex PCR. The presented
    experimental results indicate that the proposed algorithm is able to find a set of primer pairs that not only obey the design properties but also work in the same tube.
    關聯: Soft Computing Journal 11:855-863
    顯示於類別:[生物資訊與醫學工程學系 ] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    0KbUnknown274檢視/開啟
    310904400-8141.doc35KbMicrosoft Word136檢視/開啟


    在ASIAIR中所有的資料項目都受到原著作權保護.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋