Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Graph”

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 1,297 records · Page 72Linked to original sources

Simulation of 'hitch-hiking' genealogies.

An ancestral influence graph is derived, an analogue of the coalescent and a composite of Griffiths' (1991) two-locus ancestral graph and Krone and Neuhauser's (1997) ancestral selection graph. This generalizes their use of branching-coalescing random graphs so as to incorporate both selection and recombination into gene genealogies. Qualitative understanding of a 'hitch-hiking' effect on genealogies is pursued via diagrammatic representation of the genealogical process in a two-locus, two-allele haploid model. Extending the simulation technique of Griffiths and Tavare (1996), computational estimation of expected times to the most recent common ancestor of samples of n genes under recombination and selection in two-locus, two-allele haploid and diploid models are presented. Such times are conditional on sample configuration. Monte Carlo simulations show that 'hitch-hiking' is a subtle effect that alters the conditional expected depth of the genealogy at the linked neutral locus depending on a mutation-selection-recombination balance.

Algorithms↗

A new method of assessing anal sphincter integrity using inverted vectormanometry.

PURPOSE: Vectorgraphy as an integrated mapping of radial pressure profiles of the anal canal has been used to attempt identification of pressure-related defects with doubtful reliability since vectorgraphs bear no resemblance to endoanal ultrasound scans at similar levels in the anal canal. This study aimed to devise a technique to enable vectorgraphy to be more representative of sphincter function and integrity. METHODS: Vectormanometry was performed in 50 patients with anorectal disorders using an Arndorfer pneumohydraulic system. "Normal" three-dimensional manometric images of each 0.5 cm of the anal sphincter were computer-generated by plotting anal pressures at rest and during squeeze radially around a central zero axis. The graphs were replotted with zero at the periphery and maximal anal pressure at the center. Both this ("inverted") and "normal" vectorgraphs were compared with endoanal ultrasound images at similar levels, assessing both internal and external anal sphincters. RESULTS: Standard vectormanometry produced excellent pictures of pressures throughout the anal canal; the anatomy however bore no resemblance to the pictures produced by endoanal ultrasound. The inverted vectographs showed a much better correlation with endoanal ultrasound at each 0.5-mm level of the anal canal, for both squeeze pressure graphs and external sphincter correlations and for resting pressure graphs and internal sphincter correlations. CONCLUSIONS: Accurate assessment of sphincter integrity is not possible when interpreting the vectormanometry graphs in the current format; however, inverted vectorgraphy gives good correlations with endoanal ultrasound and provides combined functional (pressure measurement) and anatomic (three-dimensional profile) information regarding the anal canal.

Adult↗

Graphical display of categorical data.

Categorical data are usually displayed in medical publications with pie graphs and bar graphs. We here consider some of the problems that occur in displaying the rank, magnitude, width, and spacing of categorical data. A solution to some of these problems is offered by the dot chart, which has been used in other scientific literature, but not in medical publications. The dot chart can be a preferred alternative to pie graphs and offers a useful alternative to bar graphs. Dot charts can also be helpful in displaying categorical data for two groups.

Data Display↗

GeneMCL in microarray analysis.

Accurately and reliably identifying the actual number of clusters present with a dataset of gene expression profiles, when no additional information on cluster structure is available, is a problem addressed by few algorithms. GeneMCL transforms microarray analysis data into a graph consisting of nodes connected by edges, where the nodes represent genes, and the edges represent the similarity in expression of those genes, as given by a proximity measurement. This measurement is taken to be the Pearson correlation coefficient combined with a local non-linear rescaling step. The resulting graph is input to the Markov Cluster (MCL) algorithm, which is an elegant, deterministic, non-specific and scalable method, which models stochastic flow through the graph. The algorithm is inherently affected by any cluster structure present, and rapidly decomposes a graph into cohesive clusters. The potential of the GeneMCL algorithm is demonstrated with a 5,730 gene subset (IGS) of the Van't Veer breast cancer database, for which the clusterings are shown to reflect underlying biological mechanisms.

