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.

SourceResearch connectionFrom yearThrough year

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

At least 1,747 records · Page 97Linked to original sources

PubMed2005

SpecAlign--processing and alignment of mass spectra datasets.

SUMMARY: Pre-processing of chromatographic profile or mass spectral data is an important aspect of many types of proteomics and biomarker discovery experiments. Here we present a graphical computational tool, SpecAlign, that enables simultaneous visualization and manipulation of multiple datasets. SpecAlign not only provides all common processing functions, but also uniquely implements an algorithm that enables the complete alignment of each mass spectrum within a loaded dataset. We demonstrate its utility by aligning two datasets each containing six spectra; one set was acquired prior to instrument calibration and the other following calibration. AVAILABILITY: The software is free of charge and available for download from http://ptcl.chem.ox.ac.uk/~jwong/specalign. Supports Windows operating systems including Windows 9X/NT/2000/XP.

Algorithms↗

PubMed2005

Sorting points into neighborhoods (SPIN): data analysis and visualization by ordering distance matrices.

SUMMARY: We introduce a novel unsupervised approach for the organization and visualization of multidimensional data. At the heart of the method is a presentation of the full pairwise distance matrix of the data points, viewed in pseudocolor. The ordering of points is iteratively permuted in search of a linear ordering, which can be used to study embedded shapes. Several examples indicate how the shapes of certain structures in the data (elongated, circular and compact) manifest themselves visually in our permuted distance matrix. It is important to identify the elongated objects since they are often associated with a set of hidden variables, underlying continuous variation in the data. The problem of determining an optimal linear ordering is shown to be NP-Complete, and therefore an iterative search algorithm with O(n3) step-complexity is suggested. By using sorting points into neighborhoods, i.e. SPIN to analyze colon cancer expression data we were able to address the serious problem of sample heterogeneity, which hinders identification of metastasis related genes in our data. Our methodology brings to light the continuous variation of heterogeneity--starting with homogeneous tumor samples and gradually increasing the amount of another tissue. Ordering the samples according to their degree of contamination by unrelated tissue allows the separation of genes associated with irrelevant contamination from those related to cancer progression. AVAILABILITY: Software package will be available for academic users upon request.

Algorithms↗

PubMed2005

Protein structure topological comparison, discovery and matching service.

UNLABELLED: We describe a fold level fast protein comparison and motif matching facility based on the TOPS representation of structure. This provides an update to a previous service at the EBI, with a better graph matching with faster results and visualization of both the structures being compared against and the common pattern of each with the target domain. AVAILABILITY: Web service at http://balabio.dcs.gla.ac.uk/tops or via the main TOPS site at http://www.tops.leeds.ac.uk. Software is also available for download from these sites.

Algorithms↗

PubMed2005

Self-organizing and self-correcting classifications of biological data.

MOTIVATION: Rapid, automated means of organizing biological data are required if we hope to keep abreast of the flood of data emanating from sequencing, microarray and similar high-throughput analyses. Faced with the need to validate the annotation of thousands of sequences and to generate biologically meaningful classifications based on the sequence data, we turned to statistical methods in order to automate these processes. RESULTS: An algorithm for automated classification based on evolutionary distance data was written in S. The algorithm was tested on a dataset of 1436 small subunit ribosomal RNA sequences and was able to classify the sequences according to an extant scheme, use statistical measurements of group membership to detect sequences that were misclassified within this scheme and produce a new classification. In this study, the use of the algorithm to address problems in prokaryotic taxonomy is discussed. AVAILABILITY: S-Plus is available from Insightful, Inc. An S-Plus implementation of the algorithm and the associated data are available at http://taxoweb.mmg.msu.edu/datasets

Algorithms↗

PubMed2005

Gene-Expression Omnibus integration and clustering tools in SeqExpress.

UNLABELLED: SeqExpress, a gene-expression analysis suite, has been extended to offer a number of cluster generation, refinement and visualization techniques. The cluster generation methods have been specialized to deal with aspects of the sparseness and extreme values that occur within microarray data. The results of such cluster analysis can then be refined using either: a functional enrichment based procedure, which examines each cluster to see if it possesses an unusually high or low concentration of ontology terms; or by using Expectation-Maximization to find a mixture of model based distributions within the datasets. Visualizations are provided both to explore and compare the results of the cluster generation algorithms. In addition, a tool has been developed which integrates SeqExpress with the Gene-Expression Omnibus repository. The tool provides seamless access to the large number of experimental results in the repository, so that they can be visualized and analysed locally using SeqExpress. AVAILABILITY: SeqExpress is available as a 6 MB download from http://www.seqexpress.com and runs under Windows. A server-based version is available and is required for the GEO integration. SeqExpress is not affiliated with any academic institution, funding body or commercial organization and is free to use by all.

Algorithms↗

PubMed2005

PSIbase: a database of Protein Structural Interactome map (PSIMAP).

