Computer applications in the biosciences : CABIOS最新文献

Motivation: The derivation of steady-state equations is frequently carried out in enzyme kinetic studies. Done manually, this becomes tedious and prone to human error. The computer programs now available which are able to accept reaction mechanisms of some complexity are focused only on the strict steady-state approach.

Results: Here we present a computer program called REFERASS, with a short computation time and a user-friendly format for the input and output files, able to derive the strict steady-state equations and/or those corresponding to the usual assumption that one ore more of the reversible steps are in rapid equilibrium. This program handles enzyme-catalysed reactions with mechanisms involving up to 255 enzyme species connected by up to 255 reaction steps, subject to limits imposed by the memory and disk space available.

Motivation: The Human cDNA Database (HCD) at the Institute for Genomic Research (TIGR) is the most complete, non-redundant and structured collection of human expressed DNA sequences available to date. Sequences and other data can be retrieved by users having opened an account at HCD/TIGR. A HCD search involves composing and sending queries one by one and this can become time consuming if many queries must be sent. Moreover, a large amount of time is required thereafter to process the results.

Results: The HCDSearch system described here automatically composes and sends the queries by e-mail using information provided in a text file; it also greatly accelerates the processing of results, generating lists of HCD numbers and library identifiers in a format that renders them very easy to examine. The programs run on Unix platforms.

A deductive database system PACADE (Protein Atomic Coordinate Analyzer with Deductive Engine) has been developed for protein structure analysis. With this system, super-secondary structures described in logical and declarative rules can be retrieved effectively. For protein structure analysis, comparison of local structures in different proteins is a necessary mean. A function to search for similar structures has, therefore, been added to the PACADE system. We describe herein the result of searches for the same topological structures and three-dimensionally similar ones. A user of PACADE can select these two levels of similarity by changing parameters. This function enables the inference system to retrieve similar structures, according to the restraints of variables defined by the user. Similar super-secondary structures among proteins can be searched for automatically, which is useful for protein structure analysis. The retrieved similar super-secondary structures can serve as criteria for protein spatial alignment.

Motivation: Statistical sequence comparison techniques, such as hidden Markov models and generalized profiles, calculate the probability that a sequence was generated by a given model. Log-odds scoring is a means of evaluating this probability by comparing it to a null hypothesis, usually a simpler statistical model intended to represent the universe of sequences as a whole, rather than the group of interest. Such scoring leads to two immediate questions: what should the null model be, and what threshold of log-odds score should be deemed a match to the model.

Results: This paper analyses these two issues experimentally. Within the context of the Sequence Alignment and Modeling software suite (SAM), we consider a variety of null models and suitable thresholds. Additionally, we consider HMMer's log-odds scoring and SAM's original Z-scoring method. Among the null model choices, a simple looping null model that emits characters according to the geometric mean of the character probabilities in the columns modeled by the hidden Markov model (HMM) performs well or best across all four discrimination experiments.

Motivation: Metabolic Control Analysis is one of many disciplines that make use of scaled derivatives. In particular, 'elasticities' are used to quantify the effect of an effector or substrate concentration on an enzyme rate under locally specified conditions. Normally an algebraic expression for the elasticity of an enzyme is obtained by differentiating its rate law, multiplying by the effector concentration and dividing by the rate law itself: this results in considerable expression expansion, and when the results are subsequently simplified it is often at the expense of biological comprehensibility.

Results: We present a novel algorithm which not only circumvents the expression expansion, but preserves an elegant separation of the components in enzyme behaviour. Easily implemented, and producing gains in both performance and numerical precision, the algorithm is potentially applicable to a number of existing packages. It also greatly assists the manual derivation and evaluation of elasticities, allowing the elasticity of even quite complex enzyme systems to be written by inspection.