Algorithms↗

Mathematical approaches to differentiation and gene regulation.

We consider some mathematical issues raised by the modelling of gene networks. The expression of genes is governed by a complex set of regulations, which is often described symbolically by interaction graphs. These are finite oriented graphs where vertices are the genes involved in the biological system of interest and arrows describe their interactions: a positive (resp. negative) arrow from a gene to another represents an activation (resp. inhibition) of the expression of the latter gene by some product of the former. Once such an interaction graph has been established, there remains the difficult task to decide which dynamical properties of the gene network can be inferred from it, in the absence of precise quantitative data about their regulation. There mathematical tools, among others, can be of some help. In this paper we discuss a rule proposed by Thomas according to which the possibility for the network to have several stationary states implies the existence of a positive circuit in the corresponding interaction graph. We prove that, when properly formulated in rigorous terms, this rule becomes a theorem valid for several different types of formal models of gene networks. This result is already known for models of differential [C. Soulé, Graphic requirements for multistationarity, ComPlexUs 1 (2003) 123-133] or Boolean [E. Rémy, P. Ruet, D. Thieffry, Graphic requirements for multistability and attractive cycles in a boolean dynamical framework, 2005, Preprint] type. We show here that a stronger version of it holds in the differential setup when the decay of protein concentrations is taken into account. This allows us to verify also the validity of Thomas' rule in the context of piecewise-linear models. We then discuss open problems.

Cell Differentiation↗

Ongoing visual analog score display improves Emergency Department pain care.

The study purpose was to test two methods of pain assessment and display: ongoing (11 times over 2 h) visual analog scale (VAS) determination with data tabulation in the ED chart (Tabulation group), and similar VAS assessments with display of the information at the head of the ED bed (Graph group). A Control group had initial and 2-h VAS ascertainments charted (not graphed). Tertiary-care university-affiliated ED patients were randomized into the three groups and pain care outcomes assessed. Compared to Controls, those in the Graph group had the following findings (p < 0.05): 1) treating physicians more likely aware of initial and final VAS scores, 2) earlier analgesia, 3) likelier perception (by patients and physicians) that VAS was useful and likelier patient perception that pain care was adequate. Tabulation group results were intermediate to those of Control and Graph patients. The data support further investigation of VAS display as a means of improving ED pain assessment.

Adult↗

Autocatalytic sets of proteins.

This article investigates the possibility that the emergence of reflexively autocatalytic sets of peptides and polypeptides may be an essentially inevitable collective property of any sufficiently complex set of polypeptides. The central idea is based on the connectivity properties of random directed graphs. In the set of amino acid monomer and polymer species up to some maximum length, M, the number of possible polypeptides is large, but, for specifiable "legitimate" end condensation, cleavage and transpeptidation exchange reactions, the number of potential reactions by which the possible polypeptides can interconvert is very much larger. A directed graph in which arrows from smaller fragments to larger condensation products depict potential synthesis reactions, while arrows from the larger peptide to the smaller fragments depict the reverse cleavage reactions, comprises the reaction graph for such a system. Polypeptide protoenzymes are able to catalyze such reactions. The distribution of catalytic capacities in peptide space is a fundamental problem in its own right, and in its bearing on the existence of autocatalytic sets of proteins. Using an initial idealized hypothesis that an arbitrary polypeptide has a fixed a priori probability of catalyzing any arbitrary legitimate reaction to assign to each polypeptide those reactions, if any, which it catalyzes, the probability that the set of polypeptides up to length M contains a reflexively autocatalytic subset can be calculated and is a percolation problem on such reaction graphs. Because, as M increases, the ratio of reactions among the possible polypeptides to polypeptides rises rapidly, the existence of such autocatalytic subsets is assured for any fixed probability of catalysis. The main conclusions of this analysis appear independent of the idealizations of the initial model, introduce a novel kind of parallel selection for peptides catalyzing connected sequences of reactions, depend upon a new kind of minimal critical complexity whose properties are definable, and suggest that the emergence of self replicating systems may be a self organizing collective property of critically complex protein systems in prebiotic evolution. Similar principles may apply to the emergence of a primitive connected metabolism. Recombinant DNA procedures, cloning random DNA coding sequences into expression vectors, afford a direct avenue to test the distribution of catalytic capacities in peptide space, may provide a new means to select or screen for peptides with useful properties, and may ultimately lead toward the actual construction of autocatalytic peptide sets.

