ASIA unversity:Item 310904400/16574
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 92958/108462 (86%)
Visitors : 20420034      Online Users : 209
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item:

    Title: Searching the Regulatory Protein Binding Site by Steepest Ascent Algorithm
    Authors: 蔡進發;Jeffrey, J.P.Tsai
    Contributors: 生物與醫學資訊學系
    Keywords: DNA;regulatory protein binding site;transcription;translation;gene expression;steepest ascent algorithm.
    Date: 2006
    Issue Date: 2012-11-23 17:14:42 (UTC+8)
    Abstract: "Gene transcription regulation impacts the final expression of gene. Generally gene expression is
    regulated via an interaction between regulatory proteins and specific DNA elements. If we find out the
    binding sites of regulatory factors, we could understand more of the control mechanism of gene
    transcription. For this reason, it is a very important issue to find out the regulatory factors of gene
    transcription. We propose a method to find out the regulatory protein binding sites from the
    comparisons of DNA sequences and scoring matrices. The steepest ascent algorithm is adopted to
    search the possible locations of binding sites. The predicted results of regulatory protein binding sites
    are shown with tables and charts. The proposed system in this paper will help biologists to analyze the
    regulatory protein binding sites more efficiently."
    Relation: Asian Journal of Health and Information Sciences
    Appears in Collections:[Department of Biomedical informatics  ] Journal Article

    Files in This Item:

    File Description SizeFormat

    All items in ASIAIR are protected by copyright, with all rights reserved.

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