PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “Computers, Molecular”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2Linked to original sources
PubMed1999

Micro flow bio-molecular computation.

In this paper we provide a model for micro-flow based bio-molecular computation (MF-BMC). It provides an abstraction for the design of algorithms which account for the constraints of the model. Our MF-BMC model uses abstractions of both the recombinant DNA (RDNA) technology as well as of the micro-flow technology and takes into account both of their limitations. For example, when considering the efficiency of the recombinant DNA operation of annealing, we take into account the limitation imposed by the concentration of the reactants. The fabrication technology used to construct MEMS is limited to constructing relatively thin 3D structures. We abstract this by limiting the model to a small constant number of layers (as is done with VLSI models). Besides our contribution of the MF-BMC model, the paper contains two other classes of results. The main result is the volume and time efficient algorithm for message routing in the MF-BMC model, specifically useful for PA-Match. We will show that routing of strands between chambers will occur in time O(N x D/ m x n), where N is the number of strands in the MF-BMC, n is the number of chambers where RDNA operations are occurring, D is the diameter of the topology of the layout of the chambers, and m is proportional to the channel width. Operations that need annealing, such as PA-Match, are shown feasible in O(N2logN/n/n) volume instead of the previous use of omega(N2) volume, with reasonable time constraints. Applications of the volume efficient algorithm include the use of the Join operation for databases, logarithmic depth solutions to SAT (Boolean formula satisfiability) problems and parallel algorithms that execute on a PRAM. Existent algorithms can be mapped to ones that work efficiently in the MF-BMC model, whereas previous methods for applications such as PRAM simulation in BMC were not both time and volume efficient. Our other class of results are theoretical lower bounds on the quantities of DNA and the time needed to solve a problem in the MF-BMC model, analogous to lower bounds in VLSI. We bound the product BT from below, and further show that BT2 has a stronger lower bound of I2. Here B is the maximum amount of information encoded in the MF-BMC system at a time. T is the time for an algorithm to complete, and I is the information content of a problem.

Animals↗
PubMed2000

Carbon nanotube-based nonvolatile random access memory for molecular computing

A concept for molecular electronics exploiting carbon nanotubes as both molecular device elements and molecular wires for reading and writing information was developed. Each device element is based on a suspended, crossed nanotube geometry that leads to bistable, electrostatically switchable ON/OFF states. The device elements are naturally addressable in large arrays by the carbon nanotube molecular wires making up the devices. These reversible, bistable device elements could be used to construct nonvolatile random access memory and logic function tables at an integration level approaching 10(12) elements per square centimeter and an element operation frequency in excess of 100 gigahertz. The viability of this concept is demonstrated by detailed calculations and by the experimental realization of a reversible, bistable nanotube-based bit.

Journal Article↗
PubMed2003

Parallel molecular computations of pairwise exclusive-or (XOR) using DNA "string tile" self-assembly.

Self-assembling DNA nanostructures are an efficient means of executing parallel molecular computations. However, previous experimental demonstrations of computations by DNA tile self-assembly only allowed for one set of distinct input to be processed at a time. Here, we report the multibit, parallel computation of pairwise exclusive-or (XOR) using DNA "string tile" self-assembly. A set of DNA tiles encoding the truth table for the XOR logical operation was constructed. Parallel tile self-assembly and ligation led to the formation of reporter DNA strands which encoded both the input and the output of the computations. These reporter strands provided a molecular look-up table containing all possible pairwise XOR calculations up to a certain input size. The computation was readout by sequencing the cloned reporter strands. This is the first experimental demonstration of a parallel computation by DNA tile self-assembly in which a large number of distinct input were simultaneously processed.

DNA↗
PubMed1998

Evaluating polynomials on the molecular level--a novel approach to molecular computers.

In the past few years two fascinating and new scientific fields, the science of DNA-structure and topology and the theory of molecular computers have been growing independently. The main goal of this paper is to establish an interesting connection between them and to propose a novel paradigm for the future construction of DNA-computing devices based on supercoil energetics. The basic principle of the proposed model can also be applied to describe the communication between topologically closed segments in real genomes, which is believed to take part in the complex process of gene regulation. An implementation of the recent model is proposed by which polynomials of one real variable can be evaluated in a simple in vitro recombination assay.