Amino Acids↗

[Risk percentiles: a new adapted method for evaluating vascular risk. ERVPA study].

BACKGROUND AND OBJECTIVE: Various cardiovascular scoring systems estimating the risk in the Spanish population are currently used. The aim of our study was to create graphs and charts of populational percentiles to assess the total burden of risk of a population and to place each subject individually in the context of their own population setting by using cardiovascular risk charts. SUBJECTS AND METHOD: A cross-sectional study of 514 individuals of both sexes from a general population setting was carried out. Cardiovascular risk was calculated according to the SCORE project equations and charts and graphs of cardiovascular risk were formulated. RESULTS: In primary prevention, 17.11% of men and 22.36% of women aged 20-79 showed a high cardiovascular risk. The percentages vary from 0% in persons of both sexes aged 20-39 to 91.2% of men and 97.9% of women in their 70s. Risk medians range in men from 0.11% (age 20-39) to 8.86% (age 70-79) and in women from 0.02% (age 20-39) to 15.20% (age 70-79). Graphs of cardiovascular risk percentiles were formulated for both sexes; graphs can be used to situate each subject individually in the context of their own population setting and to project the risk to any age. CONCLUSIONS: Nearly a fifth of the population has a high cardiovascular risk. More than 90% of men and women in their 70s have a high cardiovascular risk.

Adult↗

Measurement of the arc of digital flexion and joint movement ranges.

Dynamic digital flexion was examined by video recording healthy subjects making a fist. The arc of the fingertip sweep from full extension to full flexion was replayed frame by frame and plotted. A similar technique was employed to measure the MP, PIP and DIP joint angles throughout digital flexion. Graphs were plotted of MP against PIP, and PIP against DIP flexion. These results were related to a theoretical 45 degrees line. The fingertip appears to sweep through an elliptical pathway when flexing, rather than an equiangular curve. Graphs of joint flexion showed that male and female fingers flex in a similar fashion, as do the index and little finger. Graphs of PIP against DIP flexion suggest some limiting mechanism of either the extensor or flexor system. These graphs give useful insights into the complex mechanisms of dynamic digital flexion, and may be of diagnostic and prognostic importance.

Adult↗

Three dimensional DNA structures in computing.

We show that 3-dimensional graph structures can be used for solving computational problems with DNA molecules. Vertex building blocks consisting of k-armed (k = 3 or 4) branched junction molecules are used to form graphs. We present procedures for the 3-SAT and 3-vertex-colorability problems. Construction of one graph structure (in many copies) is sufficient to determine the solution to the problem. In our proposed procedure for 3-SAT, the number of steps required is equal to the number of variables in the formula. For the 3-vertex-colorability problem, the procedure requires a constant number of steps regardless of the size of the graph.

Animals↗

Exhaustive generation of organic isomers. 6. Stereoisomers having isolated and spiro cycles and new extended N_tuples.

A new stereoisomer generation system named CAMGEC2 for generation of stereoisomers containing isolated and spiro cycles with one or more descriptors among R, S, Z, E, M, and P is developed using Graph Theory. It includes new approaches for symmetry analysis, cycle detection processes in molecular graphs in a modular way, and also an extension of the N_tuple format for linear representation of molecular graphs that keeps graph topographical information.

