Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Network graphs”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

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

At least 811 records · Page 45Linked to original sources

Comparison of a neural net-based QSAR algorithm (PCANN) with Hologram- and multiple linear regression-based QSAR approaches: application to 1,4-dihydropyridine-based calcium channel antagonists.

A QSAR algorithm (PCANN) has been developed and applied to a set of calcium channel blockers which are of special interest because of their role in cardiac disease and also because many of them interact with P-glycoprotein, a membrane protein associated with multidrug resistance to anticancer agents. A database of 46 1,4-dihydropyridines with known Ca2+ channel binding affinities was employed for the present analysis. The QSAR algorithm can be summarized as follows: (1) a set of 90 graph theoretic and information theoretic descriptors representing various structural and topological characteristics was calculated for each of the 1,4-dihydropyridines and (2) principal component analysis (PCA) was used to compress these 90 into the eight best orthogonal composite descriptors for the database. These eight sufficed to explain 96% of the variance in the original descriptor set. (3) Two important empirical descriptors, the Leo-Hansch lipophilic constant and the Hammet electronic parameter, were added to the list of eight. (4) The 10 resulting descriptors were used as inputs to a back-propagation neural network whose output was the predicted binding affinity. (5) The predictive ability of the network was assessed by cross-validation. A comparison of the present approach with two other QSAR approaches (multiple linear regression using the same variables and a Hologram QSAR model) is made and shows that the PCANN approach can yield better predictions, once the right network configuration is identified. The present approach (PCANN) may prove useful for rapid assessment of the potential for biological activity when dealing with large chemical libraries.

Algorithms↗

Computational modeling of eukaryotic mRNA turnover.

The process of eukaryotic gene expression involves a diverse number of steps including transcription, RNA processing, transport, translation, and mRNA turnover. A critical step in understanding this process will be the development of mathematical models that quantitatively describe and predict the behavior of this complex system. We have simulated eukaryotic mRNA turnover in a linear multicomponent model based on the known mRNA decay pathways in yeast. Using rate constants based on experimental data for the yeast unstable MFA2 and stable PGK1 transcripts, the computational modeling reproduces experimental observations after minor adjustments. Subsequent analysis and a series of in silico experiments led to several conclusions. First, we demonstrate that mRNA half-life as commonly measured underestimates the average life span of an mRNA. Second, due to the properties of the pathways, the measurement of a half-life can predominantly measure different steps in the decay network. A corollary of this fact is that different mRNAs will be affected differentially by changes in specific rate constants. Third, the way to obtain the largest change of levels of mRNA for the smallest changes in rate is by changing the rate of deadenylation, where a large amount of regulation of mRNA decay occurs. Fourth, the 3'-to-5' degradation of mRNA shows mRNA-specific rates of degradation that are dependent on the 5' structure of the mRNA. These programs can be run over the Web, are adaptable to other eukaryotes, and provide outputs as graphs and virtual northern gels, which can be directly compared to experimental data. Therefore, this model constitutes a useful tool for the quantitative analysis of the process and control of mRNA degradation in eukaryotic cells.

Biological Transport↗

Clustering proteins from interaction networks for the prediction of cellular functions.

BACKGROUND: Developing reliable and efficient strategies allowing to infer a function to yet uncharacterized proteins based on interaction networks is of crucial interest in the current context of high-throughput data generation. In this paper, we develop a new algorithm for clustering vertices of a protein-protein interaction network using a density function, providing disjoint classes. RESULTS: Applied to the yeast interaction network, the classes obtained appear to be biological significant. The partitions are then used to make functional predictions for uncharacterized yeast proteins, using an annotation procedure that takes into account the binary interactions between proteins inside the classes. We show that this procedure is able to enhance the performances with respect to previous approaches. Finally, we propose a new annotation for 37 previously uncharacterized yeast proteins. CONCLUSION: We believe that our results represent a significant improvement for the inference of cellular functions, that can be applied to other organism as well as to other type of interaction graph, such as genetic interactions.

Cluster Analysis↗

Online predicted human interaction database.

