Bioinformatics

Klingenhoff, A; Frech, K; Quandt, K; Werner, T

doi: 10.1093/bioinformatics/15.3.180pmid: 10222404

MOTIVATION: Gene regulation often depends on functional modules which feature a detectable internal organization. Overall sequence similarity of these modules is often insufficient for detection by general search methods like FASTA or even Gapped BLAST. However, it is of interest to evaluate whether modules, often known from experimental analysis of single sequences, are present in other regulatory sequences. RESULTS: We developed a new method (FastM) which combines a search algorithm for individual transcription factor binding sites (MatInspector) with a distance correlation function. FastM allows fast definition of a model of correlated binding sites derived from as little as a single promoter or enhancer. ModelInspector results are suitable for evaluation of the significance of the model. We used FastM to define a model for the experimentally verified NFkappaB/IRF1 regulatory module from the major histocompatibility complex (MHC) class I HLA-B gene promoter. Analysis of a test set of sequences as well as database searches with this model showed excellent correlation of the model with the biological function of the module. These results could not be obtained by searches using FASTA or Gapped BLAST, which are based on sequence similarity. We were also able to demonstrate association of a hypothetical GRE-GRE module with viral sequences based on analysis of several GenBank sections with this module. AVAILABILITY: The WWW version of FastM is accessible at: http://www.gsf.de/cgi-bin/fastm. pl and http://genomatix.gsf.de/cgi-bin/fastm2/fastm.pl

Herzel, H; Weiss, O; Trifonov, E N

doi: 10.1093/bioinformatics/15.3.187pmid: 10222405

