共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
3.
4.
An Exposed KID-Like Domain in Human T-Cell Lymphotropic Virus Type 1 Tax Is Responsible for the Recruitment of Coactivators CBP/p300 总被引:19,自引:6,他引:13
下载免费PDF全文
![点击此处可从《Molecular and cellular biology》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Robert Harrod Yong Tang Christophe Nicot Hsieng S. Lu Alex Vassilev Yoshihiro Nakatani Chou-Zen Giam 《Molecular and cellular biology》1998,18(9):5052-5061
5.
6.
7.
8.
Thomas Farkas Yulia A. Kutskova Vincenzo Zimarino 《Molecular and cellular biology》1998,18(2):906-918
9.
Lalit Ponnala Anne-Marie Stomp Donald L Bitzer Mladen A Vouk 《EURASIP Journal on Bioinformatics and Systems Biology》2006,2006(1):23613-9
A decoding algorithm is tested that mechanistically models the progressive alignments that arise as the mRNA moves past the rRNA tail during translation elongation. Each of these alignments provides an opportunity for hybridization between the single-stranded, -terminal nucleotides of the 16S rRNA and the spatially accessible window of mRNA sequence, from which a free energy value can be calculated. Using this algorithm we show that a periodic, energetic pattern of frequency 1/3 is revealed. This periodic signal exists in the majority of coding regions of eubacterial genes, but not in the non-coding regions encoding the 16S and 23S rRNAs. Signal analysis reveals that the population of coding regions of each bacterial species has a mean phase that is correlated in a statistically significant way with species () content. These results suggest that the periodic signal could function as a synchronization signal for the maintenance of reading frame and that codon usage provides a mechanism for manipulation of signal phase.[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32] 相似文献
10.
11.
12.
13.
14.
Shu-Qin Zhang Morihiro Hayashida Tatsuya Akutsu Wai-Ki Ching Michael K Ng 《EURASIP Journal on Bioinformatics and Systems Biology》2007,2007(1):20180
A Boolean network is a model used to study the interactions between different genes in genetic regulatory networks. In this paper, we present several algorithms using gene ordering and feedback vertex sets to identify singleton attractors and small attractors in Boolean networks. We analyze the average case time complexities of some of the proposed algorithms. For instance, it is shown that the outdegree-based ordering algorithm for finding singleton attractors works in time for , which is much faster than the naive time algorithm, where is the number of genes and is the maximum indegree. We performed extensive computational experiments on these algorithms, which resulted in good agreement with theoretical results. In contrast, we give a simple and complete proof for showing that finding an attractor with the shortest period is NP-hard.[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32] 相似文献
15.
16.
17.
18.
19.