Christoph Gille

Minor lesion mutational spectrum of the entire NF1 gene does not explain its high mutability but points to a functional domain upstream of the GAP-related domain.

More than 500 unrelated patients with neurofibromatosis type 1 (NF1) were screened for mutations in the NF1 gene. For each patient, the whole coding sequence and all splice sites were studied for aberrations, either by the protein truncation test (PTT), temperature-gradient gel electrophoresis (TGGE) of genomic PCR products, or, most often, by direct genomic sequencing (DGS) of all individual exons. A total of 301 sequence variants, including 278 bona fide pathogenic mutations, were identified. As many as 216 or 183 of the genuine mutations, comprising 179 or 161 different ones, can be considered novel when compared to the recent findings of Upadhyaya and Cooper, or to the NNFF mutation database. Mutation-detection efficiencies of the various screening methods were similar: 47.1% for PTT, 53.7% for TGGE, and 54.9% for DGS. Some 224 mutations (80.2%) yielded directly or indirectly premature termination codons. These mutations showed even distribution over the whole gene from exon 1 to exon 47. Of all sequence variants determined in our study, <20% represent C-->T or G-->A transitions within a CpG dinucleotide, and only six different mutations also occur in NF1 pseudogenes, with five being typical C-->T transitions in a CpG. Thus, neither frequent deamination of 5-methylcytosines nor interchromosomal gene conversion may account for the high mutation rate of the NF1 gene. As opposed to the truncating mutations, the 28 (10.1%) missense or single-amino-acid-deletion mutations identified clustered in two distinct regions, the GAP-related domain (GRD) and an upstream gene segment comprising exons 11-17. The latter forms a so-called cysteine/serine-rich domain with three cysteine pairs suggestive of ATP binding, as well as three potential cAMP-dependent protein kinase (PKA) recognition sites obviously phosphorylated by PKA. Coincidence of mutated amino acids and those conserved between human and Drosophila strongly suggest significant functional relevance of this region, with major roles played by exons 12a and 15 and part of exon 16.

HepatoNet1: a comprehensive metabolic reconstruction of the human hepatocyte for the analysis of liver physiology

We present HepatoNet1, the first reconstruction of a comprehensive metabolic network of the human hepatocyte that is shown to accomplish a large canon of known metabolic liver functions. The network comprises 777 metabolites in six intracellular and two extracellular compartments and 2539 reactions, including 1466 transport reactions. It is based on the manual evaluation of >1500 original scientific research publications to warrant a high‐quality evidence‐based model. The final network is the result of an iterative process of data compilation and rigorous computational testing of network functionality by means of constraint‐based modeling techniques. Taking the hepatic detoxification of ammonia as an example, we show how the availability of nutrients and oxygen may modulate the interplay of various metabolic pathways to allow an efficient response of the liver to perturbations of the homeostasis of blood compounds.

Novel mutations in sarcomeric protein genes in dilated cardiomyopathy.

Mutations in sarcomeric protein genes have been reported to cause dilated cardiomyopathy (DCM). In order to detect novel mutations we screened the sarcomeric protein genes beta-myosin heavy chain (MYH7), myosin-binding protein C (MYBPC3), troponin T (TNNT2), and alpha-tropomyosin (TPM1) in 46 young patients with DCM. Mutation screening was done using single-strand conformation polymorphism (SSCP) analysis and DNA sequencing. The mutations in MYH7 were projected onto the protein data bank-structure (pdb) of myosin of striated muscle. In MYH7 two mutations (Ala223Thr and Ser642Leu) were found in two patients. Ser642Leu is part of the actin-myosin interface. Ala223Thr affects a buried residue near the ATP binding site. In MYBPC3 we found one missense mutation (Asn948Thr) in a male patient. None of the mutations were found in 88 healthy controls and in 136 patients with hypertrophic cardiomyopathy (HCM). Thus mutations in HCM causing genes are not rare in DCM and have potential for functional relevance.

FASIMU: flexible software for flux-balance computation series in large metabolic networks.