Computers↗
PubMedDate not supplied

[Cell molecular computer. IX. Coding principles in intracellular information processing].

Methods of coding the number and search for molecular program in a molecular computer are considered. The limited length of the nucleotide code is (see formula) where Pi -- probability of request of the given program, N -- total number of programs. Energetic expenditures for the synthesis of the code with the length l (in an ideal case without noise) E approximately 10 kT X l. Protein-nucleic recognition allows the work of the cell with almost the same expenditures on the account of Brown search in the presence of noise.

Cells↗
PubMedDate not supplied

Chemical substituent effect on pyridine permeability and mechanistic insight from computational molecular descriptors.

The objective was (1) to evaluate the chemical substituent effect on Caco-2 permeability, using a congeneric series of pyridines, and (2) compare molecular descriptors from a computational chemistry approach against molecular descriptors from the Hansch approach for their abilities to explain the chemical substituent effect on pyridine permeability. The passive permeability of parent pyridine and 14 monosubstituted pyridines were measured across Caco-2 monolayers. Computational chemistry analysis was used to obtain the following molecular descriptions: solvation free energies, solvent accessible surface area, polar surface area, and cavitation energy. Results indicate that the parent pyridine was highly permeable and that chemical substitution was able to reduce pyridine permeability almost 20-fold. The substituent effect on permeability provided the following rank order: 3-COO- < 4-NH2 < 3-CONH2 < 3-Cl < 3-CHO < 3-OH < 3-CH2OH < 3-C6H5 < 3-NH2 < 3-CH2C6H5 < 3-C2H5 < 3-H < 3-CH3 < 3-F < 4-C6H5. This substituent effect was better explained via molecule descriptors from the computational chemistry approach than explained by classic descriptors from Hansch. Computational descriptors indicate that aqueous desolvation, but not membrane partitioning per se, dictated substituent effect on permeability.

Caco-2 Cells↗
PubMed2000

BALL--rapid software prototyping in computational molecular biology. Biochemicals Algorithms Library.

MOTIVATION: Rapid software prototyping can significantly reduce development times in the field of computational molecular biology and molecular modeling. Biochemical Algorithms Library (BALL) is an application framework in C++ that has been specifically designed for this purpose. RESULTS: BALL provides an extensive set of data structures as well as classes for molecular mechanics, advanced solvation methods, comparison and analysis of protein structures, file import/export, and visualization. BALL has been carefully designed to be robust, easy to use, and open to extensions. Especially its extensibility which results from an object-oriented and generic programming approach distinguishes it from other software packages. BALL is well suited to serve as a public repository for reliable data structures and algorithms. We show in an example that the implementation of complex methods is greatly simplified when using the data structures and functionality provided by BALL.

Algorithms↗
PubMed1994

Molecular computation of solutions to combinatorial problems.

The tools of molecular biology were used to solve an instance of the directed Hamiltonian path problem. A small graph was encoded in molecules of DNA, and the "operations" of the computation were performed with standard protocols and enzymes. This experiment demonstrates the feasibility of carrying out computations at the molecular level.

Algorithms↗
PubMed2005

Conformational analysis of ochratoxin a by NMR spectroscopy and computational molecular modeling.

Two-dimensional NMR spectroscopy has been used for a complete assignment of the proton and carbon-13 spectra of the metabolite from Aspergillus ochraceus, ochratoxin A. In addition, phase-sensitive nuclear Overhauser effect spectrometry experiments and computational molecular modeling (MM2 and MMFF force field programs) have been employed to examine the conformational properties of ochratoxin A in chloroform solutions. Particular attention has been given to intramolecular hydrogen-bonding formation involving the phenolic group on dihydroisocoumarin, which may be responsible for the toxic mechanism of ochratoxin A.

Magnetic Resonance Spectroscopy↗
PubMedDate not supplied

[Neuron membrane depolarization under the influence of cyclic-3',5'-adenosine monophosphate and its possible role in the neuronal molecular computer (MC)].