A method and software tool to develop patterns of protein families has been designed. These patterns are intended for the identification of local similarities in arbitrary amino acid sequences with proteins of the SWISS-PROT bank. The method is based on the physical, chemical and structural properties of amino acids. It assembles a 'best set' of elements (a pattern) for a given group of aligned related proteins. These elements provide discrimination between proteins of a family and representatives of other families or random sequences. The method combines the advantages of BLOCKS (automatic generation of multiple elements for protein groups), PROSITE (simplicity of element presentation) and matrices/profiles (different distinctions between amino acids for different positions of aligned sequences). Using our method, a data bank of protein family patterns, PROF_PAT, is produced. This data bank is based on the 27,752 amino acid sequences of SWISS-PROT bank release 24. The characteristics of patterns of 743 related protein groups are described. The results of comparisons of PROF_PAT patterns with the proteins of the SWISS-PROT bank are discussed.

Motivation: Genome-scale DNA sequencing is a multistep process in which large numbers of small template clones are propagated, purified, sequenced and analyzed on acrylamide gels. A significant challenge to these projects is the scale at which the data handling must be done. Hence, large-scale sequencing facilities will benefit from tracking template DNA information (purification methods, reaction and electrophoresis conditions) in a systematic fashion. A lack of software tools that support automated sample entry, and automatic data storage, retrieval and analysis are a major hindrance to recording and using laboratory workflow information to monitor the overall quality of data production.

Results: The UNIX file system has been used to prototype automation of the flow of data from the ABI sequencer to a data repository. Data are automatically processed by a central Perl program, Hopper, which runs a series of programs that analyze data quality (read length estimate, fraction of indeterminate bases, and number of contaminating and repetitive sequences), assemble shotgun sequence data, and generates simple reports describing the results.

Motivation: This paper presents LASSAP, a new software package for sequence comparison. LASSAP is a programmable, high-performance system designed to raise current limitations of sequence comparison programs in order to fit the needs of large-scale analysis. LASSAP provides an API (Application Programming Interface) allowing the integration of any generic pairwise-based algorithm.

Results: Whatever pairwise algorithm is used in LASSAP, it shares with all other algorithms numerous enhancements such as: (i) intra- and inter-databank comparisons; (ii) computational requests (selections and computations are achieved on the fly); (iii) frame translations on queries and databanks; (iv) structured results allowing easy and powerful post-analysis; (v) performance improvements by parallelization and the driving of specialized hardware. LASSAP currently implements all major sequence comparison algorithms (Fasta, Blast, Smith/Waterman), and other string matching and pattern matching algorithms. LASSAP is both an integrated software for end-users and a framework allowing the integration and the combination of new algorithms. LASSAP is used in different projects such as the building of PRODOM, the exhaustive comparison of yeast sequences, and the subfragments matching problem of TREMBL.

Motivation: Reconstruction of the original DNA sequence in the sequencing by the hybridization approach (SBH) requires computational support due to a large number of possible combinations. One can notice a lack of algorithms admitting false-negative data and giving in addition all possible solutions.

Results: In this paper, a new method of sequencing has been proposed. An algorithm based on its idea (for the general case, when some data are missing, like in the real experiment) has been implemented and tested. Authentic DNA sequences have been used for testing. A parallel version of the algorithm has also been implemented and tested. The quality of the reconstruction is satisfactory for the library of oligonucleotides of length between 8 and 12, and 100, 200 and 300 bp long sequences. A way to a further decrease in the computation time is also suggested.

Motivation: This document presents an implementation of the well-known Smith-Waterman algorithm for comparison of proteic and nucleic sequences, using specialized video instructions. These instructions, SIMD-like in their design, make possible parallelization of the algorithm at the instruction level.

Results: Benchmarks on an ULTRA SPARC running at 167 MHz show a speed-up factor of two compared to the same algorithm implemented with integer instructions on the same machine. Performance reaches over 18 million matrix cells per second on a single processor, giving to our knowledge the fastest implementation of the Smith-Waterman algorithm on a workstation. The accelerated procedure was introduced in LASSAP--a LArge Scale Sequence compArison Package software developed at INRIA--which handles parallelism at higher level. On a SUN Enterprise 6000 server with 12 processors, a speed of nearly 200 million matrix cells per second has been obtained. A sequence of length 300 amino acids is scanned against SWISSPROT R33 (1,8531,385 residues) in 29 s. This procedure is not restricted to databank scanning. It applies to all cases handled by LASSAP (intra- and inter-bank comparisons, Z-score computation, etc.