Journal Article↗

Counterexamples in chemical ring perception.

Ring information is a large part of the structural topology used to identify and characterize molecular structures. It is hence of crucial importance to obtain this information for a variety of tasks in computational chemistry. Many different approaches for "ring perception", i.e., the extraction of cycles from a molecular graph, have been described. The chemistry literature on this topic, however, reports a surprisingly large number of incorrect statements about the properties of chemically relevant ring sets and, in particular, about the mutual relationships of different sets of cycles in a graph. In part these problems seem to have arisen from a sometimes rather idiosyncratic terminology for notions that are fairly standard in graph theory. In this contribution we translate the definitions of concepts such as the Smallest Set of Smallest Rings, Essential Set of Essential Rings, Extended Set of Smallest Rings, Set of Smallest Cycles at Edges, Set of Elementary Rings, K-rings, and beta-rings into a more widely used mathematical language. We then outline the basic properties of different cycle sets and provide numerous counterexamples to incorrect claims in the published literature. These counterexamples may have a serious practical impact because at least some of them are molecular graphs of well-known molecules. As a consequence, we propose a catalog of desirable properties for chemically useful sets of rings.

Journal Article↗

The classification of graphical elements.

In three experiments, participants classified stimuli depicting pie charts and stacked bar graphs on two criteria: a proportion shown in the graph, and the graph's overall size (scaling). Sorting times and errors were measured. For stacked bars, performance was impaired when participants sorted on the proportion and scaling varied. No such impairment occurred for pie charts. Experiment 1 showed that varying scaling produced Garner interference in classification of proportions with stacked bars, but not pies. Experiment 2 showed that this result held when the position of the pie slice was varied; Experiment 3 results showed facilitation for particular combinations of proportion and scaling levels. In general, the results showed that proportion and scaling had an asymmetric integral relation for stacked bar graphs, but were separable dimensions for pie charts.

Attention↗

Graphical evaluation of blood-to-brain transfer constants from multiple-time uptake data.

A theoretical model of blood-brain exchange is developed and a procedure is derived that can be used for graphing multiple-time tissue uptake data and determining whether a unidirectional transfer process was dominant during part or all of the experimental period. If the graph indicates unidirectionality of uptake, then an influx constant (Ki) can be calculated. The model is general, assumes linear transfer kinetics, and consists of a blood-plasma compartment, a reversible tissue region with an arbitrary number of compartments, and one or more irreversible tissue regions. The solution of the equations for this model shows that a graph of the ratio of the total tissue solute concentration at the times of sampling to the plasma concentration at the respective times (Cp) versus the ratio of the arterial plasma concentration-time integral to Cp should be drawn. If the data are consistent with this model, then this graph will yield a curve that eventually becomes linear, with a slope of Ki and an ordinate intercept less than or equal to the vascular plus steady-state space of the reversible tissue region.

Blood-Brain Barrier↗

Modelling disease outbreaks in realistic urban social networks.

Most mathematical models for the spread of disease use differential equations based on uniform mixing assumptions or ad hoc models for the contact process. Here we explore the use of dynamic bipartite graphs to model the physical contact patterns that result from movements of individuals between specific locations. The graphs are generated by large-scale individual-based urban traffic simulations built on actual census, land-use and population-mobility data. We find that the contact network among people is a strongly connected small-world-like graph with a well-defined scale for the degree distribution. However, the locations graph is scale-free, which allows highly efficient outbreak detection by placing sensors in the hubs of the locations network. Within this large-scale simulation framework, we then analyse the relative merits of several proposed mitigation strategies for smallpox spread. Our results suggest that outbreaks can be contained by a strategy of targeted vaccination combined with early detection without resorting to mass vaccination of a population.

Contact Tracing↗

[Diagnosis of glomus jugulare tumor recurrence with dynamic contrast medium flow in MRI].

