ORCID Profile
0000-0001-9637-8718
Current Organisation
Osaka University
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: Elsevier BV
Date: 03-2015
Abstract: RNA-LIM is a procedure that can analyze various pseudo-potentials describing the affinity between single-stranded RNA (ssRNA) ribonucleotides and surface amino acids to produce a coarse-grained estimate of the structure of the ssRNA at the protein interface. The search algorithm works by evolving an ssRNA chain, of known sequence, as a series of walks between fixed sites on a protein surface. Optimal routes are found by application of a set of minimal "limiting" restraints derived jointly from (i) selective s ling of the ribonucleotide amino acid affinity pseudo-potential data, (ii) limited surface path exploration by prior determination of surface arc lengths, and (iii) RNA structural specification obtained from a statistical potential gathered from a library of experimentally determined ssRNA structures. We describe the general approach using a NAST (Nucleic Acid Simulation Tool)-like approximation of the ssRNA chain and a generalized pseudo-potential reflecting the location of nucleic acid binding residues. Minimum and maximum performance indicators of the methodology are established using both synthetic data, for which the pseudo-potential defining nucleic acid binding affinity is systematically degraded, and a representative real case, where the RNA binding sites are predicted by the lified antisense RNA (aaRNA) method. Some potential uses and extensions of the routine are discussed. RNA-LIM analysis programs along with detailed instructions for their use are available on request from the authors.
Publisher: Elsevier BV
Date: 06-2014
DOI: 10.1016/J.BPC.2014.01.005
Abstract: We present a novel protein distance matrix based on the minimum line of arc between two points on the surface of a protein. Two methods for calculating this distance matrix are developed and contrasted. The first method, which we have called TOPOL, is an approximate rule based algorithm consisting of successive rounds of vector addition. The second method is adapted from the graph theoretic approach of Dijkstra. Both procedures are demonstrated using cytochrome c, a 12,500 Da protein, as a test case. In respect to computational speed and accuracy the TOPOL procedure compares favorably against the more complex method based on shortest path enumeration over a surface manifold grid. Some potential uses of the algorithmic approaches and calculated surface protein distance measurement are discussed.
No related grants have been discovered for Ryuzo Azuma.