MOTIVATION: High-throughput experiments are being performed at an ever-increasing rate to systematically elucidate protein-protein interaction (PPI) networks for model organisms, while the complexities of higher eukaryotes have prevented these experiments for humans. RESULTS: The Online Predicted Human Interaction Database (OPHID) is a web-based database of predicted interactions between human proteins. It combines the literature-derived human PPI from BIND, HPRD and MINT, with predictions made from Saccharomyces cerevisiae, Caenorhabditis elegans, Drosophila melanogaster and Mus musculus. The 23,889 predicted interactions currently listed in OPHID are evaluated using protein domains, gene co-expression and Gene Ontology terms. OPHID can be queried using single or multiple IDs and results can be visualized using our custom graph visualization program. AVAILABILITY: Freely available to academic users at http://ophid.utoronto.ca, both in tab-delimited and PSI-MI formats. Commercial users, please contact I.J. CONTACT: juris@ai.utoronto.ca SUPPLEMENTARY INFORMATION: http://ophid.utoronto.ca/supplInfo.pdf.

Database Management Systems↗

Multistationarity, the basis of cell differentiation and memory. II. Logical analysis of regulatory networks in terms of feedback circuits.

Circuits and their involvement in complex dynamics are described in differential terms in Part I of this work. Here, we first explain why it may be appropriate to use a logical description, either by itself or in symbiosis with the differential description. The major problem of a logical description is to find an adequate way to involve time. The procedure we adopted differs radically from the classical one by its fully asynchronous character. In Sec. II we describe our "naive" logical approach, and use it to illustrate the major laws of circuitry (namely, the involvement of positive circuits in multistationarity and of negative circuits in periodicity) and in a biological example. Already in the naive description, the major steps of the logical description are to: (i) describe a model as a set of logical equations, (ii) derive the state table from the equations, (iii) derive the graph of the sequences of states from the state table, and (iv) determine which of the possible pathways will be actually followed in terms of time delays. In the following sections we consider multivalued variables where required, the introduction of logical parameters and of logical values ascribed to the thresholds, and the concept of characteristic state of a circuit. This generalized logical description provides an image whose qualitative fit with the differential description is quite remarkable. A major interest of the generalized logical description is that it implies a limited and often quite small number of possible combinations of values of the logical parameters. The space of the logical parameters is thus cut into a limited number of boxes, each of which is characterized by a defined qualitative behavior of the system. Our analysis tells which constraints on the logical parameters must be fulfilled in order for any circuit (or combination of circuits) to be functional. Functionality of a circuit will result in multistationarity (in the case of a positive circuit) or in a cycle (in the case of a negative circuit). The last sections deal with "more about time delays" and "reverse logic," an approach that aims to proceed rationally from facts to models. (c) 2001 American Institute of Physics.

Journal Article↗

BioGRID: a general repository for interaction datasets.

Access to unified datasets of protein and genetic interactions is critical for interrogation of gene/protein function and analysis of global network properties. BioGRID is a freely accessible database of physical and genetic interactions available at http://www.thebiogrid.org. BioGRID release version 2.0 includes >116 000 interactions from Saccharomyces cerevisiae, Caenorhabditis elegans, Drosophila melanogaster and Homo sapiens. Over 30 000 interactions have recently been added from 5778 sources through exhaustive curation of the Saccharomyces cerevisiae primary literature. An internally hyper-linked web interface allows for rapid search and retrieval of interaction data. Full or user-defined datasets are freely downloadable as tab-delimited text files and PSI-MI XML. Pre-computed graphical layouts of interactions are available in a variety of file formats. User-customized graphs with embedded protein, gene and interaction attributes can be constructed with a visualization system called Osprey that is dynamically linked to the BioGRID.

Animals↗

Neural Network Computer Analysis of Fetal Heart Rate.

> Objective: A nonsubjective evaluation of intrapartum fetal heart rate (FHR) with a neural network (NNW) computer system and its clinical application. Methods: Eight simple FHR data were input into the NNW computer after 16-step normalizations. The computer was composed of 40 units in the input layer, 30 in intermediate layer, and 3 in the output layer, and the probabilities to be normal, suspicious, and pathological were obtained at the output. Before use, the computer was trained 10,000 times by 50-min teacher FHR data of 20 cases with known outcomes. The trained NNW computer was tested by FHRs of another 29 cases. The outcome probabilities in 15 min were calculated every 5 min in another 10 cases, and the bar graphs of the probabilities were displayed in sequence in the trendgrams. Results: The trained NNW computer was 100% accurate in the internal check; in the external check 86% of the results were evaluated correctly with the cardiotocogram, Apgar score, and umbilical arterial pH of the 29 test cases. The FHR scores of our conventional computer FHR analysis were higher in the suspicious and pathological groups than the normal group, and the fetal distress index was high in the pathological group. The trendgrams were simply accurate in typically normal or abnormal cases, transitory abnormal probabilities were shown in intermediate cases, and mixed suspicious and pathological probabilities suggested pathological outcome. Conclusions: The outcome probabilities and their trendgrams in the NNW FHR analysis are promising in objective decision making in the intrapartum stage.