PURPOSE: To evaluate the ability of dynamic MRI to differentiate residual tumor from scar after glomus jugulare (GJ) surgery. METHODS: 26 patients after GJ surgery were examined with dynamic contrast medium MRI on a 1.5 T Philips-Gyro-Scan NT. A T1-weighted TFE sequence was performed to localise the 5 slices for the dynamic study. Subsequently, a T1-weighted TFE sequence was used for the dynamic contrast medium study. We started contrast medium administration and TFE sequence at the same time. The time until acquisition of the first image was 7.4 s, and the interval between two images 7 s (total time 2.24 min). Intensity versus time studies were performed in the region of interest. RESULTS: 2 typical intensity versus time graphs were observed: residual tumors showed a rapid increase in signal intensity, followed by a "wash-out" phase, and a plateau phase in the later course. Scar showed a moderate increase in signal intensity, followed by a plateau phase on a low intensity level. In 9 patients, in whom tumor removal was subtotal, we saw the typical graph of a GJ tumor. 4 of 17 patients with complete tumor removal showed a typical graph like that of residual tumor, 13 of 17 patients showed the typical graph of a scar. CONCLUSION: With dynamic contrast medium MRI studies, differentiation between residual tumor and scar is possible in patients with prior GJ surgery.

Cicatrix↗

Course of pubic tubercle--centre of testicle distance in children with and without testicular maldescent.

The aim of this study was to establish whether a more precise classification of the different types of testicular maldescent could be made by using the measurement of pubic tubercle-centre of testicle distance. The pubic tubercle-centre of testicle distance was determined in 77 healthy children. The results were obtained in children aged 1 month to 15 years. The results were compared to the distances obtained in 47 children with testicular maldescent. The distance between pubic tubercle and centre of testicle represents an objective parameter in the examination of testicular maldescent. It is used to determine the testicular position precisely, and by comparing it to our graphs of normal values, it is possible to find pathological results. Our graphs of normal values for pubic tubercle-centre of testicle distance for different age groups, weight groups and body length groups in children can also be used to record the effect of hormonal or surgical therapy. Surprisingly there exists no obvious growth of the pubic tubercle-centre of testicle distance within the first seven years of life. By comparing the measurement of the pubic tubercle-centre of testicle distance of a child with testicular maldescent to our graphs of normal values, it is easy to find an objective parameter for the initiation of therapy, or for the decision to wait and see. By comparing a series of measurements of one case to our graphs of normal values, it is possible to set ideal intervals for consultations.

Adolescent↗

Design of a directed molecular network.

An ability to rationally design complex networks from the bottom up can offer valuable quantitative model systems for use in gaining a deeper appreciation for the principles governing the self-organization and functional characteristics of complex systems. We report herein the de novo design, graph prediction, experimental analysis, and characterization of simple self-organized, nonlinear molecular networks. Our approach makes use of the sequence-dependent auto- and cross-catalytic functional characteristics of template-directed peptide fragment condensation reactions in neutral aqueous solutions. Starting with an array of 81 sequence similar 32-residue coiled-coil peptides, we estimated the relative stability difference between all plausible A(2)B-type coiled-coil ensembles and used this information to predict the auto- and cross-catalysis pathways and the resulting plausible network motif and connectivities. Similar to most complex systems, the generated graph displays clustered nodes with an overall hierarchical architecture. To test the validity of the design principles used, nine nodes composing a main segment of the graph were experimentally analyzed for their capacity in establishing the predicted network connectivity. The resulting self-organized chemical network is shown to display 25 directed edges in good agreement with the graph analysis estimations. Moreover, we show that by varying the system parameters (presence or absence of certain substrates or templates), its operating network motif can be altered, even to the extremes of turning pathways on or off. We suggest that this approach can be expanded for the construction of large-scale networks, offering a means to study and to understand better the emergent, collective behaviors of networks.

Amino Acid Sequence↗