共查询到20条相似文献,搜索用时 84 毫秒
1.
2.
ETO, a Target of t(8;21) in Acute Leukemia, Interacts with the N-CoR and mSin3 Corepressors 总被引:29,自引:7,他引:22 下载免费PDF全文
Bart Lutterbach Jennifer J. Westendorf Bryan Linggi Andrea Patten Mariko Moniwa James R. Davie Khanh D. Huynh Vivian J. Bardwell Robert M. Lavinsky Michael G. Rosenfeld Christopher Glass Edward Seto Scott W. Hiebert 《Molecular and cellular biology》1998,18(12):7176-7184
3.
4.
Aberrant Recruitment of the Nuclear Receptor Corepressor-Histone Deacetylase Complex by the Acute Myeloid Leukemia Fusion Partner ETO 总被引:24,自引:8,他引:16 下载免费PDF全文
Vania Gelmetti Jinsong Zhang Mirco Fanelli Saverio Minucci Pier Giuseppe Pelicci Mitchell A. Lazar 《Molecular and cellular biology》1998,18(12):7185-7191
5.
6.
7.
8.
9.
Decomposing a biological sequence into its functional regions is an important prerequisite to understand the molecule. Using the multiple alignments of the sequences, we evaluate a segmentation based on the type of statistical variation pattern from each of the aligned sites. To describe such a more general pattern, we introduce multipattern consensus regions as segmented regions based on conserved as well as interdependent patterns. Thus the proposed consensus region considers patterns that are statistically significant and extends a local neighborhood. To show its relevance in protein sequence analysis, a cancer suppressor gene called p53 is examined. The results show significant associations between the detected regions and tendency of mutations, location on the 3D structure, and cancer hereditable factors that can be inferred from human twin studies.[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] 相似文献
10.
11.
12.
13.
14.
15.
RMP, a Novel RNA Polymerase II Subunit 5-Interacting Protein, Counteracts Transactivation by Hepatitis B Virus X Protein 总被引:1,自引:1,他引:0 下载免费PDF全文
Dorjbal Dorjsuren Yong Lin Wenxiang Wei Tatsuya Yamashita Takahiro Nomura Naoyuki Hayashi Seishi Murakami 《Molecular and cellular biology》1998,18(12):7546-7555
16.
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] 相似文献
17.
18.
19.
Thomas Farkas Yulia A. Kutskova Vincenzo Zimarino 《Molecular and cellular biology》1998,18(2):906-918
20.
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] 相似文献