The separate fourth intracellular microelectrode was used for controlling the conditions of cyclic nucleotide injection in neurons of Helix pomatia. Ionoforetic increase in intracellular cyclic AMP concentration elicits membrane depolarization in many neurons. Phosphodiesterase inhibitors 3-isobutyl-1-methylxantine and SQ-20009 prolong this depolarization and raise its level. In cell F-1 of helix brain sometimes cAMP induces weak hyperpolarization, but this response turns to usual depolarization after 3-isobutyl-1-methylxantine application. It is suggested that cell molecular computer has an analog input, where diffusion of cAMP, cGMP and Ca++ being a modelling process. Adenylate cyclase and guanylate cyclase and ionic channels of membrane are regulated sources. Phosphodiesterases with Ca2+-binding activator proteins are molecular out flowers and protein kinases--detectors that transform the data about the concentrations of cAMP and cGMP into codes for MCC. Protein kinases control over the activity of proteins directly. The depolarization effect on neuron membrane seems to be associated with protein kinase activation or with direct action of cAMP on phospholipase.

Adenylyl Cyclases↗
PubMed2002

Backbone dynamics of the ribonuclease binase active site area using multinuclear ((15)N and (13)CO) NMR relaxation and computational molecular dynamics.

The nano-pico second backbone dynamics of the ribonuclease binase, homologous to barnase, is investigated with (15)N, (13)C NMR relaxation at 11.74 and 18.78 T and with a 1.1 ns molecular dynamics simulation. The data are compared with the temperature factors reported for the X-ray structure of this enzyme. The molecular dynamics and X-ray data correspond well and predict motions in the loops 56-61 and 99-104 that contain residues that specifically recognize substrate and are catalytic (His101), respectively. In contrast, the (15)N relaxation data indicate that these loops are mostly ordered at the nano-pico second time scale. Nano-pico second motions in the recognition loop 56-61 are evident from (13)CO-(13)C cross relaxation data, but the mobility of the catalytic loop 99-104 is not detected by (13)CO cross relaxation either. From the results of this and previous work [Wang, L., Pang, Y., Holder, T., Brender, J. R., Kurochkin, A., and Zuiderweg, E. R. P. (2001) Proc. Natl. Acad. Sci. U.S.A., 98, 7684-7689], the following dynamical characterization of the active site area of binase emerges: a beta sheet, rigid at all probed time scales, supports the catalytic residue Glu 72. Both substrate-encapsulating loops are mobile on both fast and slow time scales, but the fast motions of the loop which contains the other catalytic residue, His 101, as predicted by B-factors and computational molecular dynamics is not detected by NMR relaxation. This work strongly argues for the use of several measures in the study of protein dynamics.

Amino Acid Sequence↗
PubMedDate not supplied

[Cell molecular computer. VII. Cell biophysics and realistic or information physics (1)].

Living organisms measure many parameters in order to have orientation in the outer medium. That is why biophysics cannot use the ordinary laws of physics and must take into account the influence on the phenomena to be studied not only of a measurement but also of a calculation process in the real physical and biophysical device predicting the future. Science taking into account the effects of the calculating process-realistical or informative (RI) physics-has different (laws) for different times, distances and numbers of measuring and predicting parameters. RI-physics deals with unreproducible events and considers only such time intervals and distances for which the prediction can be made on the basis of earlier measurements and calculations according to the laws with optimal difficulty. It is suggested that the living cell uses the laws which are close to these optimal (limiting) laws of RI-physics. Physics and quantum mechanics can be considered as a limiting case of RI-physics. In this case values of distances and times are large enough and the number of simultaneously measured independent parameters is such that the heat effect of the calculating device would become negligible. Molecular cell computer (MCC) [I] cannot calculate the interaction of a great quantity of different molecules, using the equations of quantum mechanics because the expense of the (price of action) would be very large and both MCC and the surrounding world could change.

Cell Physiological Phenomena↗
PubMed2004

Rational design of DNA sequences for nanotechnology, microarrays and molecular computers using Eulerian graphs.

