A biochemical screen for identification of small-molecule regulators of the Wnt pathway using Xenopus egg extracts

Misregulation of the Wnt pathway has been shown to be responsible for a variety of human diseases, most notably cancers. Screens for inhibitors of this pathway have been performed almost exclusively using cultured mammalian cells or with purified proteins. We have previously developed a biochemical assay using Xenopus egg extracts to recapitulate key cytoplasmic events in the Wnt pathway. Using this biochemical system, we show that a recombinant form of the Wnt coreceptor, LRP6, regulates the stability of two key components of the Wnt pathway (β-catenin and Axin) in opposing fashion. We have now fused β-catenin and Axin to firefly and Renilla luciferase, respectively, and demonstrate that the fusion proteins behave similarly as their wild-type counterparts. Using this dual luciferase readout, we adapted the Xenopus extracts system for high-throughput screening. Results from these screens demonstrate signal distribution curves that reflect the complexity of the library screened. Of several compounds identified as cytoplasmic modulators of the Wnt pathway, one was further validated as a bona fide inhibitor of the Wnt pathway in cultured mammalian cells and Xenopus embryos. We show that other embryonic pathways may be amendable to screening for inhibitors/modulators in Xenopus egg extracts.     

Interfacing interpreted and compiled languages to support applications on a massively parallel network of workstations (MP‐NOW)

The advent of Massively Parallel Network of Workstations (MP-NOW) represents an important trend in high performance computing. The rise of interpreted languages (e.g., Visual Basic, MATLAB, IDL, Maple and Mathematica) for algorithm development, prototyping, data analysis and graphical user interfaces (GUIs) represents an important trend in software engineering. However, using interpreted languages on a MP-NOW is a significant challenge. We present a specific example of a very simple, but generic solution to this problem. Our example uses an interpreted language to set up a calculation and then interfaces with a computational kernel written in a compiled language (e.g., C, C++, Fortran). The interpreted language calls the computational kernel as an external library. We have added to the computational kernel an additional layer, which manages multiple copies of the kernel running on a MP-NOW and returns the results back to the interpreted layer. Our implementation uses The Next generation Taskbag (TNT) library developed at Sarnoff to provide an efficient means for implementing task parallelism. A test problem (taken from Astronomy) has been implemented on the Sarnoff Cyclone computer which consists of 160 heterogeneous nodes connected by a “fat” tree 100 Mb/s switched Ethernet running the RedHat Linux and FreeBSD operating systems. Our first results in this ongoing project have demonstrated the feasibility of this approach and produced speedups of greater than 50 on 60 processors. This revised version was published online in July 2006 with corrections to the Cover Date.     

Parallel Sequence Matching with TACO's Distributed Object Groups – A Case Study from Molecular Biology

TACO is a template library that implements higher-order parallel operations on distributed object sets by means of reusable topology classes and C++ function templates. In this paper we discuss an experimental application that exploits TACO's distributed object groups and collective operations for computing the similarity between groups of molecular sequences, a computationally intensive core problem in molecular biology research. In particular we show how TACO's distributed collections can be conveniently combined with well known concepts found in the C++ standard template library (STL) to solve matching and sorting problems effectively on distributed hardware platforms. The resulting implementation is concise and gives excellent parallel performance on PC- and workstation clusters.     

GeCo++: a C++ library for genomic features computation and annotation in the presence of variants

We propose a C++ class library developed to the purpose of making the implementation of sequence analysis algorithms easier and faster when genomic annotations and variations need to be considered. The library provides a class hierarchy to seamlessly bind together annotations of genomic elements to sequences and to algorithm results; it allows to evaluate the effect of mutations/variations in terms of both element position shifts and of algorithm results, limiting recalculation to the minimum. Particular care has been posed to keep memory and time overhead into acceptable limits. AVAILABILITY AND IMPLEMENTATION: A complete tutorial as well as a detailed doxygen generated documentation and source code is freely available at http://bioinformatics.emedea.it/geco, under the GPL license. The library was written in standard ISO C++, and does not depend on external libraries.     

