Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Computer Graphics”

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,729 records · Page 96Linked to original sources

Decomposition of metabolic network into functional modules based on the global connectivity structure of reaction graph.

MOTIVATION: Metabolic networks are organized in a modular, hierarchical manner. Methods for a rational decomposition of the metabolic network into relatively independent functional subsets are essential to better understand the modularity and organization principle of a large-scale, genome-wide network. Network decomposition is also necessary for functional analysis of metabolism by pathway analysis methods that are often hampered by the problem of combinatorial explosion due to the complexity of metabolic network. Decomposition methods proposed in literature are mainly based on the connection degree of metabolites. To obtain a more reasonable decomposition, the global connectivity structure of metabolic networks should be taken into account. RESULTS: In this work, we use a reaction graph representation of a metabolic network for the identification of its global connectivity structure and for decomposition. A bow-tie connectivity structure similar to that previously discovered for metabolite graph is found also to exist in the reaction graph. Based on this bow-tie structure, a new decomposition method is proposed, which uses a distance definition derived from the path length between two reactions. An hierarchical classification tree is first constructed from the distance matrix among the reactions in the giant strong component of the bow-tie structure. These reactions are then grouped into different subsets based on the hierarchical tree. Reactions in the IN and OUT subsets of the bow-tie structure are subsequently placed in the corresponding subsets according to a 'majority rule'. Compared with the decomposition methods proposed in literature, ours is based on combined properties of the global network structure and local reaction connectivity rather than, primarily, on the connection degree of metabolites. The method is applied to decompose the metabolic network of Escherichia coli. Eleven subsets are obtained. More detailed investigations of the subsets show that reactions in the same subset are really functionally related. The rational decomposition of metabolic networks, and subsequent studies of the subsets, make it more amenable to understand the inherent organization and functionality of metabolic networks at the modular level. SUPPLEMENTARY INFORMATION: http://genome.gbf.de/bioinformatics/

Algorithms↗

Inferring dynamic architecture of cellular networks using time series of gene expression, protein and metabolite data.

MOTIVATION: High-throughput technologies have facilitated the acquisition of large genomics and proteomics datasets. However, these data provide snapshots of cellular behavior, rather than help us reveal causal relations. Here, we propose how these technologies can be utilized to infer the topology and strengths of connections among genes, proteins and metabolites by monitoring time-dependent responses of cellular networks to experimental interventions. RESULTS: We demonstrate that all connections leading to a given network node, e.g. to a particular gene, can be deduced from responses to perturbations none of which directly influences that node, e.g. using strains with knock-outs to other genes. To infer all interactions from stationary data, each node should be perturbed separately or in combination with other nodes. Monitoring time series provides richer information and does not require perturbations to all nodes. Overall, the methods we propose are capable of deducing and quantifying functional interactions within and across cellular gene, signaling and metabolic networks. SUPPLEMENTARY INFORMATION: Supplementary material is available at http://www.dbi.tju.edu/bioinformatics2004.pdf

Algorithms↗

Pathway Miner: extracting gene association networks from molecular pathways for predicting the biological significance of gene expression microarray data.

UNLABELLED: We have developed a web-based system (Pathway Miner) for visualizing gene expression profiles in the context of biological pathways. Pathway Miner catalogs genes based on their role in metabolic, cellular and regulatory pathways. A Fisher exact test is provided as an option to rank pathways. The genes are mapped onto pathways and gene product association networks are extracted for genes that co-occur in pathways. The networks can be filtered for analysis based on user-selected options. AVAILABILITY: Pathway Miner is a freely available web accessible tool at http://www.biorag.org/pathway.html

Algorithms↗

Voro3D: 3D Voronoi tessellations applied to protein structures.