Nucleic acids are molecules of choice for both established and emerging nanoscale technologies. These technologies benefit from large functional densities of 'DNA processing elements' that can be readily manufactured. To achieve the desired functionality, polynucleotide sequences are currently designed by a process that involves tedious and laborious filtering of potential candidates against a series of requirements and parameters. Here, we present a complete novel methodology for the rapid rational design of large sets of DNA sequences. This method allows for the direct implementation of very complex and detailed requirements for the generated sequences, thus avoiding 'brute force' filtering. At the same time, these sequences have narrow distributions of melting temperatures. The molecular part of the design process can be done without computer assistance, using an efficient 'human engineering' approach by drawing a single blueprint graph that represents all generated sequences. Moreover, the method eliminates the necessity for extensive thermodynamic calculations. Melting temperature can be calculated only once (or not at all). In addition, the isostability of the sequences is independent of the selection of a particular set of thermodynamic parameters. Applications are presented for DNA sequence designs for microarrays, universal microarray zip sequences and electron transfer experiments.

Algorithms↗
PubMed1999

Strategies toward predicting peptide cellular permeability from computed molecular descriptors.

The therapeutic efficacy of an orally administered drug is dictated not only by its pharmacological properties such as potency and selectivity, but also its pharmacokinetic properties such as its access to the site of activity. Thorough evaluation of the physicochemical and biological barriers to drug delivery is essential to the selection and successful development of drug candidates. We have demonstrated previously that cellular permeability, as a primary component of drug delivery, is principally dependent upon the desolvation potential of the polar functionalities in the molecule and, secondarily, upon the solute lipophilicity [Conradi, R.A., Hilgers, A.R., Ho, N.F.H., Burton, P.S. (1992). The influence of peptide structure on transport across Caco-2 cells. II. Peptide bond modification which results in improved permeability. Pharm. Res. 9, 473-479]. Increasingly sophisticated computational methods are becoming available for describing molecular structural features proposed to correlate with such molecular physicochemical determinants of permeability. Herein we examine the relationships of various computationally derived molecular geometric descriptors for a set of peptides and peptidomimetics, in the context of experimentally measured hydrogen-bond potentials and lipophilicities, with their cellular permeabilities. These descriptors include molecular volume, polar and non-polar surface areas and projected molecular cross-sectional areas. Particular attention is paid to the roles of solvation treatments and other computational factors in descriptor generation, deconvolution of cellular transport mechanisms and statistical analyses of the resulting data for the development of valid, structure-based and mechanistically meaningful models of cellular permeability. No significant correlation of cellular permeability with computed descriptors was found. This was primarily because of our inability to identify surrogates for hydrogen-bond desolvation potential for the solutes from among these descriptors.

Adenocarcinoma↗
PubMed1999

Length bounded molecular computing.

The length of DNA strands is an important resource in DNA computing. We show how to decrease strand lengths in known molecular algorithms for some NP-complete problems, such as like 3-SAT and Independent Set, without substantially increasing their running time or volume.

Algorithms↗
PubMed2004

Vicinal disulfide bridge conformers by experimental methods and by ab initio and DFT molecular computations.

A systematic comparison is made between experimental and computational data gained on vicinal disulfide bridges in proteins and peptides. Structural and stability data of ab initio and density functional theory (DFT) calculations on the model compound 4,5-ditiaheptano-7-lactam and the model peptide HCO-ox-[Cys-Cys]-NH2 at RHF/3-21G*, B3LYP/6-31+G(d), and B3LYP/6-311++G(d,p) levels of theory are presented. The data on Xxx-Cys-Cys-Yyy type amino acid sequence units retrieved from PDB SELECT, along with data on sequence units that have vicinal disulfide bridge, taken from the Brookhaven Protein Data Bank, are conformationally characterized. Amino acid backbone conformations, cis-trans isomerism of the amide bond between the two cysteine residues, and ring puckering are studied. Ring puckers are characterized by their relation to the conformers of the parent 4,5-ditiaheptano-7-lactam. Computational precision and accuracy are proved by frequency calculation and solvent model optimization on selected conformers. It is found that the ox-[Cys-Cys] unit is able to accept types I, II, VIa, VIb, and VIII beta-turn structures.

Amino Acids↗