Computational identification of combinatorial regulation and transcription factor binding sites
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ryu, Taewoo | - |
dc.contributor.author | Kim, Younghoon | - |
dc.contributor.author | Kim, Dae-Won | - |
dc.contributor.author | Lee, Doheon | - |
dc.date.available | 2019-05-30T05:41:52Z | - |
dc.date.issued | 2007-08 | - |
dc.identifier.issn | 0006-3592 | - |
dc.identifier.issn | 1097-0290 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/24007 | - |
dc.description.abstract | A number of computational methods have been used to unravel the core mechanisms governing the regulation of gene expression, but these techniques examine only portions of the genetic regulatory mechanism. For example, some studies have failed to include the combined action of multiple transcription factors (TFs) or the importance of TF binding constraints (i.e., the binding position and orientation), while others have examined combinations of only 2 or 3 TFs. Thus, we sought to develop a new method for identifying regulatory modules in yeast, using an algorithm that includes all combinations of TFs plus a number of binding constraints when identifying target genes. We successfully developed a computational method for using microarray and TF-DNA interaction data to identify regulatory modules. All possible combinations of yeast TFs and various binding constraints were tested to identify regulatory modules. Within the identified modules, target genes were found to have common binding constraints such as fixed binding regions and orientations for each TF. Moreover, targets showed similar mRNA expression profiles and high functional coherence. Our novel approach, which accounts for both combined actions of TFs and their binding constraints, can be used to identify target genes and reliably predict regulatory modules over a broad range of functional categories. Complete results and additional information are available online at http://bisl.kaist.ac.kr/similar to dhlee/comModule/index.html. | - |
dc.format.extent | 9 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | JOHN WILEY & SONS INC | - |
dc.title | Computational identification of combinatorial regulation and transcription factor binding sites | - |
dc.type | Article | - |
dc.identifier.doi | 10.1002/bit.21354 | - |
dc.identifier.bibliographicCitation | BIOTECHNOLOGY AND BIOENGINEERING, v.97, no.6, pp 1594 - 1602 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.wosid | 000248158800025 | - |
dc.identifier.scopusid | 2-s2.0-34547619994 | - |
dc.citation.endPage | 1602 | - |
dc.citation.number | 6 | - |
dc.citation.startPage | 1594 | - |
dc.citation.title | BIOTECHNOLOGY AND BIOENGINEERING | - |
dc.citation.volume | 97 | - |
dc.type.docType | Article | - |
dc.publisher.location | 미국 | - |
dc.subject.keywordAuthor | transcription factor | - |
dc.subject.keywordAuthor | Saccharomyces cerevisiae | - |
dc.subject.keywordAuthor | combinatorial regulation | - |
dc.subject.keywordAuthor | cis-element | - |
dc.subject.keywordPlus | YEAST SACCHAROMYCES-CEREVISIAE | - |
dc.subject.keywordPlus | RIBOSOMAL-PROTEIN GENES | - |
dc.subject.keywordPlus | CELL-CYCLE | - |
dc.subject.keywordPlus | EXPRESSION DATA | - |
dc.subject.keywordPlus | NETWORKS | - |
dc.subject.keywordPlus | ELEMENTS | - |
dc.subject.keywordPlus | MODULES | - |
dc.subject.keywordPlus | GENOME | - |
dc.subject.keywordPlus | RAP1 | - |
dc.subject.keywordPlus | DISCOVERY | - |
dc.relation.journalResearchArea | Biotechnology & Applied Microbiology | - |
dc.relation.journalWebOfScienceCategory | Biotechnology & Applied Microbiology | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.