UNLABELLED: Voro3D is an original easy-to-use tool, which provides a brand new point of view on protein structures through the three-dimensional (3D) Voronoi tessellations. To construct the Voronoi cells associated with each amino acid by a number of different tessellation methods, Voro3D uses a protein structure file in the PDB format as an input. After calculation, different structural properties of interest like secondary structures assignment, environment accessibility and exact contact matrices can be derived without any geometrical cut-off. Voro3D provides also a visualization of these tessellations superimposed on the associated protein structure, from which it is possible to model a polygonal protein surface using a model solvent or to quantify, for instance, the contact areas between a protein and a ligand. AVAILABILITY: The software executable file for PC using Windows 98, 2000, NT, XP can be freely downloaded at http://www.lmcp.jussieu.fr/~mornon/voronoi.html CONTACT: franck.dupuis@sanofi-aventis.com; jean-paul-mornon@imcp.jussieu.fr.

Algorithms↗

Phan3D: design of biological phantoms in 3D electron microscopy.

Three-Dimensional Electron Microscopy (3DEM) has turned out to be a major player in structural proteomics. In 3DEM, tens of thousands of EM images from a macromolecule at different views are combined to derive its structure by means of a 3D reconstruction algorithm. However, for an optimal reconstruction, the most suitable algorithm has to be used and its parameters have to be tuned for the macromolecule under study and the experimental conditions found. The use of phantoms is central to objective comparison of reconstruction algorithms and optimization of their parameters. Phan3D is a tool intended to provide a fully visual and interactive environment that facilitates the design of phantoms resembling biological specimens in 3DEM. Phan3D has been developed as an alternative to the tedious, error-prone and old-fashioned phantom design that is based on hand-written text description files.

Computer Graphics↗

CLANS: a Java application for visualizing protein families based on pairwise similarity.

SUMMARY: The main source of hypotheses on the structure and function of new proteins is their homology to proteins with known properties. Homologous relationships are typically established through sequence similarity searches, multiple alignments and phylogenetic reconstruction. In cases where the number of potential relationships is large, for example in P-loop NTPases with many thousands of members, alignments and phylogenies become computationally demanding, accumulate errors and lose resolution. In search of a better way to analyze relationships in large sequence datasets we have developed a Java application, CLANS (CLuster ANalysis of Sequences), which uses a version of the Fruchterman-Reingold graph layout algorithm to visualize pairwise sequence similarities in either two-dimensional or three-dimensional space. AVAILABILITY: CLANS can be downloaded at http://protevo.eb.tuebingen.mpg.de/download.

Algorithms↗

A graph-theoretic approach for the separation of b and y ions in tandem mass spectra.

MOTIVATION: Ion-type identification is a fundamental problem in computational proteomics. Methods for accurate identification of ion types provide the basis for many mass spectrometry data interpretation problems, including (a) de novo sequencing, (b) identification of post-translational modifications and mutations and (c) validation of database search results. RESULTS: Here, we present a novel graph-theoretic approach for solving the problem of separating b ions from y ions in a set of tandem mass spectra. We represent each spectral peak as a node and consider two types of edges: type-1 edge connecting two peaks probably of the same ion types and type-2 edge connecting two peaks probably of different ion types. The problem of ion-separation is formulated and solved as a graph partition problem, which is to partition the graph into three subgraphs, representing b, y and others ions, respectively, through maximizing the total weight of type-1 edges while minimizing the total weight of type-2 edges within each partitioned subgraph. We have developed a dynamic programming algorithm for rigorously solving this graph partition problem and implemented it as a computer program PRIME (PaRtition of Ion types in tandem Mass spEctra). The tests on a large amount of simulated mass spectra and 19 sets of high-quality experimental Fourier transform ion cyclotron resonance tandem mass spectra indicate that an accuracy level of approximately 90% for the separation of b and y ions was achieved. AVAILABILITY: The executable code of PRIME is available upon request. CONTACT: xyn@bmb.uga.edu.

Algorithms↗

Data integration and visualization system for enabling conceptual biology.