Journal Article↗

Mapping topics and topic bursts in PNAS.

Scientific research is highly dynamic. New areas of science continually evolve; others gain or lose importance, merge, or split. Due to the steady increase in the number of scientific publications, it is hard to keep an overview of the structure and dynamic development of one's own field of science, much less all scientific domains. However, knowledge of "hot" topics, emergent research frontiers, or change of focus in certain areas is a critical component of resource allocation decisions in research laboratories, governmental institutions, and corporations. This paper demonstrates the utilization of Kleinberg's burst detection algorithm, co-word occurrence analysis, and graph layout techniques to generate maps that support the identification of major research topics and trends. The approach was applied to analyze and map the complete set of papers published in PNAS in the years 1982-2001. Six domain experts examined and commented on the resulting maps in an attempt to reconstruct the evolution of major research areas covered by PNAS.

Algorithms↗

Body movements and retinal pattern displacements while approaching a stationary object in the walking fly, Calliphora erythrocephala.

When a walking fly approaches a stationary object two types of body movements are distinguishable. Type I body movements are characterized by low frequencies (0.4-1.3 Hz) and large amplitudes (28-65 degrees). Superimposed on these movements are type II body movements which are characterized by high frequencies (7.3-10.6 Hz) and small amplitudes (5.9-8.2 degrees) (Figs. 3-6; Table 1). Type II movements occur no matter whether the fly is fixating a pattern or orientating itself in homogeneous surroundings without any pattern. In contrast, only 72% of the flies with immobilized heads and 62% of the flies with movable heads make type I body movements. The amplitude of type I and type II body movements increases slightly after immobilization of the head. Binocular as well as monocular pattern projection occurs for the whole walking trajectory (Fig. 7-9). Monocular pattern projection seems to be more frequent in flies with immobilized heads than in those with movable heads. The degree of pattern fluctuations in the visual field of the flies increases slightly along the walking trajectory. Near the starting point in the centre of the arena it amounts to 5-7 degrees, while at the end of the walking trajectory it amounts to 8-10 degrees (Table 2). The following conclusions and hypothesis can be drawn from these experiments. 1. The graph BT for the direction of the fly's longitudinal axis can be approximated by the first derivative of the walking trajectory WT, that means, dWT(x)dx approximately BT(x) (Fig. 11) 2. The amplitudes of type II body movements are caused by the alternating movements of the legs during forward motion, while type I body movements are classified as exploring movements. During evolution of visually guided behaviour it is possible that blowflies have adapted their elementary movement detector system to type II body movements. 3. The types of pattern projection into the visual field of the fly while approaching an object can be explained by a simple neuronal network characterized by either inhibitory and/or excitatory influences of the visually activated neurones on the motor neurones generating the propulsive forces, that means the forward motion. In addition it is postulated that the large frontal and antero-lateral receptive fields of these neurones are not coupled with the motor centres on the same side of the body (Fig 12).

Animals↗

[An automated electronic anesthesia record and automated urine output measurement].

We can now collect many parameters (NIBP, HR, ABP, SpO2, EtCO2, CCO, etc) from an anesthesia monitor in an automated electronic anesthesia record system. The function of automated urine output measurement has been added to an automated electronic anesthesia record system. A digital weight meter connected with a personal computer by RS-232 C is used to measure the weight of urine. We convert the weight to the volume hypothesizing that the density of urine is 1 g.ml-1. Physiologic parameters are recorded every 10 seconds from an anesthesia monitor and we can set the period of automated urine output measurement we like. We must enter the initial and final urine output but the intraoperative urine output is collected automatically to an automated electronic anesthesia record and visualized in urine bar graph. The total volume of urine is calculated. Computerized urine output measurement can record data more frequently, for example, every 10 minute. At the end of the operation, intraoperative data are sent to a host computer and the anesthesia record is printed. Combining the automated urine output measurement with an automated electronic anesthesia record system is useful in anesthesia practice of a long operation.

Anesthesia↗

The KEGG databases at GenomeNet.