BackgroundFlux-balance analysis based on linear optimization is widely used to compute metabolic fluxes in large metabolic networks and gains increasingly importance in network curation and structural analysis. Thus, a computational tool flexible enough to realize a wide variety of FBA algorithms and able to handle batch series of flux-balance optimizations is of great benefit.ResultsWe present FASIMU, a command line oriented software for the computation of flux distributions using a variety of the most common FBA algorithms, including the first available implementation of (i) weighted flux minimization, (ii) fitness maximization for partially inhibited enzymes, and (iii) of the concentration-based thermodynamic feasibility constraint. It allows batch computation with varying objectives and constraints suited for network pruning, leak analysis, flux-variability analysis, and systematic probing of metabolic objectives for network curation. Input and output supports SBML. FASIMU can work with free (lp_solve and GLPK) or commercial solvers (CPLEX, LINDO). A new plugin (faBiNA) for BiNA allows to conveniently visualize calculated flux distributions. The platform-independent program is an open-source project, freely available under GNU public license at http://www.bioinformatics.org/fasimu including manual, tutorial, and plugins.ConclusionsWe present a flux-balance optimization program whose main merits are the implementation of thermodynamics as a constraint, batch series of computations, free availability of sources, choice on various external solvers, and the flexibility on metabolic objectives and constraints.

Superimposé: a 3D structural superposition server

The Superimposé webserver performs structural similarity searches with a preference towards 3D structure-based methods. Similarities can be detected between small molecules (e.g. drugs), parts of large structures (e.g. binding sites of proteins) and entire proteins. For this purpose, a number of algorithms were implemented and various databases are provided. Superimposé assists the user regarding the selection of a suitable combination of algorithm and database. After the computation on our server infrastructure, a visual assessment of the results is provided. The structure-based in silico screening for similar drug-like compounds enables the detection of scaffold-hoppers with putatively similar effects. The possibility to find similar binding sites can be of special interest in the functional analysis of proteins. The search for structurally similar proteins allows the detection of similar folds with different backbone topology. The Superimposé server is available at: http://bioinformatics.charite.de/superimpose.

Alignment-Annotator web server: rendering and annotating sequence alignments

Alignment-Annotator is a novel web service designed to generate interactive views of annotated nucleotide and amino acid sequence alignments (i) de novo and (ii) embedded in other software. All computations are performed at server side. Interactivity is implemented in HTML5, a language native to web browsers. The alignment is initially displayed using default settings and can be modified with the graphical user interfaces. For example, individual sequences can be reordered or deleted using drag and drop, amino acid color code schemes can be applied and annotations can be added. Annotations can be made manually or imported (BioDAS servers, the UniProt, the Catalytic Site Atlas and the PDB). Some edits take immediate effect while others require server interaction and may take a few seconds to execute. The final alignment document can be downloaded as a zip-archive containing the HTML files. Because of the use of HTML the resulting interactive alignment can be viewed on any platform including Windows, Mac OS X, Linux, Android and iOS in any standard web browser. Importantly, no plugins nor Java are required and therefore Alignment-Anotator represents the first interactive browser-based alignment visualization. Availability: http://www.bioinformatics.org/strap/aa/ and http://strap.charite.de/aa/.

KISS for STRAP: user extensions for a protein alignment editor

SUMMARY The Structural Alignment Program STRAP is a comfortable comprehensive editor and analyzing tool for protein alignments. A wide range of functions related to protein sequences and protein structures are accessible with an intuitive graphical interface. Recent features include mapping of mutations and polymorphisms onto structures and production of high quality figures for publication. Here we address the general problem of multi-purpose program packages to keep up with the rapid development of bioinformatical methods and the demand for specific program functions. STRAP was remade implementing a novel design which aims at Keeping Interfaces in STRAP Simple (KISS). KISS renders STRAP extendable to bio-scientists as well as to bio-informaticians. Scientists with basic computer skills are capable of implementing statistical methods or embedding existing bioinformatical tools in STRAP themselves. For bio-informaticians STRAP may serve as an environment for rapid prototyping and testing of complex algorithms such as automatic alignment algorithms or phylogenetic methods. Further, STRAP can be applied as an interactive web applet to present data related to a particular protein family and as a teaching tool. REQUIREMENTS JAVA-1.4 or higher. AVAILABILITY http://www.charite.de/bioinf/strap/

METANNOGEN: compiling features of biochemical reactions needed for the reconstruction of metabolic networks