MOTIVATION: Completely sequenced genomes allow for detection and analysis of the relatively weak periodicities of 10-11 basepairs (bp). Two sources contribute to such signals: correlations in the corresponding protein sequences due to the amphipatic character of alpha-helices and the folding of DNA (nucleosomal patterns, DNA supercoiling). Since the topological state of genomic DNA is of importance for its replication, recombination and transcription, there is an immediate interest to obtain information about the supercoiled state from sequence periodicities. RESULTS: We show that correlations within proteins affect mainly the oscillations at distances below 35 bp. The long-ranging correlations up to 100 bp reflect primarily DNA folding. For the yeast genome these oscillations are consistent in detail with the chromatin structure. For eubacteria and archaea the periods deviate significantly from the 10.55 bp value for free DNA. These deviations suggest that while a period of 11 bp in bacteria reflects negative supercoiling, the significantly different period of thermophilic archaea close to 10 bp corresponds to positive supercoiling of thermophilic archaeal genomes. AVAILABILITY: Protein sets and C programs for the calculation of correlation functions are available on request from the authors (see http://itb.biologie.hu-berlin.de).

Varré, J S; Delahaye, J P; Rivals, E

doi: 10.1093/bioinformatics/15.3.194pmid: 10222406

MOTIVATION: Evolution acts in several ways on DNA: either by mutating a base, or by inserting, deleting or copying a segment of the sequence (Ruddle, 1997; Russell, 1994; Li and Grauer, 1991). Classical alignment methods deal with point mutations (Waterman, 1995), genome-level mutations are studied using genome rearrangement distances (Bafna and Pevzner, 1993, 1995; Kececioglu and Sankoff, 1994; Kececioglu and Ravi, 1995). The latter distances generally operate, not on the sequences, but on an ordered list of genes. To our knowledge, no measure of distance attempts to compare sequences using a general set of segment-based operations. RESULTS: Here we define a new family of distances, called transformation distances, which quantify the dissimilarity between two sequences in terms of segment-based events. We focus on the case where segment-copy, -reverse-copy and -insertion are allowed in our set of operations. Those events are weighted by their description length, but other sets of weights are possible when biological information is available. The transformation distance from sequence S to sequence T is then the Minimum Description Length among all possible scripts that build T knowing S with segment-based operations. The underlying idea is related to Kolmogorov complexity theory. We present an algorithm which, given two sequences S and T, computes exactly and efficiently the transformation distance from S to T. Unlike alignment methods, the method we propose does not necessarily respect the order of the residues within the compared sequences and is therefore able to account for duplications and translocations that cannot be properly described by sequence alignment. A biological application on Tnt1 tobacco retrotransposon is presented. AVAILABILITY: The algorithm and the graphical interface can be downloaded at http://www.lifl.fr/ approximately varre/TD

Lenhof, H P; Morgenstern, B; Reinert, K

doi: 10.1093/bioinformatics/15.3.203pmid: 10222407

MOTIVATION: In molecular biology, sequence alignment is a crucial tool in studying the structure and function of molecules, as well as the evolution of species. In the segment-to-segment variation of the multiple alignment problem, the input can be seen as a set of non-gapped segment pairs (diagonals). Given a weight function that assigns a weight score to every possible diagonal, the goal is to choose a consistent set of diagonals of maximum weight. We show that the segment-to-segment multiple alignment problem is equivalent to a novel formulation of the Maximum Trace problem: the Generalized Maximum Trace (GMT) problem. Solving this problem to optimality, therefore, may improve upon the previous greedy strategies that are used for solving the segment-to-segment multiple sequence alignment problem. We show that the GMT can be stated in terms of an integer linear program and then solve the integer linear program using methods from polyhedral combinatorics. This leads to a branch-and-cut algorithm for segment-to-segment multiple sequence alignment. RESULTS: We report on our first computational experiences with this novel method and show that the program is able to find optimal solutions for real-world test examples.

Morgenstern, B

doi: 10.1093/bioinformatics/15.3.211pmid: 10222408

MOTIVATION: The performance and time complexity of an improved version of the segment-to-segment approach to multiple sequence alignment is discussed. In this approach, alignments are composed from gap-free segment pairs, and the score of an alignment is defined as the sum of so-called weights of these segment pairs. RESULTS: A modification of the weight function used in the original version of the alignment program DIALIGN has two important advantages: it can be applied to both globally and locally related sequence sets, and the running time of the program is considerably improved. The time complexity of the algorithm is discussed theoretically, and the program running time is reported for various test examples. AVAILABILITY: The program is available on-line at the Bielefeld University Bioinformatics Server (BiBiServ) http://bibiserv.TechFak.Uni-Bielefeld.DE/dial ign/

Möller, S; Leser, U; Fleischmann, W; Apweiler, R

doi: 10.1093/bioinformatics/15.3.219pmid: 10222409

SUMMARY: Many databases in molecular biology face the problem that the ever increasing rate of data production can no longer be handled by traditional methods, especially human curation. Therefore, a number of projects are currently investigating methods for automated sequence annotation. This paper describes the EBI's approach to this problem for protein sequences by integration of arbitrary analysis programs into a distributed and highly flexible environment. Our software framework allows an individual treatment of sequences depending on their particular properties, which is achieved through a high-level description of the preconditions and capabilities of analysing modules. This not only improves the overall performance of the annotation process, as unnecessary steps are avoided, but also enhances its quality since dependencies between different modules are taken into account. We have implemented a prototype and use it in the production of TrEMBL releases. AVAILABILITY: Upon request.

Fleischmann, W; Möller, S; Gateau, A; Apweiler, R

doi: 10.1093/bioinformatics/15.3.228pmid: 10222410

MOTIVATION: To cope with the increasing amount of sequence data, reliable automatic annotation tools are required. The TrEMBL database contains together with SWISS-PROT nearly all publicly available protein sequences, but in contrast to SWISS-PROT only limited functional annotation. To improve this situation, we had to develop a method of automatic annotation that produces highly reliable functional prediction using the language and the syntax of SWISS-PROT. RESULTS: An algorithm was developed and successfully used for the automatic annotation of a testset of unknown proteins. The predicted information included description, function, catalytic activity, cofactors, pathway, subcellular location, quaternary structure, similarity to other protein, active sites, and keywords. The algorithm showed a low coverage (10%), but a high specificity and reliability. AVAILABILITY: The results can be obtained by anonymous ftp from ftp.ebi.ac.uk/pub/databases/sp_tr_nrdb. The source code is available on request from the authors.

Backofen, R; Will, S; Bornberg-Bauer, E

doi: 10.1093/bioinformatics/15.3.234pmid: 10222411

MOTIVATION: Predicting the ground state of biopolymers is a notoriously hard problem in biocomputing. Model systems, such as lattice proteins, are simple tools and valuable to test and improve new methods. Best known are models with sequences composed from a binary (hydrophobic and polar) alphabet. The major drawback is the degeneracy, i.e. the number of different ground state conformations. RESULTS: We show how recently developed constraint programming techniques can be used to solve the structure prediction problem efficiently for a higher order alphabet. To our knowledge it is the first report of an exact and computationally feasible solution to model proteins of length up to 36 and without resorting to maximally compact states. We further show that degeneracy is reduced by more than one order of magnitude and that ground state conformations are not necessarily compact. Therefore, more realistic protein simulations become feasible with our model.

Rarey, M; Kramer, B; Lengauer, T

doi: 10.1093/bioinformatics/15.3.243pmid: 10222412

MOTIVATION: Matching of chemical interacting groups is a common concept for docking and fragment placement algorithms in computer-aided drug design. These algorithms have been proven to be reliable and fast if at least a certain number of hydrogen bonds or salt bridges occur. However, the algorithms typically run into problems if hydrophobic fragments or ligands should be placed. In order to dock hydrophobic fragments without significant loss of computational efficiency, we have extended the interaction model and placement algorithms in our docking tool FlexX. The concept of multi-level interactions is introduced into the algorithms for automatic selection and placement of base fragments. RESULTS: With the multi-level interaction model and the corresponding algorithmic extensions, we were able to improve the overall performance of FlexX significantly. We tested the approach with a set of 200 protein-ligand complexes taken from the Brookhaven Protein Data Bank (PDB). The number of test cases which can be docked within 1.5 A RMSD from the crystal structure can be increased from 58 to 64%. The performance gain is paid for by an increase in computation time from 73 to 91 s on average per protein-ligand complex. AVAILABILITY: The FlexX molecular docking software is available for UNIX platforms IRIX, Solaris and Linux. See http://cartan.gmd.de/FlexX for additional information.

Pfeiffer, T; Sánchez-Valdenebro, I; Nuño, J C; Montero, F; Schuster, S

doi: 10.1093/bioinformatics/15.3.251pmid: 10222413

MOTIVATION: To reconstruct metabolic pathways from biochemical and/or genome sequence data, the stoichiometric and thermodynamic feasibility of the pathways has to be tested. This is achieved by characterizing the admissible region of flux distributions in steady state. This region is spanned by what can be called a convex basis. The concept of 'elementary flux modes' provides a mathematical tool to define all metabolic routes that are feasible in a given metabolic network. In addition, we define 'enzyme subsets' to be groups of enzymes that operate together in fixed flux proportions in all steady states of the system. RESULTS: Algorithms for computing the convex basis and elementary modes developed earlier are briefly reviewed. A newly developed algorithm for detecting all enzyme subsets in a given network is presented. All of these algorithms have been implemented in a novel computer program named METATOOL, whose features are outlined here. The algorithms are illustrated by an example taken from sugar metabolism. AVAILABILITY: METATOOL is available from ftp://bmsdarwin.brookes.ac. uk/pub/software/ibmpc/metatool. SUPPLEMENTARY INFORMATION: http://www. biologie.hu-berlin.de/biophysics/Theory/tpfeiffer/metatoo l.html