UNLABELLED: Protein Structural Interactome map (PSIMAP) is a global interaction map that describes domain-domain and protein-protein interaction information for known Protein Data Bank structures. It calculates the Euclidean distance to determine interactions between possible pairs of structural domains in proteins. PSIbase is a database and file server for protein structural interaction information calculated by the PSIMAP algorithm. PSIbase also provides an easy-to-use protein domain assignment module, interaction navigation and visual tools. Users can retrieve possible interaction partners of their proteins of interests if a significant homology assignment is made with their query sequences. AVAILABILITY: http://psimap.org and http://psibase.kaist.ac.kr/

Binding Sites↗

PubMed2005

Visualizing profile-profile alignment: pairwise HMM logos.

UNLABELLED: The availability of advanced profile-profile comparison tools, such as PRC or HHsearch demands sophisticated visualization tools not presently available. We introduce an approach built upon the concept of HMM logos. The method illustrates the similarities of pairs of protein family profiles in an intuitive way. Two HMM logos, one for each profile, are drawn one upon the other. The aligned states are then highlighted and connected. AVAILABILITY: A web interface offering online creation of pairwise HMM logos is available at http://www.sanger.ac.uk/Software/analysis/logomat-p. Furthermore, software developers may download a Perl package that includes methods for creation of pairwise HMM logos locally. CONTACT: bsb@sanger.ac.uk.

Computer Graphics↗

PubMed2005

twilight; a Bioconductor package for estimating the local false discovery rate.

UNLABELLED: twilight is a Bioconductor compatible package for analysing the statistical significance of differentially expressed genes. It is based on the concept of the local false discovery rate (FDR), a generalization of the frequently used global FDR. twilight implements the heuristic search algorithm for estimating the local FDR introduced in our earlier work. In addition to the raw significance measures, it produces diagnostic plots, which provide insight into the extent of differential expression across genes. AVAILABILITY: http://www.bioconductor.org CONTACT: stefanie.scheid@molgen.mpg.de SUPPLEMENTARY INFORMATION: Please visit our software webpage on http://compdiag.molgen.mpg.de/software.

Algorithms↗

PubMed2005

Meta-DP: domain prediction meta-server.

UNLABELLED: Meta-DP, a domain prediction meta-server provides a simple interface to predict domains in a given protein sequence using a number of domain prediction methods. The Meta-DP is a convenient resource because through accessing a single site, users automatically obtain the results of the various domain prediction methods along with a consensus prediction. The Meta-DP is currently coupled to 10 domain prediction servers and can be extended to include any number of methods. Meta-DP can thus become a centralized repository of available methods. Meta-DP was also used to evaluate the performance of 13 domain prediction methods in the context of CAFASP-DP. AVAILABILITY: The Meta-DP server is freely available at http://meta-dp.bioinformatics.buffalo.edu and the CAFASP-DP evaluation results are available at http://cafasp4.bioinformatics.buffalo.edu/dp/update.html CONTACT: hkaur@bioinformatics.buffalo.edu SUPPLEMENTARY INFORMATION: Available at http://cafasp4.bioinformatics.buffalo.edu/dp/update.html.

Algorithms↗

PubMed2005

A web-based three-dimensional protein retrieval system by matching visual similarity.

SUMMARY: A web-based three-dimensional (3D) protein retrieval system is available for protein structure data including all PDB and FSSP dataset. In this system, we use a visual-based matching method to compare the protein structure from multiple viewpoints. It takes less than three seconds for each query with 90% accuracy on an average.

Algorithms↗

PubMed2005

Dasty and UniProt DAS: a perfect pair for protein feature visualization.

In this study, we present two freely available and complementary Distributed Annotation System (DAS) resources: a DAS reference server that provides up-to-date sequence and annotation from UniProt, with additional feature links and database cross-references from InterPro and a DAS client implemented using Java and Macromedia Flash that is optimized for the display of protein features.

Algorithms↗

PubMed2005

Efficient recognition of folds in protein 3D structures by the improved PRIDE algorithm.

UNLABELLED: An improved version of the PRIDE (PRobaility of IDEntity) fold prediction algorithm has been developed, based on more solid statistical basis, fast search capabilities and efficient input structure processing. The new algorithm is effective in identifying protein structures at the 'H' level of the CATH hierarchy. AVAILABILITY: The new algorithm is integrated into the PRIDE2 web servers at http://pride.szbk.u-szeged.hu and http://www.icgeb.org/pride. SUPPLEMENTARY INFORMATION: Detailed documentation and performance evaluation is available in the description section of the PRIDE2 web server.

Algorithms↗

PubMed2005

COREX/BEST server: a web browser-based program that calculates regional stability variations within protein structures.

