Evaluating Effectiveness of Accessibility to Infer RNA-RNA Interactions

スポンサーリンク

概要

• 論文の詳細を見る

• RNA-RNA interaction is involved in post-transcriptional regulation of gene expression, and a good deal of effort has been made on computational prediction of RNA-RNA interactions from sequence data. Recently, a few studies have incorporated interaction site accessibility into their prediction methods, only indicating enhancement of predictive performance on limited interaction data. In this short report, we show the effectiveness of incorporating accessibility into our prediction model in both in silico and in vitro experiments. Our results reveal that elaborate incorporation of accessibility into our prediction method suggests the possibility of discerning real interacting RNAs.

• 2013-09-12

著者

• Tatsuya Akutsu

  Bioinformatics Center, Institute for Chemical Research, Kyoto University

• Yuki Kato

  Bioinformatics Center, Institute for Chemical Research, Kyoto University

• Tatsuya Akutsu

  Bioinformatics Center Institute For Chemical Research Kyoto University

• Tatsuya Akutsu

  Bioinformatics Center Institute For Chemical Research Kyoto Univerty

• Tomoya Mori

  Bioinformatics Center Institute For Chemical Research Kyoto University

• Kato Yuki

  Bioinformatics Center Institute For Chemical Research Kyoto University

• Kengo Sato

  Faculty of Science and Technology, Keio University

• Shingo Maegawa

  Graduate School of Informatics, Kyoto University

• Yuki Kato

  Graduate School of Information Science, Nara Institute of Science and Technology (NAIST)

• Hiroshi Hosokawa

  Graduate School of Informatics, Kyoto University

関連論文

• Prediction of Protein Folding Rates from Structural Topology and Complex Network Properties
• Prediction of Protein Folding Rates from Structural Topology and Complex Network Properties
• RNA-RNA Interaction Prediction Using Integer Programming with Threshold Cut
• A Quadsection Algorithm for Grammar-Based Image Compression
• Analyses and Algorithms for Predecessor and Control Problems for Boolean Networks of Bounded Indegree
• Conditional Random Field Approach to Prediction of Protein-protein Interactions Using Domain Information
• Integer Programming and Dynamic Programming-based Methods of Optimizing Control Policy in Probabilistic Boolean Networks with Hard Constraints
• An Improved Clique-Based Method for Computing Edit Distance between Rooted Unordered Trees
• Prediction of protein residue contacts using discriminative random field
• Prediction of protein residue contacts using discriminative random field
• Efficient Computation of Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles
• Prediction of RNA Secondary Structures with Binding Sites Using Dynamic Programming Algorithm
• Message from the Editor-in-Chief
• Message from the Editor-in-Chief
• Message from the Editor-in-Chief
• Protein complex prediction via improved verification methods using constrained domain-domain matching
• On the Generative Power of Multiple Context-Free Grammars and Macro Grammars
• Predicting Protein-RNA Residue-base Contacts Using Two-dimensional Conditional Random Field
• Finding Conserved Regions in Protein Structures Using Support Vector Machines and Structure Alignment
• Inferring Strengths of Protein-Protein Interactions Using Support Vector Regression
• Evaluating Effectiveness of Accessibility to Infer RNA-RNA Interactions
• Survival Analysis by Penalized Regression and Matrix Factorization
• A Dominating Set Approach to Structural Controllability of Unidirectional Bipartite Networks
• Prediction of Heterodimeric Protein Complexes from Weighted Protein-Protein Interaction Networks Using Novel Features and Kernel Functions
• Prediction of Heterodimeric Protein Complexes from Weighted Protein-Protein Interaction Networks Using Novel Features and Kernel Functions
• Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
• Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
• Algorithms for Finding a Largest Common Subtree of Bounded Degree
• Parallelization of Enumerating Tree-like Chemical Compounds by Breadth-first Search Order
• Prediction of Heterotrimeric Protein Complexes by Two-phase Learning Using Neighboring Kernels
• Prediction of Heterotrimeric Protein Complexes by Two-phase Learning Using Neighboring Kernels
• Grammar-based Compression for Multiple Trees Using Integer Programming
• Grammar-based Compression for Multiple Trees Using Integer Programming

もっと見る 閉じる

スポンサーリンク