PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “Programming Languages”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

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

At least 1,513 records · Page 84Linked to original sources
PubMed2001

MAPS: a microarray project system for gene expression experiment information and data validation.

SUMMARY: MAPS is a MicroArray Project System for management and interpretation of microarray gene expression experiment information and data. Microarray project information is organized to track experiments and results that are: (1) validated by performing analysis on stored replicate gene expression data; and (2) queried according to the biological classifications of genes deposited on microarray chips.

Computer Communication Networks↗
PubMed2001

The Bioinformatics Template Library--generic components for biocomputing.

MOTIVATION: The efficiency of bioinformatics programmers can be greatly increased through the provision of ready-made software components that can be rapidly combined, with additional bespoke components where necessary, to create finished programs. The new standard for C++ includes an efficient and easy to use library of generic algorithms and data-structures, designed to facilitate low-level component programming. The extension of this library to include functionality that is specifically useful in compute-intensive tasks in bioinformatics and molecular modelling could provide an effective standard for the design of reusable software components within the biocomputing community. RESULTS: A novel application of generic programming techniques in the form of a library of C++ components called the Bioinformatics Template Library (BTL) is presented. This library will facilitate the rapid development of efficient programs by providing efficient code for many algorithms and data-structures that are commonly used in biocomputing, in a generic form that allows them to be flexibly combined with application specific object-oriented class libraries. AVAILABILITY: The BTL is available free of charge from our web site http://www.cryst.bbk.ac.uk/~classlib/ and the EMBL file server http://www.embl-ebi.ac.uk/FTP/index.html

Algorithms↗
PubMed2002

Genesis: cluster analysis of microarray data.

A versatile, platform independent and easy to use Java suite for large-scale gene expression analysis was developed. Genesis integrates various tools for microarray data analysis such as filters, normalization and visualization tools, distance measures as well as common clustering algorithms including hierarchical clustering, self-organizing maps, k-means, principal component analysis, and support vector machines. The results of the clustering are transparent across all implemented methods and enable the analysis of the outcome of different algorithms and parameters. Additionally, mapping of gene expression data onto chromosomal sequences was implemented to enhance promoter analysis and investigation of transcriptional control mechanisms.

Algorithms↗
PubMed2002

PCSB--a program collection for structural biology and biophysical chemistry.

We present the first package of Java classes specifically aimed at the handling of structural and biophysical problems. To enable object-oriented programming a basis of fundamental Java classes is required which deals with basic operations of vectors, matrices, amino acid sequences, crystal symmetries and PDB files. Five classes, which carry out these basic operations, were constructed and bundled together with several utility functions in the PCSB package. Furthermore, to demonstrate their applicability and to obtain programs handling common tasks in structural laboratories, we present the first six applications of PCSB. All applications are portable to different platforms and require only the Java Runtime Environment to be installed on the system. available as PDF file.

Algorithms↗
PubMed2002

BAOBAB: a Java editor for large phylogenetic trees.

SUMMARY: BAOBAB is a Java user interface dedicated to viewing and editing large phylogenetic trees. Original features include: (i) a colour-mediated overview of magnified subtrees; (ii) copy/cut/paste of (sub)trees within or between windows; (iii) compressing/ uncompressing subtrees; and (iv) managing sequence files together with tree files. AVAILABILITY: http://www.univ-montp2.fr/~genetix/.

Computational Biology↗
PubMed2002

CX, an algorithm that identifies protruding atoms in proteins.

MOTIVATION: A simple and fast algorithm is described that calculates a measure of protrusion (cx) for atoms in protein structures, directly useable with the common molecular graphics programs. RESULTS: A sphere of predetermined radius is centered around each non-hydrogen atom, and the volume occupied by the protein and the free volume within the sphere (internal and external volumes, respectively) are calculated. Atoms in protruding regions have a high ratio (cx) between the external and the internal volume. The program reads a PDB file, and writes the output in the same format, with cx values in the B factor field. Output structure files can be directly displayed with standard molecular graphics programs like RASMOL, MOLMOL, Swiss-PDB Viewer and colored according to cx values. We show the potential use of this program in the analysis of two protein-protein complexes and in the prediction of limited proteolysis sites in native proteins. AVAILABILITY: The algorithm is implemented in a standalone program written in C and its source is freely available at ftp.icgeb.trieste.it/pub/CX or on request from the authors.