The Kyoto Encyclopedia of Genes and Genomes (KEGG) is the primary database resource of the Japanese GenomeNet service (http://www.genome.ad.jp/) for understanding higher order functional meanings and utilities of the cell or the organism from its genome information. KEGG consists of the PATHWAY database for the computerized knowledge on molecular interaction networks such as pathways and complexes, the GENES database for the information about genes and proteins generated by genome sequencing projects, and the LIGAND database for the information about chemical compounds and chemical reactions that are relevant to cellular processes. In addition to these three main databases, limited amounts of experimental data for microarray gene expression profiles and yeast two-hybrid systems are stored in the EXPRESSION and BRITE databases, respectively. Furthermore, a new database, named SSDB, is available for exploring the universe of all protein coding genes in the complete genomes and for identifying functional links and ortholog groups. The data objects in the KEGG databases are all represented as graphs and various computational methods are developed to detect graph features that can be related to biological functions. For example, the correlated clusters are graph similarities which can be used to predict a set of genes coding for a pathway or a complex, as summarized in the ortholog group tables, and the cliques in the SSDB graph are used to annotate genes. The KEGG databases are updated daily and made freely available (http://www.genome.ad.jp/kegg/).

Animals↗

Linear response algorithms for approximate inference in graphical models.

Belief propagation (BP) on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. However, it does not prescribe a way to compute joint distributions over pairs of distant nodes in the graph. In this article, we propose two new algorithms for approximating these pairwise probabilities, based on the linear response theorem. The first is a propagation algorithm that is shown to converge if BP converges to a stable fixed point. The second algorithm is based on matrix inversion. Applying these ideas to gaussian random fields, we derive a propagation algorithm for computing the inverse of a matrix.

Algorithms↗

Synaptic feedback excitation has hypothalamic neural networks generate quasirhythmic burst activity.

1. Dissociated neurons from embryonic rat hypothalamus form synaptically coupled networks when cultured for several weeks. When synaptic inhibition is suppressed by the gamma-aminobutyric acid-A (GABAA) antagonist picrotoxin, neurons exhibit "rhythmic" burst activity that is blocked by the glutamate receptor antagonist 6-cyano-7-nitroquinoxaline-2,3-dione (CNQX). 2. We have examined whether this type of activity is generated by pacemaker cells driving follower cells synaptically or whether it is generated by a neuronal network through feedback excitation by Ca2+ imaging of Fura-2/AM-loaded neurons and single-cell recording. 3. IN the presence of the GABAA antagonist picrotoxin (20 microM), a large majority of neurons (> 85%) displayed quasirhythmic increases in intracellular concentration of Ca2+ ([Ca2+]i). Single-cell recording revealed that these increases in [Ca2+]i correspond to burst discharges in individual neurons. When excitatory synaptic transmission was blocked by CNQX (20 microM), none of the imaged neurons exhibited significant oscillations in [Ca2+]i. 4. Investigation of the intervals between bursts from single-cell recording revealed a random distribution over a range of 400% from the minimum interval. Poincaré maps of burst intervals, i.e., graphs of all burst intervals versus their preceding burst interval, revealed that a burst interval is unpredictable from its predecessor. 5. When synaptic coupling was attenuated by low concentrations of CNQX (50-500 nM), the mean burst interval was considerably increased without a change in the random character of burst activity. 4-Aminopyridine (1 mM), known to increase synaptic efficiency, reduced the mean burst interval.(ABSTRACT TRUNCATED AT 250 WORDS)

6-Cyano-7-nitroquinoxaline-2,3-dione↗

Coupled high-performance liquid chromatography-gas chromatography for the determination of pesticide residues in biological matrices.

A fully automated high-performance liquid chromatography-gas chromatography (HPLC-GC) network is described. A ten-port valve set up as a loop type LC-GC interface allowed the transfer of large LC effluent fractions into the gas chromatograph by concurrent solvent evaporation. The system performed highly efficient sample enrichment and clean up by LC and on-line GC separation with sensitive electron-capture detection. The efficiency of the system was demonstrated by application to the trace analysis of N-(3-chloro-2,6-dimethylphenyl)-N-(2-oxotetrahydrofuranyl)-2-me thoxyacetamide (CGA 80000) in various crops and soil samples. The residue level determined was 0.02 mg/kg for crop samples and 0.01 mg/kg for soil samples. The relative standard deviations of the calibration graphs were in the range 2-5%; the mean recovery was greater than 85%.

Acetamides↗

On the structural complexity of a protein.

The determination of the configuration of a protein in three-dimensional (3D) space constitutes one of the major challenges in molecular biology research today. A method consists in choosing a protein structure from a database that minimizes an energy function. First, we model the problem in terms of dynamic programming and show that the determination of the order in which the variables must be considered to minimize the time complexity is an NP-hard problem. Second, we propose a new decomposition algorithm of the threading problem that is based on the connectivity of the graph induced by the 3D structure of a protein. Our decomposition could be used to solve the threading problem. The goal in this paper is to evaluate the intrinsic complexity of 3D structure, which can be viewed as information that may be incorporated into a solution method. It provides two indexes of complexity (time and space) and determines in polynomial time complex components of the 3D structure of a protein.

Algorithms↗

Drug release of pH/temperature-responsive calcium alginate/poly(N-isopropylacrylamide) semi-IPN beads.

A series of semi-interpenetrating, polymer network (semi-IPN), hydrogel beads, composed of calcium alginate (Ca-alginate) and poly(N-isopropylacrylamide) (PNIPAAM), were prepared for a pH/temperature-sensitive drug delivery study. The equilibrium swelling showed the independent pH- and thermo- responsive nature of the developed materials. At pH=2.1, the release amount of indomethacin incorporated into these beads was about 10% within 400 min, while this value approached to 95% at pH=7.4. The release rate of the drug was higher at 37 degrees C than that at 25 degrees C and increased slightly with increasing PNIPAAM content. These results suggest that the Ca-alginate/PNIPAAM beads have the potential to be used as an effective pH/temperature sustainable delivery system of bioactive agents. [GRAPHS: SEE TEXT] A summary of the temperature- and pH-dependence on the release of the drug over a period of 450 min. The effect of the temperature on the swelling of the beads is shown in the inset.

Acrylic Resins↗

The learning curve in stapes surgery and its implication to training.

OBJECTIVE: To identify the stapedotomy learning curve of two U.K. otolaryngologists. STUDY DESIGN: A retrospective review of the outcome of first 100 stapedotomy operations by each surgeon. Included in the study was a postal survey of the incidence of stapes surgery by U.K. otolaryngologists. SETTING: Two tertiary referral centers. PATIENTS: All ears in which primary stapedotomy was performed for otosclerosis. Nonotosclerotic cases and malleus stapedotomy cases were excluded. INTERVENTION: One surgeon used the technique of small fenestra stapedotomy with either a Teflon-wire or titanium piston but without vein graft interposition, whereas the second used the technique of stapedotomy with vein graft interposition and a Teflon piston. MAIN OUTCOME MEASURES: A moving average with a window of 15 dB was used to plot learning curves for the postoperative air-bone gaps. Using a postoperative air-bone gap of 20 dB or better as a definition of 'success,' the success rates with the increase in surgical experience of both surgeons were plotted on graphs, the learning curves. The end point of the learning curve was defined as the point where the curve reached its peak, and the results were sustainable. RESULTS: There was no clear-cut end point in both learning curves, although it appears that there is a landmark point at 60 to 80 cases for both surgeons. Both surgeons also had one "dead ear" in their first 15 cases. The postal survey showed that some trainers only performed small numbers of stapes surgery, whereas some otolaryngologists who performed stapedotomies regularly were not trainers. CONCLUSIONS: The study supports a learning curve in stapes surgery. To maximize the training opportunity of trainee surgeons, it may be advisable for learning centers to form network to provide target training for the trainee who has demonstrated the necessary dexterity and temperament of an otologist.

Adult↗

Estimation and marginalization using the Kikuchi approximation methods.

In this letter, we examine a general method of approximation, known as the Kikuchi approximation method, for finding the marginals of a product distribution, as well as the corresponding partition function. The Kikuchi approximation method defines a certain constrained optimization problem, called the Kikuchi problem, and treats its stationary points as approximations to the desired marginals. We show how to associate a graph to any Kikuchi problem and describe a class of local message-passing algorithms along the edges of any such graph, which attempt to find the solutions to the problem. Implementation of these algorithms on graphs with fewer edges requires fewer operations in each iteration. We therefore characterize minimal graphs for a Kikuchi problem, which are those with the minimum number of edges. We show with empirical results that these simpler algorithms often offer significant savings in computational complexity, without suffering a loss in the convergence rate. We give conditions for the convexity of a given Kikuchi problem and the exactness of the approximations in terms of the loops of the minimal graph. More precisely, we show that if the minimal graph is cycle free, then the Kikuchi approximation method is exact, and the converse is also true generically. Together with the fact that in the cycle-free case, the iterative algorithms are equivalent to the well-known belief propagation algorithm, our results imply that, generically, the Kikuchi approximation method can be exact if and only if traditional junction tree methods could also solve the problem exactly.

Algorithms↗