Host factors that facilitate viral entry into cells can, in principle, be identified from a virus-host protein interaction network, but for most viruses information for such a network is limited. To help fill this void, we developed a bioinformatics approach and applied it to hepatitis C virus (HCV) infection, which is a current concern for global health. Using this approach, we identified short linear sequence motifs, conserved in the envelope proteins of HCV (E1/E2), that potentially can bind human proteins present on the surface of hepatocytes so as to construct an HCV (envelope)-host protein interaction network. Gene Ontology functional and KEGG pathway analyses showed that the identified host proteins are enriched in cell entry and carcinogenesis functionalities. The validity of our results is supported by much published experimental data. Our general approach should be useful when developing antiviral agents, particularly those that target virus-host interactions.

BACKGROUND: An increasing number of genetic components are available in several depositories of such components to facilitate synthetic biology research, but picking out those that will allow a designed circuit to achieve the specified function still requires multiple cycles of testing. Here, we addressed this problem by developing a computational pipeline to mathematically simulate a gene circuit for a comprehensive range and combination of the kinetic parameters of the biological components that constitute the gene circuit. RESULTS: We showed that, using a well-studied transcriptional repression cascade as an example, the sets of kinetic parameters that could produce the specified system dynamics of the gene circuit formed clusters of recurrent combinations, referred to as kinetic motifs, which appear to be associated with both the specific topology and specified dynamics of the circuit. Furthermore, the use of the resulting "handbook" of performance-ranked kinetic motifs in finding suitable circuit components was illustrated in two application scenarios. CONCLUSIONS: These results show that the computational pipeline developed here can provide a rational-based guide to aid in the design and improvement of synthetic gene circuits.

MOTIVATION: Knowledge about the site at which a ligand binds provides an important clue for predicting the function of a protein and is also often a prerequisite for performing docking computations in virtual drug design and screening. We have previously shown that certain ligand-interacting triangles of protein atoms, called protein triangles, tend to occur more frequently at ligand-binding sites than at other parts of the protein. RESULTS: In this work, we describe a new ligand-binding site prediction method that was developed based on binding site-enriched protein triangles. The new method was tested on 2 benchmark datasets and on 19 targets from two recent community-based studies of such predictions, and excellent results were obtained. Where comparisons were made, the success rates for the new method for the first predicted site were significantly better than methods that are not a meta-predictor. Further examination showed that, for most of the unsuccessful predictions, the pocket of the ligand-binding site was identified, but not the site itself, whereas for some others, the failure was not due to the method itself but due to the use of an incorrect biological unit in the structure examined, although using correct biological units would not necessarily improve the prediction success rates. These results suggest that the new method is a valuable new addition to a suite of existing structure-based bioinformatics tools for studies of molecular recognition and related functions of proteins in post-genomics research. AVAILABILITY: The executable binaries and a web server for our method are available from http://sourceforge.net/projects/msdock/ and http://lise.ibms.sinica.edu.tw, respectively, free for academic users.

BACKGROUND: A good scoring function is essential for molecular docking computations. In conventional scoring functions, energy terms modeling pairwise interactions are cumulatively summed, and the best docking solution is selected. Here, we propose to transform protein-ligand interactions into three-dimensional geometric networks, from which recurring network substructures, or network motifs, are selected and used to provide probability-ranked interaction templates with which to score docking solutions. RESULTS: A novel scoring function for protein-ligand docking, MotifScore, was developed. It is non-energy-based, and docking is, instead, scored by counting the occurrences of motifs of protein-ligand interaction networks constructed using structures of protein-ligand complexes. MotifScore has been tested on a benchmark set established by others to assess its ability to identify near-native complex conformations among a set of decoys. In this benchmark test, 84% of the highest-scored docking conformations had root-mean-square deviations (rmsds) below 2.0 A from the native conformation, which is comparable with the best of several energy-based docking scoring functions. Many of the top motifs, which comprise a multitude of chemical groups that interact simultaneously and make a highly significant contribution to MotifScore, capture recurrent interacting patterns beyond pairwise interactions. CONCLUSIONS: While providing quite good docking scores, MotifScore is quite different from conventional energy-based functions. MotifScore thus represents a new, network-based approach for exploring problems associated with molecular docking.