MetaCyc and AraCyc. Metabolic pathway databases for plant research

MetaCyc (http://metacyc.org) contains experimentally determined biochemical pathways to be used as a reference database for metabolism. In conjunction with the Pathway Tools software, MetaCyc can be used to computationally predict the metabolic pathway complement of an annotated genome. To increase the breadth of pathways and enzymes, more than 60 plant-specific pathways have been added or updated in MetaCyc recently. In contrast to MetaCyc, which contains metabolic data for a wide range of organisms, AraCyc is a species-specific database containing only enzymes and pathways found in the model plant Arabidopsis (Arabidopsis thaliana). AraCyc (http://arabidopsis.org/tools/aracyc/) was the first computationally predicted plant metabolism database derived from MetaCyc. Since its initial computational build, AraCyc has been under continued curation to enhance data quality and to increase breadth of pathway coverage. Twenty-eight pathways have been manually curated from the literature recently. Pathway predictions in AraCyc have also been recently updated with the latest functional annotations of Arabidopsis genes that use controlled vocabulary and literature evidence. AraCyc currently features 1,418 unique genes mapped onto 204 pathways with 1,156 literature citations. The Omics Viewer, a user data visualization and analysis tool, allows a list of genes, enzymes, or metabolites with experimental values to be painted on a diagram of the full pathway map of AraCyc. Other recent enhancements to both MetaCyc and AraCyc include implementation of an evidence ontology, which has been used to provide information on data quality, expansion of the secondary metabolism node of the pathway ontology to accommodate curation of secondary metabolic pathways, and enhancement of the cellular component ontology for storing and displaying enzyme and pathway locations within subcellular compartments.     

Libsequence: a C++ class library for evolutionary genetic analysis

A C++ class library is available to facilitate the implementation of software for genomics and sequence polymorphism analysis. The library implements methods for data manipulation and the calculation of several statistics commonly used to analyze SNP data. The object-oriented design of the library is intended to be extensible, allowing users to design custom classes for their own needs. In addition, routines are provided to process samples generated by a widely used coalescent simulation. AVAILABILITY: The source code (in C++) is available from http://www.molpopgen.org     

Spectrum-to-spectrum searching using a proteome-wide spectral library

The unambiguous assignment of tandem mass spectra (MS/MS) to peptide sequences remains a key unsolved problem in proteomics. Spectral library search strategies have emerged as a promising alternative for peptide identification, in which MS/MS spectra are directly compared against a reference library of confidently assigned spectra. Two problems relate to library size. First, reference spectral libraries are limited to rediscovery of previously identified peptides and are not applicable to new peptides, because of their incomplete coverage of the human proteome. Second, problems arise when searching a spectral library the size of the entire human proteome. We observed that traditional dot product scoring methods do not scale well with spectral library size, showing reduction in sensitivity when library size is increased. We show that this problem can be addressed by optimizing scoring metrics for spectrum-to-spectrum searches with large spectral libraries. MS/MS spectra for the 1.3 million predicted tryptic peptides in the human proteome are simulated using a kinetic fragmentation model (MassAnalyzer version2.1) to create a proteome-wide simulated spectral library. Searches of the simulated library increase MS/MS assignments by 24% compared with Mascot, when using probabilistic and rank based scoring methods. The proteome-wide coverage of the simulated library leads to 11% increase in unique peptide assignments, compared with parallel searches of a reference spectral library. Further improvement is attained when reference spectra and simulated spectra are combined into a hybrid spectral library, yielding 52% increased MS/MS assignments compared with Mascot searches. Our study demonstrates the advantages of using probabilistic and rank based scores to improve performance of spectrum-to-spectrum search strategies.     

Designer Nodal/BMP2 Chimeras Mimic Nodal Signaling,Promote Chondrogenesis,and Reveal a BMP2-like Structure

Nodal, a member of the TGF-β superfamily, plays an important role in vertebrate and invertebrate early development. The biochemical study of Nodal and its signaling pathway has been a challenge, mainly because of difficulties in producing the protein in sufficient quantities. We have developed a library of stable, chemically refoldable Nodal/BMP2 chimeric ligands (NB2 library). Three chimeras, named NB250, NB260, and NB264, show Nodal-like signaling properties including dependence on the co-receptor Cripto and activation of the Smad2 pathway. NB250, like Nodal, alters heart looping during the establishment of embryonic left-right asymmetry, and both NB250 and NB260, as well as Nodal, induce chondrogenic differentiation of human adipose-derived stem cells. This Nodal-induced differentiation is shown to be more efficient than BPM2-induced differentiation. Interestingly, the crystal structure of NB250 shows a backbone scaffold similar to that of BMP2. Our results show that these chimeric ligands may have therapeutic implications in cartilage injuries.     

Development of a homogeneous AlphaLISA ubiquitination assay using ubiquitin binding matrices as universal components for the detection of ubiquitinated proteins

The Ubiquitin Proteasome Pathway (UPP) has become a target rich pathway for therapeutic intervention as its role in pathogenic disease is better understood. In particular many E3 ligases within this pathway have been implicated in cancer, inflammation and metabolic diseases. It has been of great interest to develop biochemical assays to identify inhibitors of catalytic E3 ubiquitination activity as a means of abrogating the disease mechanism. Here we describe a homogeneous biochemical assay that utilizes native ubiquitin and Tandem-repeated Ubiquitin-Binding Entities (TUBEs) as a detection technology for ubiquitination activity. We developed a TUBEs based proximity AlphaLisa? assay for Mdm2, which is an E3 ligase that negatively regulates p53 tumor suppressor protein. We further demonstrate that this assay strategy or design can also be applied to the development of assays to detect autoubiquitination of other E3 ligases that are also of interest for therapeutic intervention. This article is part of a Special Issue entitled: Ubiquitin Drug Discovery and Diagnostics.     

WindowMasker: window-based masker for sequenced genomes

MOTIVATION: Matches to repetitive sequences are usually undesirable in the output of DNA database searches. Repetitive sequences need not be matched to a query, if they can be masked in the database. RepeatMasker/Maskeraid (RM), currently the most widely used software for DNA sequence masking, is slow and requires a library of repetitive template sequences, such as a manually curated RepBase library, that may not exist for newly sequenced genomes. RESULTS: We have developed a software tool called WindowMasker (WM) that identifies and masks highly repetitive DNA sequences in a genome, using only the sequence of the genome itself. WM is orders of magnitude faster than RM because WM uses a few linear-time scans of the genome sequence, rather than local alignment methods that compare each library sequence with each piece of the genome. We validate WM by comparing BLAST outputs from large sets of queries applied to two versions of the same genome, one masked by WM, and the other masked by RM. Even for genomes such as the human genome, where a good RepBase library is available, searching the database as masked with WM yields more matches that are apparently non-repetitive and fewer matches to repetitive sequences. We show that these results hold for transcribed regions as well. WM also performs well on genomes for which much of the sequence was in draft form at the time of the analysis. AVAILABILITY: WM is included in the NCBI C++ toolkit. The source code for the entire toolkit is available at ftp://ftp.ncbi.nih.gov/toolbox/ncbi_tools++/CURRENT/. Once the toolkit source is unpacked, the instructions for building WindowMasker application in the UNIX environment can be found in file src/app/winmasker/README.build. SUPPLEMENTARY INFORMATION: Supplementary data are available at ftp://ftp.ncbi.nlm.nih.gov/pub/agarwala/windowmasker/windowmasker_suppl.pdf     

Fatty acid and lipoic acid biosynthesis in higher plant mitochondria

Fatty acid and lipoic acid biosynthesis were investigated in plant mitochondria. Although the mitochondria lack acetyl-CoA carboxylase, our experiments reveal that they contain the enzymatic equipment necessary to transform malonate into the two main building units for fatty acid synthesis: malonyl- and acetyl-acyl carrier protein (ACP). We demonstrated, by a new method based on a complementary use of high performance liquid chromatography and mass spectrometry, that the soluble mitochondrial fatty-acid synthase produces mainly three predominant acyl-ACPs as follows: octanoyl(C8)-, hexadecanoyl(C16)-, and octadecanoyl(C18)-ACP. Octanoate production is of primary interest since it has been postulated long ago to be a precursor of lipoic acid. By using a recombinant H apoprotein mutant as a potential acceptor for newly synthesized lipoic acid, we were able to detect limited amounts of lipoylated H protein in the presence of malonate, several sulfur donors, and cofactors. Finally, we present a scheme outlining the new biochemical pathway of fatty acid and lipoic acid synthesis in plant mitochondria.     

An iterative refinement algorithm for consistency based multiple structural alignment methods

MOTIVATION: Multiple STructural Alignment (MSTA) provides valuable information for solving problems such as fold recognition. The consistency-based approach tries to find conflict-free subsets of alignments from a pre-computed all-to-all Pairwise Alignment Library (PAL). If large proportions of conflicts exist in the library, consistency can be hard to get. On the other hand, multiple structural superposition has been used in many MSTA methods to refine alignments. However, multiple structural superposition is dependent on alignments, and a superposition generated based on erroneous alignments is not guaranteed to be the optimal superposition. Correcting errors after making errors is not as good as avoiding errors from the beginning. Hence it is important to refine the pairwise library to reduce the number of conflicts before any consistency-based assembly. RESULTS: We present an algorithm, Iterative Refinement of Induced Structural alignment (IRIS), to refine the PAL. A new measurement for the consistency of a library is also proposed. Experiments show that our algorithm can greatly improve T-COFFEE performance for less consistent pairwise alignment libraries. The final multiple alignment outperforms most state-of-the-art MSTA algorithms at assembling 15 transglycosidases. Results on three other benchmarks showed that the algorithm consistently improves multiple alignment performance. AVAILABILITY: The C++ code of the algorithm is available upon request.     

Priority Based Messaging for Software Distributed Shared Memory

Software Distributed Shared Memory (DSM) systems can be used to provide a coherent shared address space on multicomputers and other parallel systems without support for shared memory in hardware. The coherency software automatically translates shared memory accesses to explicit messages exchanged among the nodes in the system. Many applications exhibit a good performance on such systems but it has been shown that, for some applications, performance critical messages can be delayed behind less important messages because of the enqueuing behavior in the communication libraries used in current systems. We present in this paper a new portable communication library that supports priorities to remedy this situation. We describe an implementation of the communication library and a quantitative model that is used to estimate the performance impact of priorities for a typical situation. Using the model, we show that the use of high-priority communication reduces the latency of performance critical messages substantially over a wide range of network design parameters. The latency is reduced with up to 10–25% for each delaying low priority message in the queue ahead.     

Valproic acid induces hair regeneration in murine model and activates alkaline phosphatase activity in human dermal papilla cells

BACKGROUND: Alopecia is the common hair loss problem that can affect many people. However, current therapies for treatment of alopecia are limited by low efficacy and potentially undesirable side effects. We have identified a new function for valproic acid (VPA), a GSK3β inhibitor that activates the Wnt/β-catenin pathway, to promote hair re-growth in vitro and in vivo. METHODOLOGY/ PRINCIPAL FINDINGS: Topical application of VPA to male C3H mice critically stimulated hair re-growth and induced terminally differentiated epidermal markers such as filaggrin and loricrin, and the dermal papilla marker alkaline phosphatase (ALP). VPA induced ALP in human dermal papilla cells by up-regulating the Wnt/β-catenin pathway, whereas minoxidil (MNX), a drug commonly used to treat alopecia, did not significantly affect the Wnt/β-catenin pathway. VPA analogs and other GSK3β inhibitors that activate the Wnt/β-catenin pathway such as 4-phenyl butyric acid, LiCl, and BeCl(2) also exhibited hair growth-promoting activities in vivo. Importantly, VPA, but not MNX, successfully stimulate hair growth in the wounds of C3H mice. CONCLUSIONS/ SIGNIFICANCE: Our findings indicate that small molecules that activate the Wnt/β-catenin pathway, such as VPA, can potentially be developed as drugs to stimulate hair re-growth.     

Decoupling dynamical systems for pathway identification from metabolic profiles

RATIONALE: Modern molecular biology is generating data of unprecedented quantity and quality. Particularly exciting for biochemical pathway modeling and proteomics are comprehensive, time-dense profiles of metabolites or proteins that are measurable, for instance, with mass spectrometry, nuclear magnetic resonance or protein kinase phosphorylation. These profiles contain a wealth of information about the structure and dynamics of the pathway or network from which the data were obtained. The retrieval of this information requires a combination of computational methods and mathematical models, which are typically represented as systems of ordinary differential equations. RESULTS: We show that, for the purpose of structure identification, the substitution of differentials with estimated slopes in non-linear network models reduces the coupled system of differential equations to several sets of decoupled algebraic equations, which can be processed efficiently in parallel or sequentially. The estimation of slopes for each time series of the metabolic or proteomic profile is accomplished with a 'universal function' that is computed directly from the data by cross-validated training of an artificial neural network (ANN). CONCLUSIONS: Without preprocessing, the inverse problem of determining structure from metabolic or proteomic profile data is challenging and computationally expensive. The combination of system decoupling and data fitting with universal functions simplifies this inverse problem very significantly. Examples show successful estimations and current limitations of the method. AVAILABILITY: A preliminary Web-based application for ANN smoothing is accessible at http://bioinformatics.musc.edu/webmetabol/. S-systems can be interactively analyzed with the user-friendly freeware PLAS (http://correio.cc.fc.ul.pt/~aenf/plas.html) or with the MATLAB module BSTLab (http://bioinformatics.musc.edu/bstlab/), which is currently being beta-tested.     

Identification and characterization of a novel (S)-ketoprofen-specific esterase

A new (S)-ketoprofen specific esterase (EST-Y29) was identified from a metagenome library from environmental samples, which showed homologies with class C-beta lactamase, penicillin binding protein, and other lipases/esterases. In order to investigate the biochemical and biophysical properties, the recombinant protein was overexpressed, purified to homogeneity, and characterized. This EST-Y29 has high catalytic activity against p-nitrophenyl esters of short fatty acids (C(2) and C(4)) and alpha-naphthyl acetate with activation energy of 30.4 kJ/mol. We have further characterized EST-Y29 using high performance liquid chromatography (HPLC), circular dichroism (CD), dynamic light scattering (DLS) and size exclusion chromatography (SEC).     

Efficient filtering methods for clustering cDNAs with spliced sequence alignment

MOTIVATION: Clustering sequences of a full-length cDNA library into alternative splice form candidates is a very important problem. RESULTS: We developed a new efficient algorithm to cluster sequences of a full-length cDNA library into alternative splice form candidates. Current clustering algorithms for cDNAs tend to produce too many clusters containing incorrect splice form candidates. Our algorithm is based on a spliced sequence alignment algorithm that considers splice sites. The spliced sequence alignment algorithm is a variant of an ordinary dynamic programming algorithm, which requires O(nm) time for checking a pair of sequences where n and m are the lengths of the two sequences. Since the time bound is too large to perform all-pair comparison for a large set of sequences, we developed new techniques to reduce the computation time without affecting the accuracy of the output clusters. Our algorithm was applied to 21 076 mouse cDNA sequences of the FANTOM 1.10 database to examine its performance and accuracy. In these experiments, we achieved about 2-12-fold speedup against a method using only a traditional hash-based technique. Moreover, without using any information of the mouse genome sequence data or any gene data in public databases, we succeeded in listing 87-89% of all the clusters that biologists have annotated manually. AVAILABILITY: We provide a web service for cDNA clustering located at https://access.obigrid.org/ibm/cluspa/, for which registration for the OBIGrid (http://www.obigrid.org) is required.