BackgroundOne central goal of computational systems biology is the mathematical modelling of complex metabolic reaction networks. The first and most time-consuming step in the development of such models consists in the stoichiometric reconstruction of the network, i. e. compilation of all metabolites, reactions and transport processes relevant to the considered network and their assignment to the various cellular compartments. Therefore an information system is required to collect and manage data from different databases and scientific literature in order to generate a metabolic network of biochemical reactions that can be subjected to further computational analyses.ResultsThe computer program METANNOGEN facilitates the reconstruction of metabolic networks. It uses the well-known database of biochemical reactions KEGG of biochemical reactions as primary information source from which biochemical reactions relevant to the considered network can be selected, edited and stored in a separate, user-defined database. Reactions not contained in KEGG can be entered manually into the system. To aid the decision whether or not a reaction selected from KEGG belongs to the considered network METANNOGEN contains information of SWISSPROT and ENSEMBL and provides Web links to a number of important information sources like METACYC, BRENDA, NIST, and REACTOME. If a reaction is reported to occur in more than one cellular compartment, a corresponding number of reactions is generated each referring to one specific compartment. Transport processes of metabolites are entered like chemical reactions where reactants and products have different compartment attributes. The list of compartmentalized biochemical reactions and membrane transport processes compiled by means of METANNOGEN can be exported as an SBML file for further computational analysis. METANNOGEN is highly customizable with respect to the content of the SBML output file, additional data-fields, the graphical input form, highlighting of project specific search terms and dynamically generated Web-links.ConclusionMETANNOGEN is a flexible tool to manage information for the design of metabolic networks. The program requires Java Runtime Environment 1.4 or higher and about 100 MB of free RAM and about 200 MB of free HD space. It does not require installation and can be directly Java-webstarted from http://3d-alignment.eu/metannogen/.

Sequence alignment visualization in HTML5 without Java

MOTIVATION Java has been extensively used for the visualization of biological data in the web. However, the Java runtime environment is an additional layer of software with an own set of technical problems and security risks. HTML in its new version 5 provides features that for some tasks may render Java unnecessary. RESULTS Alignment-To-HTML is the first HTML-based interactive visualization for annotated multiple sequence alignments. The server side script interpreter can perform all tasks like (i) sequence retrieval, (ii) alignment computation, (iii) rendering, (iv) identification of a homologous structural models and (v) communication with BioDAS-servers. The rendered alignment can be included in web pages and is displayed in all browsers on all platforms including touch screen tablets. The functionality of the user interface is similar to legacy Java applets and includes color schemes, highlighting of conserved and variable alignment positions, row reordering by drag and drop, interlinked 3D visualization and sequence groups. Novel features are (i) support for multiple overlapping residue annotations, such as chemical modifications, single nucleotide polymorphisms and mutations, (ii) mechanisms to quickly hide residue annotations, (iii) export to MS-Word and (iv) sequence icons. CONCLUSION Alignment-To-HTML, the first interactive alignment visualization that runs in web browsers without additional software, confirms that to some extend HTML5 is already sufficient to display complex biological data. The low speed at which programs are executed in browsers is still the main obstacle. Nevertheless, we envision an increased use of HTML and JavaScript for interactive biological software. AVAILABILITY AND IMPLEMENTATION Under GPL at: http://www.bioinformatics.org/strap/toHTML/.

Accelerating screening of 3D protein data with a graph theoretical approach

MOTIVATION The Dictionary of Interfaces in Proteins (DIP) is a database collecting the 3D structure of interacting parts of proteins that are called patches. It serves as a repository, in which patches similar to given query patches can be found. The computation of the similarity of two patches is time consuming and traversing the entire DIP requires some hours. In this work we address the question of how the patches similar to a given query can be identified by scanning only a small part of DIP. The answer to this question requires the investigation of the distribution of the similarity of patches. RESULTS The score values describing the similarity of two patches can roughly be divided into three ranges that correspond to different levels of spatial similarity. Interestingly, the two iso-score lines separating the three classes can be determined by two different approaches. Applying a concept of the theory of random graphs reveals significant structural properties of the data in DIP. These can be used to accelerate scanning the DIP for patches similar to a given query. Searches for very similar patches could be accelerated by a factor of more than 25. Patches with a medium similarity could be found 10 times faster than by brute-force search.