Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Computer Communication Networks”

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 739 records · Page 41Linked to original sources
PubMed1996

A database of mutants and effects of site-directed mutagenesis experiments on G protein-coupled receptors.

A database system and computer programs for storage and retrieval of information about guanine nucleotide-binding protein (G protein) -coupled receptor mutants and associated biological effects have been developed. Mutation data on the receptors were collected from the literature and a database of mutants and effects of mutations was developed. The G protein-coupled receptor, family A, point mutation database (GRAP) provides detailed information on ligand-binding and signal transduction properties of more than 2130 receptor mutants. The amino acid sequences of receptors for which mutation experiments have been reported were aligned, and from this alignment mutation data may be retrieved. Alternatively, a search form allowing detailed specification of which mutants to retrieve may be used, for example, to search for specific amino acid substitutions, substitutions in specific protein domains or reported biological effects. Furthermore, ligand and bibliographic oriented queries may be performed. GRAP is available on the Internet (URL: http://www-grap.fagmed.uit.no/GRAP/+ +homepage.html) using the World-Wide Web system.

Amino Acid Sequence↗
PubMedDate not supplied

Balanced centralized and distributed database design in a clinical research environment.

Clinical research databases can meet both research and clinical needs, but this ideal is seldom achieved. Priorities often differ for those who collect and ultimately use the data and those who develop data systems. Traditional database designs also create logistical barriers that hamper communication. The Michigan Alzheimer's Disease Research Center has developed a secure, distributed data system with centralized data entry that provides an intuitive, individually customized interface for investigators in their clinics, laboratories and offices. Data are kept in a form that can be readily understood without reference to a code-book. Investigators can modify and query their own copies of the database without knowledge of programming languages. Balancing centralized and distributed designs for research databases enhance the accuracy and completeness of data collection and increases the use of data for research and clinical care.

Aged↗
PubMed1999

Cine PACS: preprint.

The technology of cardiac image management is increasingly digital. This tutorial introduces some of the basic concepts relevant to the application of this technology in the cardiac catheterization laboratory.

Cardiac Catheterization↗
PubMed1988

Use of a satellite-assisted computer link for long-distance research collaboration.

Research collaboration between investigators located at some distance from each other is not only possible but also feasible. By using satellite-assisted computer-to-computer links, researchers across the United States and overseas work with the staff and facilities of the Cardiovascular Research and Training Center (CVRTC) in the University of Washington, Seattle. This report presents the mechanics, advantages, and results of using such an approach to collaborate with distant colleagues.

Cardiovascular Diseases↗
PubMed1990

Interfacing a flow cytometer computer with a PC-based patient information system.

We have established an interface between our flow cytometer's computer and the personal computer (PC) which supports our patient database system. The PC has been equipped with a commercially available IEEE-488 bus interface board which is connected to the interface bus of the cytometer's Hewlett-Packard 9000/300 computer (HP). The PC is set as a bus device with the same address as that of the HP's printer. It is programmed to examine the stream of data sent to the printer and extract from it and store in an MS-DOS text file selected information which subsequently may be transferred to the database system.

Computer Communication Networks↗
PubMed1997

Melanie II--a third-generation software package for analysis of two-dimensional electrophoresis images: I. Features and user interface.

Although two-dimensional electrophoresis (2-DE) computer analysis software packages have existed ever since 2-DE technology was developed, it is only now that the hardware and software technology allows large-scale studies to be performed on low-cost personal computers or workstations, and that setting up a 2-DE computer analysis system in a small laboratory is no longer considered a luxury. After a first attempt in the seventies and early eighties to develop 2-DE analysis software systems on hardware that had poor or even no graphical capabilities, followed in the late eighties by a wave of innovative software developments that were possible thanks to new graphical interface standards such as XWindows, a third generation of 2-DE analysis software packages has now come to maturity. It can be run on a variety of low-cost, general-purpose personal computers, thus making the purchase of a 2-DE analysis system easily attainable for even the smallest laboratory that is involved in proteome research. Melanie II 2-D PAGE, developed at the University Hospital of Geneva, is such a third-generation software system for 2-DE analysis. Based on unique image processing algorithms, this user-friendly object-oriented software package runs on multiple platforms, including Unix, MS-Windows 95 and NT, and Power Macintosh. It provides efficient spot detection and quantitation, state-of-the-art image comparison, statistical data analysis facilities, and is Internet-ready. Linked to proteome databases such as those available on the World Wide Web, it represents a valuable tool for the "Virtual Lab" of the post-genome area.

Algorithms↗
PubMed1995

Evaluation of comparative protein modeling by MODELLER.

We evaluate 3D models of human nucleoside diphosphate kinase, mouse cellular retinoic acid binding protein I, and human eosinophil neurotoxin that were calculated by MODELLER, a program for comparative protein modeling by satisfaction of spatial restraints. The models have good stereochemistry and are at least as similar to the crystallographic structures as the closest template structures. The largest errors occur in the regions that were not aligned correctly or where the template structures are not similar to the correct structure. These regions correspond predominantly to exposed loops, insertions of any length, and non-conserved side chains. When a template structure with more than 40% sequence identity to the target protein is available, the model is likely to have about 90% of the mainchain atoms modeled with an rms deviation from the X-ray structure of approximately 1 A, in large part because the templates are likely to be that similar to the X-ray structure of the target. This rms deviation is comparable to the overall differences between refined NMR and X-ray crystallography structures of the same protein.

Amino Acid Sequence↗
PubMed1995

Progress in fold recognition.

The prediction experiment reveals that fold recognition has become a powerful tool in structural biology. We applied our fold recognition technique to 13 target sequences. In two cases, replication terminating protein and prosequence of subtilisin, the predicted structures are very similar to the experimentally determined folds. For the first time, in a public blind test, the unknown structures of proteins have been predicted ahead of experiment to an accuracy approaching molecular detail. In two other cases the approximate folds have been predicted correctly. According to the assessors there were 12 recognizable folds among the target proteins. In our postprediction analysis we find that in 7 cases our fold recognition technique is successful. In several of the remaining cases the predicted folds have interesting features in common with the experimental results. We present our procedure, discuss the results, and comment on several fundamental and technical problems encountered in fold recognition.

Algorithms↗
PubMed1995

Successful protein fold recognition by optimal sequence threading validated by rigorous blind testing.

Analysis of the results of the recent protein structure prediction experiment for our method shows that we achieved a high level of success. Of the 18 available prediction targets of known structure, the assessors have identified 11 chains which either entirely match a previously known fold, or which partially match a substantial region of a known fold. Of these 11 chains, we made predictions for 9, and correctly assigned the folds in 5 cases. We have also identified a further 2 chains which also partially match known folds, and both of these were correctly predicted. The success rate for our method under blind testing is therefore 7 out of 11 chains. A further 2 folds could have easily been recognized but failed due to either overzealous filtering of potential matches, or to simple human error on our part. One of the two targets for which we did not submit a prediction, prosubtilisin, would not have been recognized by our usual criteria, but even in this case, it is possible that a correct prediction could have been made by considering a combination of pairwise energy and solvation energy Z-scores. Inspection of the threading alignments for the (alpha beta)8 barrels provides clues as to how fold recognition by threading works, in that these folds are recognized by parts rather than as a whole. The prospects for developing sequence threading technology further is discussed.

Algorithms↗
PubMedDate not supplied

Data field standards and the Health Insurance Portability and Accountability Act.

The Administrative Simplification Title of the Health Insurance Portability and Accountability Act of 1996 addresses the creation and adoption of nationwide standards for the electronic exchange and confidentiality protection of all individually identified data used in health care administration. The U.S. Department of Health and Human Services (DHHS) is implementing standards under this law. In addition to new standards, the law mandates that the Congress pass a health information privacy bill by August 1999 or that the DHHS adopt privacy protections for health information by February 2000. Published in 2001 by John Wiley & Sons, Ltd.

Computer Communication Networks↗
PubMed1996

PhenoDB: an integrated client/server database for linkage and population genetics.

In this paper we describe PhenoDB, an Internet-accessible client/server database application for population and linkage genetics. PhenoDB stores genetic marker data on pedigrees and populations. A database for population and linkage genetics requires two core functions: data management tasks, such as interactive validation during data entry and editing, and data analysis tasks, such as generating summary population statistics and performing linkage analyses. In PhenoDB we attempt to make these tasks as easy as possible. The client/server architecture allows efficient management and manipulation of large datasets via an easy-to-use graphical interface. PhenoDB data (73 populations, 34 pedigrees, approximately 4200 individuals, and close to 80,000 typings) are stored in a generic format that can be readily exported to (or imported from) the file formats required by various existing analysis programs such as LIPED and Lathrop and Lalouel's Multipoint Linkage. PhenoDB allows performance of complex ad-hoc queries and can generate reports for use in project management. Finally, PhenoDB can produce statistical summaries such as allele frequencies, phenotype frequencies, and Chi-square tests of Hardy-Weinberg ratios of population/pedigree data.

Alleles↗
PubMed1998

Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies.

We present here a simple and fast method allowing the isolation of DNA binding sites for transcription factors from families of coregulated genes, with results illustrated in Saccharomyces cerevisiae. Although conceptually simple, the algorithm proved efficient for extracting, from most of the yeast regulatory families analyzed, the upstream regulatory sequences which had been previously found by experimental analysis. Furthermore, putative new regulatory sites are predicted within upstream regions of several regulons. The method is based on the detection of over-represented oligonucleotides. A specificity of this approach is to define the statistical significance of a site based on tables of oligonucleotide frequencies observed in all non-coding sequences from the yeast genome. In contrast with heuristic methods, this oligonucleotide analysis is rigorous and exhaustive. Its range of detection is however limited to relatively simple patterns: short motifs with a highly conserved core. These features seem to be shared by a good number of regulatory sites in yeast. This, and similar methods, should be increasingly required to identify unknown regulatory elements within the numerous new coregulated families resulting from measurements of gene expression levels at the genomic scale. All tools described here are available on the web at the site http://copan.cifn.unam.mx/Computational_Biology/ yeast-tools

Algorithms↗