Genome-wide Search for Coaxial Helical Stacking Motifs

被引:0
|
作者
Byron, Kevin [1 ,2 ]
Wang, Jason T. L. [1 ,2 ]
Wen, Dongrong [1 ,2 ]
机构
[1] New Jersey Inst Technol, Bioinformat Program, Newark, NJ 07102 USA
[2] New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA
来源
IEEE 12TH INTERNATIONAL CONFERENCE ON BIOINFORMATICS & BIOENGINEERING | 2012年
关键词
coaxial helical stacking; genome-wide motif finding; RNA junction; RIBOSOMAL-SUBUNIT; RANDOM FORESTS; RNA; THERMODYNAMICS; IDENTIFICATION; JUNCTIONS;
D O I
暂无
中图分类号
R318 [生物医学工程];
学科分类号
0831 ;
摘要
Motif finding in DNA, RNA and proteins plays an important role in life science research. In this paper, we present a computational approach to searching for RNA tertiary motifs in genomic sequences. Specifically, we describe a method, named CSminer, and show, as a case study, the application of CSminer to genome-wide search for coaxial helical stackings in RNA 3-way junctions. A coaxial helical stacking motif occurs in an RNA 3-way junction where two separate helical elements form a pseudocontiguous helix and provide thermodynamic stability to the RNA molecule as a whole. Experimental results demonstrate the effectiveness of our approach.
引用
收藏
页码:260 / 265
页数:6
相关论文
共 50 条
  • [1] Genome-Wide Prediction of Coaxial Helical Stacking Using Random Forests and Covariance Models
    Byron, Kevin
    Wang, Jason T. L.
    Wen, Dongrong
    INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2014, 23 (03)
  • [2] Fast, Sensitive Discovery of Conserved Genome-Wide Motifs
    Ihuegbu, Nnamdi E.
    Stormo, Gary D.
    Buhler, Jeremy
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2012, 19 (02) : 139 - 147
  • [3] Genome-wide search for functional noncoding RNA
    S. V. Vinogradova
    R. A. Soldatov
    A. A. Mironov
    Molecular Biology, 2013, 47 : 599 - 604
  • [4] Genome-wide search for functional noncoding RNA
    Vinogradova, S. V.
    Soldatov, R. A.
    Mironov, A. A.
    MOLECULAR BIOLOGY, 2013, 47 (04) : 599 - 604
  • [5] Genome-Wide Search for Gene-Gene Interactions in Colorectal Cancer
    Jiao, Shuo
    Hsu, Li
    Berndt, Sonja
    Bezieau, Stephane
    Brenner, Hermann
    Buchanan, Daniel
    Caan, Bette J.
    Campbell, Peter T.
    Carlson, Christopher S.
    Casey, Graham
    Chan, Andrew T.
    Chang-Claude, Jenny
    Chanock, Stephen
    Conti, David V.
    Curtis, Keith R.
    Duggan, David
    Gallinger, Steven
    Gruber, Stephen B.
    Harrison, Tabitha A.
    Hayes, Richard B.
    Henderson, Brian E.
    Hoffmeister, Michael
    Hopper, John L.
    Hudson, Thomas J.
    Hutter, Carolyn M.
    Jackson, Rebecca D.
    Jenkins, Mark A.
    Kantor, Elizabeth D.
    Kolonel, Laurence N.
    Kuery, Sebastien
    Le Marchand, Loic
    Lemire, Mathieu
    Newcomb, Polly A.
    Potter, John D.
    Qu, Conghui
    Rosse, Stephanie A.
    Schoen, Robert E.
    Schumacher, Fred R.
    Seminara, Daniela
    Slattery, Martha L.
    Ulrich, Cornelia M.
    Zanke, Brent W.
    Peters, Ulrike
    PLOS ONE, 2012, 7 (12):
  • [6] Genome-Wide Search for Local DNA Segments with Anomalous GC-Content
    Ilatovskiy, Andrey
    Petukhov, Michael
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2009, 16 (04) : 555 - 564
  • [7] Genome-Wide Search for Translated Upstream Open Reading Frames in Arabidopsis Thaliana
    Hu, Qiwen
    Merchante, Catharina
    Stepanova, Anna N.
    Alonso, Jose M.
    Heber, Steffen
    IEEE TRANSACTIONS ON NANOBIOSCIENCE, 2016, 15 (02) : 150 - 159
  • [8] Genome-wide pathway analysis of a genome-wide association study on Alzheimer's disease
    Lee, Young Ho
    Song, Gwan Gyu
    NEUROLOGICAL SCIENCES, 2015, 36 (01) : 53 - 59
  • [9] Genome-Wide Mutagenesis in Mice: In Search for Genes Regulating Immune Responses and Inflammation
    Astrakhantseva, I. V.
    Tomilin, A. N.
    Tarabykin, V. S.
    Nedospasov, S. A.
    RUSSIAN JOURNAL OF GENETICS, 2020, 56 (12) : 1416 - 1423
  • [10] Genome-wide evolution of wobble base-pairing nucleotides of branchpoint motifs with increasing organismal complexity
    Nguyen, Hai
    Das, Urmi
    Xie, Jiuyong
    RNA BIOLOGY, 2020, 17 (03) : 311 - 324