BACKGROUND: A metabolic network is the sum of all chemical transformations or reactions in the cell, with the metabolites being interconnected by enzyme-catalyzed reactions. Many enzymes exist in numerous species while others occur only in a few. We ask if there are relationships between the phylogenetic profile of an enzyme, or the number of different bacterial species that contain it, and its topological importance in the metabolic network. Our null hypothesis is that phylogenetic profile is independent of topological importance. To test our null hypothesis we constructed an enzyme network from the KEGG (Kyoto Encyclopedia of Genes and Genomes) database. We calculated three network indices of topological importance: the degree or the number of connections of a network node; closeness centrality, which measures how close a node is to others; and betweenness centrality measuring how frequently a node appears on all shortest paths between two other nodes. RESULTS: Enzyme phylogenetic profile correlates best with betweenness centrality and also quite closely with degree, but poorly with closeness centrality. Both betweenness and closeness centralities are non-local measures of topological importance and it is intriguing that they have contrasting power of predicting phylogenetic profile in bacterial species. We speculate that redundancy in an enzyme network may be reflected by betweenness centrality but not by closeness centrality. We also discuss factors influencing the correlation between phylogenetic profile and topological importance. CONCLUSION: Our analysis falsifies the hypothesis that phylogenetic profile of enzymes is independent of enzyme network importance. Our results show that phylogenetic profile correlates better with degree and betweenness centrality, but less so with closeness centrality. Enzymes that occur in many bacterial species tend to be those that have high network importance. We speculate that this phenomenon originates in mechanisms driving network evolution. Closeness centrality reflects phylogenetic profile poorly. This is because metabolic networks often consist of distinct functional modules and some are not in the centre of the network. Enzymes in these peripheral parts of a network might be important for cell survival and should therefore occur in many bacterial species. They are, however, distant from other enzymes in the same network.

Fragment assembly is attracting intense research interest as a means of predicting protein structure from sequences. Success requires a good library of local structures (i.e. fragments) to serve as building blocks for whole protein reconstruction. Here, we describe a novel two-stage clustering scheme for identifying recurrent local structures and deriving fragment libraries. Parameters that represent cluster compactness, distinctiveness, and coverage were used for evaluating library quality. According to test results, our system was capable of approximating protein structures with smaller library sets at a level of accuracy comparable to or better than methods previously reported by others.

Abstract Motivation: Synteny mapping, or detecting regions that are orthologous between two genomes, is a key step in studies of comparative genomics. For completely sequenced genomes, this is increasingly accomplished by whole-genome sequence alignment. However, such methods are computationally expensive, especially for large genomes, and require rather complicated post-processing procedures to filter out non-orthologous sequence matches. Results: We have developed a novel method that does not require sequence alignment for synteny mapping of two large genomes, such as the human and mouse. In this method, the occurrence spectra of genome-wide unique 16mer sequences present in both the human and mouse genome are used to directly detect orthologous genomic segments. Being sequence alignment-free, the method is very fast and able to map the two mammalian genomes in one day of computing time on a single Pentium IV personal computer. The resulting human–mouse synteny map was shown to be in excellent agreement with those produced by the Mouse Genome Sequencing Consortium (MGSC) and by the Ensembl team; furthermore, the syntenic relationship of segments found only by our method was supported by BLASTZ sequence alignment. Availability: The source code of our method and the resulting human–mouse synteny maps have been placed at http://synteny.ibms.sinica.edu.tw/ for free access. Supplementary information: Seven supplementary figures can be found at the same website.

Abstract Motivation: Protein structure comparison (PSC) has been used widely in studies of structural and functional genomics. However, PSC is computationally expensive and as a result almost all of the PSC methods currently in use look only for the optimal alignment and ignore many alternative alignments that are statistically significant and that may provide insight into protein evolution or folding. Results: We have developed a new PSC method with efficiency to detect potentially viable alternative alignments in all-against-all database comparisons. The efficiency of the new PSC method derives from the ability to directly home in on a limited number of viable and ranked alignment solutions based on intuitively derived SSE (secondary structure element)-matching probabilities. Availability: The new PSC tool is accessible at our lab website http://gln.ibms.sinica.edu.tw/software.php Contact: [email protected] Supplementary Information: Supplementary tables and figures for this paper can be found at the same website. * To whom correspondence should be addressed.