Graph-based sampling for approximating global helical topologies of RNA

Namhee Kim, Christian Laing, Shereef Elmetwaly, Segun Jung, Jeremy Curuksu, Tamar Schlick

Research output: Contribution to journalArticle

Abstract

A current challenge in RNA structure prediction is the description of global helical arrangements compatible with a given secondary structure. Here we address this problem by developing a hierarchical graph sampling/data mining approach to reduce conformational space and accelerate global sampling of candidate topologies. Starting from a 2D structure, we construct an initial graph from size measures deduced from solved RNAs and junction topologies predicted by our data-mining algorithm RNAJAG trained on known RNAs. We sample these graphs in 3D space guided by knowledge-based statistical potentials derived from bending and torsion measures of internal loops as well as radii of gyration for known RNAs. Graph sampling results for 30 representative RNAs are analyzed and compared with reference graphs from both solved structures and predicted structures by available programs. This comparison indicates promise for our graph-based sampling approach for characterizing global helical arrangements in large RNAs: graph rmsds range from 2.52 to 28.24 Å for RNAs of size 25- 158 nucleotides, and more than half of our graph predictions improve upon other programs. The efficiency in graph sampling, however, implies an additional step of translating candidate graphs into atomic models. Such models can be built with the same idea of graph partitioning and build-up procedures we used for RNA design.

Original languageEnglish (US)
Pages (from-to)4079-4084
Number of pages6
JournalProceedings of the National Academy of Sciences of the United States of America
Volume111
Issue number11
DOIs
StatePublished - Mar 18 2014

Fingerprint

RNA
Data Mining
Nucleotides

Keywords

  • Monte Carlo simulated annealing
  • RNA 3D graph
  • RNA 3D prediction

ASJC Scopus subject areas

  • General

Cite this

Graph-based sampling for approximating global helical topologies of RNA. / Kim, Namhee; Laing, Christian; Elmetwaly, Shereef; Jung, Segun; Curuksu, Jeremy; Schlick, Tamar.

In: Proceedings of the National Academy of Sciences of the United States of America, Vol. 111, No. 11, 18.03.2014, p. 4079-4084.

Research output: Contribution to journalArticle

Kim, Namhee ; Laing, Christian ; Elmetwaly, Shereef ; Jung, Segun ; Curuksu, Jeremy ; Schlick, Tamar. / Graph-based sampling for approximating global helical topologies of RNA. In: Proceedings of the National Academy of Sciences of the United States of America. 2014 ; Vol. 111, No. 11. pp. 4079-4084.
@article{2e805102e41e41cab802bc40ff59dcf4,
title = "Graph-based sampling for approximating global helical topologies of RNA",
abstract = "A current challenge in RNA structure prediction is the description of global helical arrangements compatible with a given secondary structure. Here we address this problem by developing a hierarchical graph sampling/data mining approach to reduce conformational space and accelerate global sampling of candidate topologies. Starting from a 2D structure, we construct an initial graph from size measures deduced from solved RNAs and junction topologies predicted by our data-mining algorithm RNAJAG trained on known RNAs. We sample these graphs in 3D space guided by knowledge-based statistical potentials derived from bending and torsion measures of internal loops as well as radii of gyration for known RNAs. Graph sampling results for 30 representative RNAs are analyzed and compared with reference graphs from both solved structures and predicted structures by available programs. This comparison indicates promise for our graph-based sampling approach for characterizing global helical arrangements in large RNAs: graph rmsds range from 2.52 to 28.24 {\AA} for RNAs of size 25- 158 nucleotides, and more than half of our graph predictions improve upon other programs. The efficiency in graph sampling, however, implies an additional step of translating candidate graphs into atomic models. Such models can be built with the same idea of graph partitioning and build-up procedures we used for RNA design.",
keywords = "Monte Carlo simulated annealing, RNA 3D graph, RNA 3D prediction",
author = "Namhee Kim and Christian Laing and Shereef Elmetwaly and Segun Jung and Jeremy Curuksu and Tamar Schlick",
year = "2014",
month = "3",
day = "18",
doi = "10.1073/pnas.1318893111",
language = "English (US)",
volume = "111",
pages = "4079--4084",
journal = "Proceedings of the National Academy of Sciences of the United States of America",
issn = "0027-8424",
number = "11",

}

TY - JOUR

T1 - Graph-based sampling for approximating global helical topologies of RNA

AU - Kim, Namhee

AU - Laing, Christian

AU - Elmetwaly, Shereef

AU - Jung, Segun

AU - Curuksu, Jeremy

AU - Schlick, Tamar

PY - 2014/3/18

Y1 - 2014/3/18

N2 - A current challenge in RNA structure prediction is the description of global helical arrangements compatible with a given secondary structure. Here we address this problem by developing a hierarchical graph sampling/data mining approach to reduce conformational space and accelerate global sampling of candidate topologies. Starting from a 2D structure, we construct an initial graph from size measures deduced from solved RNAs and junction topologies predicted by our data-mining algorithm RNAJAG trained on known RNAs. We sample these graphs in 3D space guided by knowledge-based statistical potentials derived from bending and torsion measures of internal loops as well as radii of gyration for known RNAs. Graph sampling results for 30 representative RNAs are analyzed and compared with reference graphs from both solved structures and predicted structures by available programs. This comparison indicates promise for our graph-based sampling approach for characterizing global helical arrangements in large RNAs: graph rmsds range from 2.52 to 28.24 Å for RNAs of size 25- 158 nucleotides, and more than half of our graph predictions improve upon other programs. The efficiency in graph sampling, however, implies an additional step of translating candidate graphs into atomic models. Such models can be built with the same idea of graph partitioning and build-up procedures we used for RNA design.

AB - A current challenge in RNA structure prediction is the description of global helical arrangements compatible with a given secondary structure. Here we address this problem by developing a hierarchical graph sampling/data mining approach to reduce conformational space and accelerate global sampling of candidate topologies. Starting from a 2D structure, we construct an initial graph from size measures deduced from solved RNAs and junction topologies predicted by our data-mining algorithm RNAJAG trained on known RNAs. We sample these graphs in 3D space guided by knowledge-based statistical potentials derived from bending and torsion measures of internal loops as well as radii of gyration for known RNAs. Graph sampling results for 30 representative RNAs are analyzed and compared with reference graphs from both solved structures and predicted structures by available programs. This comparison indicates promise for our graph-based sampling approach for characterizing global helical arrangements in large RNAs: graph rmsds range from 2.52 to 28.24 Å for RNAs of size 25- 158 nucleotides, and more than half of our graph predictions improve upon other programs. The efficiency in graph sampling, however, implies an additional step of translating candidate graphs into atomic models. Such models can be built with the same idea of graph partitioning and build-up procedures we used for RNA design.

KW - Monte Carlo simulated annealing

KW - RNA 3D graph

KW - RNA 3D prediction

UR - http://www.scopus.com/inward/record.url?scp=84896510443&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84896510443&partnerID=8YFLogxK

U2 - 10.1073/pnas.1318893111

DO - 10.1073/pnas.1318893111

M3 - Article

VL - 111

SP - 4079

EP - 4084

JO - Proceedings of the National Academy of Sciences of the United States of America

JF - Proceedings of the National Academy of Sciences of the United States of America

SN - 0027-8424

IS - 11

ER -