MOTIVATION: Integration of heterogeneous data in life sciences is a growing and recognized challenge. The problem is not only to enable the study of such data within the context of a biological question but also more fundamentally, how to represent the available knowledge and make it accessible for mining. RESULTS: Our integration approach is based on the premise that relationships between biological entities can be represented as a complex network. The context dependency is achieved by a judicious use of distance measures on these networks. The biological entities and the distances between them are mapped for the purpose of visualization into the lower dimensional space using the Sammon's mapping. The system implementation is based on a multi-tier architecture using a native XML database and a software tool for querying and visualizing complex biological networks. The functionality of our system is demonstrated with two examples: (1) A multiple pathway retrieval, in which, given a pathway name, the system finds all the relationships related to the query by checking available metabolic pathway, transcriptional, signaling, protein-protein interaction and ontology annotation resources and (2) A protein neighborhood search, in which given a protein name, the system finds all its connected entities within a specified depth. These two examples show that our system is able to conceptually traverse different databases to produce testable hypotheses and lead towards answers to complex biological questions.

Computational Biology↗

Adding some SPICE to DAS.

UNLABELLED: The distributed annotation system (DAS) defines a communication protocol used to exchange biological annotations. It is motivated by the idea that annotations should not be provided by single centralized databases but instead be spread over multiple sites. Data distribution, performed by DAS servers, is separated from visualization, which is carried out by DAS clients. The original DAS protocol was designed to serve annotation of genomic sequences. We have extended the protocol to be applicable to macromolecular structures. Here we present SPICE, a new DAS client that can be used to visualize protein sequence and structure annotations. AVAILABILITY: http://www.efamily.org.uk/software/dasclients/spice/

Algorithms↗

BRAGI: linking and visualization of database information in a 3D viewer and modeling tool.

BRAGI is a well-established package for viewing and modeling of three-dimensional (3D) structures of biological macromolecules. A new version of BRAGI has been developed that is supported on Windows, Linux and SGI. The user interface has been rewritten to give the standard 'look and feel' of the chosen operating system and to provide a more intuitive, easier usage. A large number of new features have been added. Information from public databases such as SWISS-PROT, InterPro, DALI and OMIM can be displayed in the 3D viewer. Structures can be searched for homologous sequences using the NCBI BLAST server.

Amino Acid Sequence↗

Grid cellware: the first grid-enabled tool for modelling and simulating cellular processes.

Modelling and simulation of complex cellular transactions involve development of platforms that understand diverse mathematical representations and are capable of handling large backend computations. Grid Cellware, an integrated modelling and simulation tool, has been developed to precisely address these niche requirements of the modelling community. Grid Cellware implements various pathway simulation algorithms along with adaptive Swarm algorithm for parameter estimation. For enchanced computational productivity Grid Cellware uses grid technology with Globus as the middleware.

Algorithms↗

Serial SimCoal: a population genetics model for data from multiple populations and points in time.

UNLABELLED: We present Serial SimCoal, a program that models population genetic data from multiple time points, as with ancient DNA data. An extension of SIMCOAL, it also allows simultaneous modeling of complex demographic histories, and migration between multiple populations. Further, we incorporate a statistical package to calculate relevant summary statistics, which, for the first time allows users to investigate the statistical power provided by, conduct hypothesis-testing with, and explore sample size limitations of ancient DNA data. AVAILABILITY: Source code and Windows/Mac executables at http://www.stanford.edu/group/hadlylab/ssc.html CONTACT: senka@stanford.edu.

Biological Evolution↗

GeneContent: software for whole-genome phylogenetic analysis.

UNLABELLED: GeneContent is a software system to infer the genome phylogeny based on an additive genome distance that can be estimated from the extended gene content data, which contains the genome-wide information (absence of a gene family, presence as single copy or presence as duplicates) across multiple species. GeneContent can also be used to explore the genome-wide evolutionary pattern of gene loss and proliferation. AVAILABILITY: Distribution packages of GeneContent for both Microsoft Windows and Linux operating systems are available at http://xgu.zool.iastate.edu CONTACT: xgu@iastate.edu.

Algorithms↗

Exploring the diversity of complex metabolic networks.