SUMMARY: Utilizing the user-supplied coordinates of a protein structure, the COREX/BEST Server generates a structural thermodynamic ensemble. This conformational ensemble can then be used to calculate the regional variations in stability of a protein structure, and the stabilities are presented in units of energy (kcal/mol). The regional stabilities, which are calculated at the resolution of individual residues, can be mapped onto the protein structure for visual representation and downloaded from the site in the form of tab delimited text. The site provides an easy to follow summary of the theoretical and algorithmic approaches and provides links to references for more detailed descriptions. AVAILABILITY: The COREX/BEST Server may be accessed through a typical web browser by visiting http://best.utmb.edu/BEST/.

Algorithms↗

PubMed2005

PROVAT: a tool for Voronoi tessellation analysis of protein structures and complexes.

SUMMARY: Voronoi tessellation has proved to be a useful tool in protein structure analysis. We have developed PROVAT, a versatile public domain software that enables computation and visualization of Voronoi tessellations of proteins and protein complexes. It is a set of Python scripts that integrate freely available specialized software (Qhull, Pymol etc.) into a pipeline. The calculation component of the tool computes Voronoi tessellation of a given protein system in a way described by a user-supplied XML recipe and stores resulting neighbourhood information as text files with various styles. The Python pickle file generated in the process is used by the visualization component, a Pymol plug-in, that offers a GUI to explore the tessellation visually. AVAILABILITY: PROVAT source code can be downloaded from http://raven.bioc.cam.ac.uk/~swanand/Provat1, which also provides a webserver for its calculation component, documentation and examples.

Algorithms↗

PubMed2005

BiNGO: a Cytoscape plugin to assess overrepresentation of gene ontology categories in biological networks.

The Biological Networks Gene Ontology tool (BiNGO) is an open-source Java tool to determine which Gene Ontology (GO) terms are significantly overrepresented in a set of genes. BiNGO can be used either on a list of genes, pasted as text, or interactively on subgraphs of biological networks visualized in Cytoscape. BiNGO maps the predominant functional themes of the tested gene set on the GO hierarchy, and takes advantage of Cytoscape's versatile visualization environment to produce an intuitive and customizable visual representation of the results.

Algorithms↗

PubMed2005

Integration of metabolic networks and gene expression in virtual reality.

MOTIVATION: Metabolic networks combine metabolism and regulation. These complex networks are difficult to understand and visualize due to the amount and diverse types of information that need to be represented. For example, pathway information gives indications of interactions. Experimental data, such as transcriptomics, proteomics and metabolomics data, give snapshots of the system state. Stereoscopic virtual environments provide a true three-dimensional representation of metabolic networks, which can be intuitively manipulated, and may help to manage the data complexity. RESULTS: MetNet3D, a 3D virtual reality system, allows a user to explore gene expression and metabolic pathway data simultaneously. Normalized gene expression data are processed in R and visualized as a 3D plot. Users can find a particular gene of interest or a cluster of genes that behave similarly and see how these genes function in metabolic networks from MetNetDB, a database of Arabidopsis metabolic networks, using animated network graphs. Interactive virtual reality, with its enhanced ability to display more information, makes such integration more effective by abstracting key relationships. AVAILABILITY: MetNet3D and some sample datasets are available at http://www.vrac.iastate.edu/research/sites/metnet/Download/Download.htm. SUPPLEMENTARY INFORMATION: Color snapshots and movies are available at http://www.vrac.iastate.edu/research/sites/metnet/Bioinformatics/SupplementaryInformation.htm.

Algorithms↗

PubMed2005

simuPOP: a forward-time population genetics simulation environment.

SUMMARY: simuPOP is a forward-time population genetics simulation environment. The core of simuPOP is a scripting language (Python) that provides a large number of objects and functions to manipulate populations, and a mechanism to evolve populations forward in time. Using this R/Splus-like environment, users can create, manipulate and evolve populations interactively, or write a script and run it as a batch file. Owing to its flexible and extensible design, simuPOP can simulate large and complex evolutionary processes with ease. At a more user-friendly level, simuPOP provides an increasing number of built-in scripts that perform simulations ranging from implementation of basic population genetics models to generating datasets under complex evolutionary scenarios. AVAILABILITY: simuPOP is freely available at http://simupop.sourceforge.net, distributed under GPL license.

Algorithms↗

PubMed2005

Simpleaffy: a BioConductor package for Affymetrix Quality Control and data analysis.

UNLABELLED: Quality Control is a fundamental aspect of successful microarray data analysis. Simpleaffy is a BioConductor package that provides access to a variety of QC metrics for assessing the quality of RNA samples and of the intermediate stages of sample preparation and hybridization. Simpleaffy also offers fast implementations of popular algorithms for generating expression summaries and detection calls. AVAILABILITY: Simpleaffy can be downloaded from http://www.bioconductor.org. SUPPLEMENTARY INFORMATION: Additional information can be found on the supplementary website located at http://bioinformatics.picr.man.ac.uk.

Computational Biology↗