Algorithms↗
PubMed2002

Simplifying amino acid alphabets by means of a branch and bound algorithm and substitution matrices.

MOTIVATION: Protein and DNA are generally represented by sequences of letters. In a number of circumstances simplified alphabets (where one or more letters would be represented by the same symbol) have proved their potential utility in several fields of bioinformatics including searching for patterns occurring at an unexpected rate, studying protein folding and finding consensus sequences in multiple alignments. The main issue addressed in this paper is the possibility of finding a general approach that would allow an exhaustive analysis of all the possible simplified alphabets, using substitution matrices like PAM and BLOSUM as a measure for scoring. RESULTS: The computational approach presented in this paper has led to a computer program called AlphaSimp (Alphabet Simplifier) that can perform an exhaustive analysis of the possible simplified amino acid alphabets, using a branch and bound algorithm together with standard or user-defined substitution matrices. The program returns a ranked list of the highest-scoring simplified alphabets. When the extent of the simplification is limited and the simplified alphabets are maintained above ten symbols the program is able to complete the analysis in minutes or even seconds on a personal computer. However, the performance becomes worse, taking up to several hours, for highly simplified alphabets. AVAILABILITY: AlphaSimp and other accessory programs are available at http://bioinformatics.cribi.unipd.it/alphasimp

Algorithms↗
PubMed2002

TFBS: Computational framework for transcription factor binding site analysis.

MOTIVATION: TFBS is a set of integrated, object-oriented Perl modules for transcription factor binding site detection and analysis. It implements objects representing specificity profile matrices, binding sites and sets thereof, pattern generators, and pattern database interfaces. The modules are interoperable with the BioPerl open source system. AVAILABILITY AND SUPPLEMENTARY INFORMATION: The module package with documentation and example scripts are available at http://forkhead.cgb.ki.se/TFBS/

Binding Sites↗
PubMed2002

ShiftDetector: detection of shift mutations.

MOTIVATION: Sequencing of a bi-allelic PCR product, which contains an allele with a deletion/insertion mutation results in a superimposed tracefile following the site of this shift mutation. A trace file of this type hampers the use of current computer programs for base calling. ShiftDetector analyses a sequencing trace file in order to discover if it is a superimposed sequence of two molecules that differ in a shift mutation of 1 to 25 bases. The program calculates a probability score for the existence of such a shift and reconstructs the sequence of the original molecule. AVAILABILITY: ShiftDetector is available from http://cowry.agri.huji.ac.il

Alleles↗
PubMed2002

Domain fishing: a first step in protein comparative modelling.

UNLABELLED: To optimize the search for structural templates in protein comparative modelling, the query sequence is split into domains. The initial list of templates for each domain, extracted from PFAM plus PDB and SCOP, is then ranked according to sequence identity (%ID), coverage and resolution. If %ID is less than 30, secondary structure matching is used to filter out false templates. AVAILABILITY: http://www.bmm.icnet.uk/~3djigsaw/dom_fish

Algorithms↗
PubMed2002

XEMBL: distributing EMBL data in XML format.

UNLABELLED: Data in the EMBL Nucleotide Sequence Database is traditionally available in a flat file format that has a number of known shortcomings. With XML rapidly emerging as a standard data exchange format that can address some problems of flat file formats by defining data structure and syntax, there is now a demand to distribute EMBL data in an XML format. XEMBL is a service tool that employs CORBA servers to access EMBL data, and distributes the data in XML format via a number of mechanisms. AVAILABILITY: Use of the XEMBL service is free of charge at http://www.ebi.ac.uk/xembl/, and can be accessed via web forms, CGI, and a SOAP-enabled service. SUPPLEMENTARY INFORMATION: Information on the EMBL Nucleotide Sequence Database is available at http://www.ebi.ac.uk/embl/. The EMBL Object Model is available at http://corba.ebi.ac.uk/models/. Information on the EMBL CORBA servers is at http://corba.ebi.ac.uk/

Computer Communication Networks↗
PubMed2002

PseudoViewer: automatic visualization of RNA pseudoknots.

