完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHu, YJen_US
dc.date.accessioned2014-12-08T15:41:24Z-
dc.date.available2014-12-08T15:41:24Z-
dc.date.issued2003-01-01en_US
dc.identifier.issn0169-2607en_US
dc.identifier.urihttp://dx.doi.org/10.1016/S0169-2607(01)00198-5en_US
dc.identifier.urihttp://hdl.handle.net/11536/28168-
dc.description.abstractBiologists have determined that the control and regulation of gene expression is primarily determined by relatively short sequences in the region surrounding a gene. These sequences vary in length, position, redundancy, orientation, and bases. Finding these short sequences is a fundamental problem in molecular biology with important applications. Though there exist many different approaches to signal (i.e. short sequence) finding, some new study shows that this problem still leaves plenty of room for improvement. In 2000, Pevzner and Sze proposed the Challenge Problem of motif detection. They reported that most current motif finding algorithms are incapable of detecting the target motifs in their Challenge Problem. In this paper, we show that using an iterative-restart design, our new algorithm can correctly find the target motifs. Furthermore, taking into account the fact that some transcription factors form a dimer or even more complex structures, and transcription process can sometimes involve multiple factors with variable spacers in between, we extend the original problem to an even more challenging one by addressing the issue of combinatorial signals with gaps of variable lengths. To demonstrate the effectiveness of our algorithm, we tested it on a series of the new challenge problem as well as real regulons, and compared it with some current representative motif-finding algorithms. (C) 2002 Elsevier Science Ireland Ltd. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectgene regulationen_US
dc.subjectsubtle signalsen_US
dc.subjectmotif detectionen_US
dc.subjectgapsen_US
dc.subjecttranscription factorsen_US
dc.titleFinding subtle motifs with variable gaps in unaligned DNA sequencesen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/S0169-2607(01)00198-5en_US
dc.identifier.journalCOMPUTER METHODS AND PROGRAMS IN BIOMEDICINEen_US
dc.citation.volume70en_US
dc.citation.issue1en_US
dc.citation.spage11en_US
dc.citation.epage20en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000180499300002-
dc.citation.woscount3-
顯示於類別:期刊論文


文件中的檔案:

  1. 000180499300002.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。