MOTIVATION: Metabolism, the network of chemical reactions that make life possible, is one of the most complex processes in nature. We describe here the development of a computational approach for the identification of every possible biochemical reaction from a given set of enzyme reaction rules that allows the de novo synthesis of metabolic pathways composed of these reactions, and the evaluation of these novel pathways with respect to their thermodynamic properties. RESULTS: We applied this framework to the analysis of the aromatic amino acid pathways and discovered almost 75,000 novel biochemical routes from chorismate to phenylalanine, more than 350,000 from chorismate to tyrosine, but only 13 from chorismate to tryptophan. Thermodynamic analysis of these pathways suggests that the native pathways are thermodynamically more favorable than the alternative possible pathways. The pathways generated involve compounds that exist in biological databases, as well as compounds that exist in chemical databases and novel compounds, suggesting novel biochemical routes for these compounds and the existence of biochemical compounds that remain to be discovered or synthesized through enzyme and pathway engineering. AVAILABILITY: Framework will be available via web interface at http://systemsbiology.northwestern.edu/BNICE (site under construction). CONTACT: vassily@northwestern.edu or broadbelt@northwestern.edu SUPPLEMENTARY INFORMATION: http://systemsbiology.northwestern.edu/BNICE/publications.

Amino Acids, Aromatic↗

PreDs: a server for predicting dsDNA-binding site on protein molecular surfaces.

UNLABELLED: PreDs is a WWW server that predicts the dsDNA-binding sites on protein molecular surfaces generated from the atomic coordinates in a PDB format. The prediction was done by evaluating the electrostatic potential, the local curvature and the global curvature on the surfaces. Results of the prediction can be interactively checked with our original surface viewer. AVAILABILITY: PreDs is available free of charge from http://pre-s.protein.osaka-u.ac.jp/~preds/ CONTACT: kino@ims.u-tokyo.ac.jp.

Computer Graphics↗

Selecton: a server for detecting evolutionary forces at a single amino-acid site.

UNLABELLED: We present an algorithmic tool for the identification of biologically significant amino acids in proteins of known three dimensional structure. We estimate the degree of purifying selection and positive Darwinian selection at each site and project these estimates onto the molecular surface of the protein. Thus, patches of functional residues (undergoing either positive or purifying selection), which may be discontinuous in the linear sequence, are revealed. We test for the statistical significance of the site-specific scores in order to obtain reliable and valid estimates. AVAILABILITY: The Selecton web server is available at: http://selecton.bioinfo.tau.ac.il SUPPLEMENTARY INFORMATION: More information is available at http://selecton.bioinfo.tau.ac.il/overview.html. A set of examples is available at http://selecton.bioinfo.tau.ac.il/gallery.html.

Algorithms↗

ProtTest: selection of best-fit models of protein evolution.

SUMMARY: Using an appropriate model of amino acid replacement is very important for the study of protein evolution and phylogenetic inference. We have built a tool for the selection of the best-fit model of evolution, among a set of candidate models, for a given protein sequence alignment. AVAILABILITY: ProtTest is available under the GNU license from http://darwin.uvigo.es

Algorithms↗

A grid layout algorithm for automatic drawing of biochemical networks.

MOTIVATION: Visualization is indispensable in the research of complex biochemical networks. Available graph layout algorithms are not adequate for satisfactorily drawing such networks. New methods are required to visualize automatically the topological architectures and facilitate the understanding of the functions of the networks. RESULTS: We propose a novel layout algorithm to draw complex biochemical networks. A network is modeled as a system of interacting nodes on squared grids. A discrete cost function between each node pair is designed based on the topological relation and the geometric positions of the two nodes. The layouts are produced by minimizing the total cost. We design a fast algorithm to minimize the discrete cost function, by which candidate layouts can be produced efficiently. A simulated annealing procedure is used to choose better candidates. Our algorithm demonstrates its ability to exhibit cluster structures clearly in relatively compact layout areas without any prior knowledge. We developed Windows software to implement the algorithm for CADLIVE. AVAILABILITY: All materials can be freely downloaded from http://kurata21.bio.kyutech.ac.jp/grid/grid_layout.htm; http://www.cadlive.jp/ SUPPLEMENTARY INFORMATION: http://kurata21.bio.kyutech.ac.jp/grid/grid_layout.htm; http://www.cadlive.jp/

Algorithms↗