MOTIVATION: Several algorithms have been developed for drawing RNA secondary structures, however none of these can be used to draw RNA pseudoknot structures. In the sense of graph theory, a drawing of RNA secondary structures is a tree, whereas a drawing of RNA pseudoknots is a graph with inner cycles within a pseudoknot as well as possible outer cycles formed between a pseudoknot and other structural elements. Thus, RNA pseudoknots are more difficult to visualize than RNA secondary structures. Since no automatic method for drawing RNA pseudoknots exists, visualizing RNA pseudoknots relies on significant amount of manual work and does not yield satisfactory results. The task of visualizing RNA pseudoknots by hand becomes more challenging as the size and complexity of the RNA pseudoknots increase. RESULTS: We have developed a new representation and an algorithm for drawing H-type pseudoknots with RNA secondary structures. Compared to existing representations of H-type pseudoknots, the new representation ensures uniform and clear drawings with no edge crossing for any H-type pseudoknots. To the best of our knowledge, this is the first algorithm for automatically drawing RNA pseudoknots with RNA secondary structures. The algorithm has been implemented in a Java program, which can be executed on any computing system. Experimental results demonstrate that the algorithm generates an aesthetically pleasing drawing of all H-type pseudoknots. The results have also shown that the drawing has high readability, enabling the user to quickly and easily recognize the whole RNA structure as well as the pseudoknots themselves.

Algorithms↗
PubMed2003

Simulating complex traits influenced by genes with fuzzy-valued effects in pedigreed populations.

MOTIVATION: Methods involving fuzzy theory have been rarely applied to genetics. We present an open platform for experimentation with fuzzy numbers as a tool to represent imprecise phenotypes in genetic modeling. RESULTS: A C++ library for simulation of genetic information transmission is introduced. The study of genetic linkage was its first goal, though a design so general as possible has been meant. Fuzzy-valued phenotypes are handled by means of fuzzy numbers. AVAILABILITY: ftp://carleos.etsiig.uniovi.es/pub/falin ftp://fisher.ciencias.uniovi.es/pub/falin ftp://bellman.ciencias.uniovi.es/pub/falin Licensed under the GNU General Public License version 2 (see http://www.gnu.org/licenses/gpl.html).

Algorithms↗
PubMed2003

A task framework for the web interface W2H.

SUMMARY: The W3H task framework allows the execution of compound jobs utilizing the description of work and data flows in a heterogeneous bioinformatics environment using meta-data information. By means of these descriptions, the task system can schedule the necessary execution of applications available in the environment, depending on rules specified in the meta-data. By integrating this task framework into the publicly available web interface W2H, similarly based on meta-data, web access and data management are immediately available for each task description. Authors of task descriptions can base their work on the underlying classes and objects to be able to describe dependency rules between previously independent applications. The result of a compound task is given as XML data that is translated according to XSLT data into web pages or plain text to report the result of the task to the user. AVAILABILITY: Within the HUSAR environment at DKFZ http://genome.dkfz-heidelberg.de/

Database Management Systems↗
PubMed1986

An improved FORTRAN 77 recombinant DNA database management system with graphic extensions in GKS.

We have improved an existing clone database management system written in FORTRAN 77 and adapted it to our software environment. Improvements are that the database can be interrogated for any type of information, not just keywords. Also, recombinant DNA constructions can be represented in a simplified 'shorthand', whereafter a program assembles the full nucleotide sequence from the contributing fragments, which may be obtained from nucleotide sequence databases. Another improvement is the replacement of the database manager by programs, running in batch to maintain the databank and verify its consistency automatically. Finally, graphic extensions are written in Graphical Kernel System, to draw linear and circular restriction maps of recombinants. Besides restriction sites, recombinant features can be presented from the feature lines of recombinant database entries, or from the feature tables of nucleotide databases. The clone database management system is fully integrated into the sequence analysis software package from the Pasteur Institute, Paris, and is made accessible through the same menu. As a result, recombinant DNA sequences can directly be analysed by the sequence analysis programs.

Algorithms↗
PubMed1986

Visualization of the entire surface of a protein by cartographic projection.

A minicomputer based system for the determination and schematic representation of protein surfaces is described. The algorithms are based on the atomic coordinates of globular protein molecules of the Brookhaven Protein Data Bank. Using a cartographic projection a normalized graphic representation is obtained of the amino acid residues located on the surface of the considered protein. The programs are written in FORTRAN IV (surface determination) and BASIC (graphic representation).

Algorithms↗