bioRxiv Science⌕ Search

Biology subjects

Orponen, P.

Publications and source records attributed to Orponen, P..

3 recordsLinked to original sources

Algorithmic design of 3D wireframe RNA polyhedra

We address the problem of de novo design and synthesis of nucleic acid nanostructures, a challenge that has been considered in the area of DNA nanotechnology since the 1980s and more recently in the area of RNA nanotechnology. Towards this goal, we introduce a general algorithmic design process and software pipeline for rendering 3D wireframe polyhedral nanostructures in single-stranded RNA. To initiate the pipeline, the user creates a model of the desired polyhedron using standard 3D graphic design software. As its output, the pipeline produces an RNA nucleotide sequence whose corresponding RNA primary structure can be transcribed from a DNA template and folded in the laboratory. As case examples, we design and characterize experimentally three 3D RNA nanostructures: a tetrahedron, a bipyramid and a prism. The design software is openly available, and also provides an export of the targeted 3D structure into the oxRNA molecular dynamics simulator for easy simulation and visualization.

bioengineering↗

RNA secondary structure prediction with Convolutional Neural Networks

Predicting the secondary, i.e. base-pairing structure of a folded RNA strand is an important problem in synthetic and computational biology. First-principle algorithmic approaches to this task are challenging because existing models of the folding process are inaccurate, and even if a perfect model existed, finding an optimal solution would be in general NP-complete. In this paper, we propose a simple, yet extremely effective data-driven approach. We represent RNA sequences in the form of three-dimensional tensors in which we encode possible relations between all pairs of bases in a given sequence. We then use a convolutional neural network to predict a two-dimensional map which represents the correct pairings between the bases. Our model achieves significant accuracy improvements over existing methods on two standard datasets. Our experiments show excellent performance of the model across a wide range of sequence lengths and RNA families. We also observe considerable improvements in predicting complex pseudoknotted RNA structures, as compared to previous approaches. Author summaryStructure prediction for RNA sequences is a computationally difficult task that is of increasing importance in applications such as medical diagnostics and drug design; this is because the structure of a folded RNA strand to a large extent defines its function. An open RNA strand can fold to many different structures of varying thermal stability, and the goal of structure prediction is to determine a most stable one among these. There are two main difficulties to this task. Firstly, a given RNA sequence can fold into an enormous number of alternative structures, and a computational search for a most stable one in this huge space can be very demanding. The search can however be facilitated by using heuristics that take into account some underlying principles of the folding process. Here is where machine learning methods come into play: they are suitable for discovering patterns in data, and can thus predict features of the desired structure based on previously learned patterns. Secondly, there do not yet exist fully satisfactory coarse-grained models for the most popular metric for stability, the free energy of the folded structure. Although in principle a minimum free energy (MFE) structure should be a good candidate for a most stable one, MFE structures determined according to current energy models do not match experimental data on native RNA conformations very well. We show how to use an artificial neural network design to predict the structure for a given RNA sequence with high accuracy only by learning from samples whose native structures have been experimentally characterized, independent of any stability metric or energy model.

bioinformatics↗

A Computational Framework for DNA Sequencing-Based Microscopy

Barcoded DNA polony amplification techniques provide a means to impart a unique sequence identity onto specific locations of a surface wafer or chip. We describe a method whereby micro-scale spatial information such as the relative positions of biomolecules on a surface can be transferred to a sequence-based format and reconstructed into images without the use of conventional optics. The principle is based on the pair-wise association of uniquely tagged and spatially adjacenct polonies. The network of polonies connected by shared borders forms a graph whose topology can be reconstructed from a set of edges derived from pairs of barcodes associated with each other during a polony crosslinking phase, the sequences of which could be determined by isolation of the DNA and next-gen sequencing. We developed a mathematical and computational framework for this principle called Polony Adjacency Reconstruction for Spatial Inference and Topology and show that Euclidean spatial data may be partially stored and transmitted in the form of untethered graph topology. This effect may be exploited to form images by transferring molecular information from a surface of interest, which we demonstrated in silico by reconstructing images formed from stochastic transfer of hypothetical red, green, and blue molecular markers. The theory developed here could serve as a guide for a highly automated, multiplexable, and potentially super resolution imaging method based on molecular information encoding and transmission.

biophysics↗