Search

Schizophrenia genome-wide association studies (GWAS) have reported many genomic risk loci, but it is unclear how they affect schizophrenia susceptibility through interactions of multiple SNPs. We propose a stepwise deep learning technique with multi-precision data (SLEM) to explore the SNP combination effects on schizophrenia through intermediate molecular and cellular functions. The SLEM technique utilizes two levels of precision data for learning. It constructs initial backbone networks with more precise but small amount of multilevel assay data. Then, it learns strengths of intermediate interactions with the less precise but massive amount of GWAS data. The learned networks facilitate identifying effective SNP interactions from the intractably large space of all possible SNP combinations. We have shown that the extracted SNP combinations show higher accuracy than any single SNPs and preserve the accuracy in an independent dataset. The learned networks also provide interpretations of molecular and cellular interactions of SNP combinations toward schizophrenia etiology., (© The Author(s) 2023. Published by Oxford University Press.)

Community cohesion plays a critical role in the determination of an individual's health in social science. Intriguingly, a community structure of gene networks indicates that the concept of community cohesion could be applied between the genes as well to overcome the limitations of single gene-based biomarkers for precision oncology. Here, we develop community cohesion scores which precisely quantify the community ability to retain the interactions between the genes and their cellular functions in each individualized gene network. Using breast cancer as a proof-of-concept study, we measure the community cohesion score profiles of 950 case samples and predict the individualized therapeutic targets in 2-fold. First, we prioritize them by finding druggable genes present in the community with the most and relatively decreased scores in each individual. Then, we pinpoint more individualized therapeutic targets by discovering the genes which greatly contribute to the community cohesion looseness in each individualized gene network. Compared with the previous approaches, the community cohesion scores show at least four times higher performance in predicting effective individualized chemotherapy targets based on drug sensitivity data. Furthermore, the community cohesion scores successfully discover the known breast cancer subtypes and we suggest new targeted therapy targets for triple negative breast cancer (e.g. KIT and GABRP). Lastly, we demonstrate that the community cohesion scores can predict tamoxifen responses in ER+ breast cancer and suggest potential combination therapies (e.g. NAMPT and RXRA inhibitors) to reduce endocrine therapy resistance based on individualized characteristics. Our method opens new perspectives for the biomarker development in precision oncology., (© The Author(s) 2024. Published by Oxford University Press.)

Motivation: Adverse drug reactions (ADRs) are a major issue in drug development and clinical pharmacology. As most ADRs are caused by unintended activity at off-targets of drugs, the identification of drug targets responsible for ADRs becomes a key process for resolving ADRs. Recently, with the increase in the number of ADR-related data sources, several computational methodologies have been proposed to analyze ADR-protein relations. However, the identification of ADR-related proteins on a large scale with high reliability remains an important challenge., Results: In this article, we suggest a computational approach, Large-scale ADR-related Proteins Identification with Network Embedding (LAPINE). LAPINE combines a novel concept called single-target compound with a network embedding technique to enable large-scale prediction of ADR-related proteins for any proteins in the protein-protein interaction network. Analysis of benchmark datasets confirms the need to expand the scope of potential ADR-related proteins to be analyzed, as well as LAPINE's capability for high recovery of known ADR-related proteins. Moreover, LAPINE provides more reliable predictions for ADR-related proteins (Value-added positive predictive value = 0.12), compared to a previously proposed method (P < 0.001). Furthermore, two case studies show that most predictive proteins related to ADRs in LAPINE are supported by literature evidence. Overall, LAPINE can provide reliable insights into the relationship between ADRs and proteomes to understand the mechanism of ADRs leading to their prevention., Availability and Implementation: The source code is available at GitHub (https://github.com/rupinas/LAPINE) and Figshare (https://figshare.com/articles/software/LAPINE/21750245) to facilitate its use., Supplementary Information: Supplementary data are available at Bioinformatics online., (© The Author(s) 2022. Published by Oxford University Press.)

Motivation: Essential gene signatures for cancer growth have been typically identified via RNAi or CRISPR-Cas9. Here, we propose an alternative method that reveals the essential gene signatures by analysing genomic expression profiles in compound-treated cells. With a large amount of the existing compound-induced data, essential gene signatures at genomic scale are efficiently characterized without technical challenges in the previous techniques., Results: An essential gene is characterized as a gene presenting positive correlation between its down-regulation and cell growth inhibition induced by diverse compounds, which were collected from LINCS and CGP. Among 12 741 genes, 1092, 1 228 827 962, 1 664 580 and 829 essential genes are characterized for each of A375, A549, BT20, LNCAP, MCF7, MDAMB231 and PC3 cell lines (P-value ≤ 1.0E-05). Comparisons to the previously identified essential genes yield significant overlaps in A375 and A549 (P-value ≤ 5.0E-05) and the 103 common essential genes are enriched in crucial processes for cancer growth. In most comparisons in A375, MCF7, BT20 and A549, the characterized essential genes yield more essential characteristics than those of the previous techniques, i.e. high gene expression, high degrees of protein-protein interactions, many homologs and few paralogs. Remarkably, the essential genes commonly characterized by both the previous and proposed techniques show more significant essential characteristics than those solely relied on the previous techniques. We expect that this work provides new aspects in essential gene signatures., Availability and Implementation: The Python implementations are available at https://github.com/jmjung83/deconvolution&#95;of&#95;essential&#95;gene&#95;signitures., Supplementary Information: Supplementary data are available at Bioinformatics online., (© The Author(s) 2018. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.)

Hepatocellular carcinoma (HCC) has a high mortality rate and early detection of HCC is crucial for the application of effective treatment strategies. HCC is typically caused by either viral hepatitis infection or by fatty liver disease. To diagnose and treat HCC it is necessary to elucidate the underlying molecular mechanisms. As a major cause for development of HCC is fatty liver disease, we here investigated anomalies in regulation of lipid metabolism in the liver. We applied a tailored network-based approach to identify signaling hubs associated with regulation of this part of metabolism. Using transcriptomics data of HCC patients, we identified significant dysregulated expressions of lipid-regulated genes, across many different lipid metabolic pathways. Our findings, however, show that viral hepatitis causes HCC by a distinct mechanism, less likely involving lipid anomalies. Based on our analysis we suggest signaling hub genes governing overall catabolic or anabolic pathways, as novel drug targets for treatment of HCC that involves lipid anomalies., (© The Author(s) 2016. Published by Oxford University Press on behalf of Nucleic Acids Research.)

Motivation: Finding somatic mutations from massively parallel sequencing data is becoming a standard process in genome-based biomedical studies. There are a number of robust methods developed for detecting somatic single nucleotide variations However, detection of somatic copy number alteration has been substantially less explored and remains vulnerable to frequently raised sampling issues: low frequency in cell population and absence of the matched control samples., Results: We developed a novel computational method SoloDel that accurately classifies low-frequent somatic deletions from germline ones with or without matched control samples. We first constructed a probabilistic, somatic mutation progression model that describes the occurrence and propagation of the event in the cellular lineage of the sample. We then built a Gaussian mixture model to represent the mixed population of somatic and germline deletions. Parameters of the mixture model could be estimated using the expectation-maximization algorithm with the observed distribution of read-depth ratios at the points of discordant-read based initial deletion calls. Combined with conventional structural variation caller, SoloDel greatly increased the accuracy in classifying somatic mutations. Even without control, SoloDel maintained a comparable performance in a wide range of mutated subpopulation size (10-70%). SoloDel could also successfully recall experimentally validated somatic deletions from previously reported neuropsychiatric whole-genome sequencing data., Availability and Implementation: Java-based implementation of the method is available at http://sourceforge.net/projects/solodel/, Contact: swkim@yuhs.ac or dhlee@biosoft.kaist.ac.kr, Supplementary Information: Supplementary data are available at Bioinformatics online., (© The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.)

Motivation: Complex physiological relationships exist among human diseases. Thus, the identification of disease associations could provide new methods of disease care and diagnosis. To this end, numerous studies have investigated disease associations. However, combinatorial effect of physiological factors, which is the main characteristic of biological systems, has not been considered in most previous studies., Results: In this study, we inferred disease associations with a novel approach that considered disease-related clinical factors in combinatorial ways by using the National Health and Nutrition Examination Survey data, and the results have been shown as disease networks. Here, the FP-growth algorithm, an association rule mining algorithm, was used to generate a clinical attribute combination profile of each disease. In addition, we characterized the 22 clinical risk attribute combinations frequently discovered from the 26 diseases in this study. Furthermore, we validated that the results of this study have great potential for drug repositioning and outperform other existing disease networks in this regard. Finally, we suggest a few disease pairs as new candidates for drug repositioning and provide the evidence of their associations from the literature.

Motivation: RBSDesigner predicts the translation efficiency of existing mRNA sequences and designs synthetic ribosome binding sites (RBSs) for a given coding sequence (CDS) to yield a desired level of protein expression. The program implements the mathematical model for translation initiation described in Na et al. (Mathematical modeling of translation initiation for the estimation of its efficiency to computationally design mRNA sequences with a desired expression level in prokaryotes. BMC Syst. Biol., 4, 71). The program additionally incorporates the effect on translation efficiency of the spacer length between a Shine-Dalgarno (SD) sequence and an AUG codon, which is crucial for the incorporation of fMet-tRNA into the ribosome. RBSDesigner provides a graphical user interface (GUI) for the convenient design of synthetic RBSs., Availability: RBSDesigner is written in Python and Microsoft Visual Basic 6.0 and is publicly available as precompiled stand-alone software on the web (http://rbs.kaist.ac.kr)., Contact: dhlee@kaist.ac.kr

Motivation: Mathematical models of biological systems often have a large number of parameters whose combinational variations can yield distinct qualitative behaviors. Since it is intractable to examine all possible combinations of parameters for non-trivial biological pathways, it is required to have a systematic strategy to explore the parameter space in a computational way so that dynamic behaviors of a given pathway are estimated., Results: We present PSExplorer, a computational tool for exploring qualitative behaviors and key parameters of molecular signaling pathways. Utilizing the Latin hypercube sampling and a clustering technique in a recursive paradigm, the software enables users to explore the whole parameter space of the models to search for robust qualitative behaviors. The parameter space is partitioned into sub-regions according to behavioral differences. Sub-regions showing robust behaviors can be identified for further analyses. The partitioning result presents a tree structure from which individual and combinational effects of parameters on model behaviors can be assessed and key factors of the models are readily identified., Availability: The software, tutorial manual and test models are available for download at the following address: http://gto.kaist.ac.kr/∼psexplorer.

Motivation: Gene set analysis has become an important tool for the functional interpretation of high-throughput gene expression datasets. Moreover, pattern analyses based on inferred gene set activities of individual samples have shown the ability to identify more robust disease signatures than individual gene-based pattern analyses. Although a number of approaches have been proposed for gene set-based pattern analysis, the combinatorial influence of deregulated gene sets on disease phenotype classification has not been studied sufficiently., Results: We propose a new approach for inferring combinatorial Boolean rules of gene sets for a better understanding of cancer transcriptome and cancer classification. To reduce the search space of the possible Boolean rules, we identify small groups of gene sets that synergistically contribute to the classification of samples into their corresponding phenotypic groups (such as normal and cancer). We then measure the significance of the candidate Boolean rules derived from each group of gene sets; the level of significance is based on the class entropy of the samples selected in accordance with the rules. By applying the present approach to publicly available prostate cancer datasets, we identified 72 significant Boolean rules. Finally, we discuss several identified Boolean rules, such as the rule of glutathione metabolism (down) and prostaglandin synthesis regulation (down), which are consistent with known prostate cancer biology., Availability: Scripts written in Python and R are available at http://biosoft.kaist.ac.kr/~ihpark/. The refined gene sets and the full list of the identified Boolean rules are provided in the Supplementary Material., Supplementary Information: Supplementary data are available at Bioinformatics online.

Motivation: For the early detection of cancer, highly sensitive and specific biomarkers are needed. Particularly, biomarkers in bio-fluids are relatively more useful because those can be used for non-biopsy tests. Although the altered metabolic activities of cancer cells have been observed in many studies, little is known about metabolic biomarkers for cancer screening. In this study, a systematic method is proposed for identifying metabolic biomarkers in urine samples by selecting candidate biomarkers from altered genome-wide gene expression signatures of cancer cells. Biomarkers identified by the present study have increased coherence and robustness because the significances of biomarkers are validated in both gene expression profiles and metabolic profiles., Results: The proposed method was applied to the gene expression profiles and urine samples of 50 breast cancer patients and 50 normal persons. Nine altered metabolic pathways were identified from the breast cancer gene expression signatures. Among these altered metabolic pathways, four metabolic biomarkers (Homovanillate, 4-hydroxyphenylacetate, 5-hydroxyindoleacetate and urea) were identified to be different in cancer and normal subjects (p <0.05). In the case of the predictive performance, the identified biomarkers achieved area under the ROC curve values of 0.75, 0.79 and 0.79, according to a linear discriminate analysis, a random forest classifier and on a support vector machine, respectively. Finally, biomarkers which showed consistent significance in pathways' gene expression as well as urine samples were identified., Supplementary Information: Supplementary data are available at Bioinformatics online.

Identifying features that effectively represent the energetic contribution of an individual interface residue to the interactions between proteins remains problematic. Here, we present several new features and show that they are more effective than conventional features. By combining the proposed features with conventional features, we develop a predictive model for interaction hot spots. Initially, 54 multifaceted features, composed of different levels of information including structure, sequence and molecular interaction information, are quantified. Then, to identify the best subset of features for predicting hot spots, feature selection is performed using a decision tree. Based on the selected features, a predictive model for hot spots is created using support vector machine (SVM) and tested on an independent test set. Our model shows better overall predictive accuracy than previous methods such as the alanine scanning methods Robetta and FOLDEF, and the knowledge-based method KFC. Subsequent analysis yields several findings about hot spots. As expected, hot spots have a larger relative surface area burial and are more hydrophobic than other residues. Unexpectedly, however, residue conservation displays a rather complicated tendency depending on the types of protein complexes, indicating that this feature is not good for identifying hot spots. Of the selected features, the weighted atomic packing density, relative surface area burial and weighted hydrophobicity are the top 3, with the weighted atomic packing density proving to be the most effective feature for predicting hot spots. Notably, we find that hot spots are closely related to pi-related interactions, especially pi . . . pi interactions.

PHYTOCHROME INTERACTING FACTOR 3-LIKE5 (PIL5) is a basic helix-loop-helix transcription factor that inhibits seed germination by regulating the expression of gibberellin (GA)- and abscisic acid (ABA)-related genes either directly or indirectly. It is not yet known, however, whether PIL5 regulates seed germination solely through GA and ABA. Here, we used Chromatin immunoprecipitation-chip (ChIP-chip) analysis to identify 748 novel PIL5 binding sites in the Arabidopsis thaliana genome. Consistent with the molecular function of PIL5 as a transcription regulator, most of the identified binding sites are located in gene promoter regions. Binding site analysis shows that PIL5 binds to its target sites mainly through the G-box motif in vivo. Microarray analysis reveals that phytochromes regulate a large number of genes mainly through PIL5 during seed germination. Comparison between the ChIP-chip and microarray data indicates that PIL5 regulates 166 genes by directly binding to their promoters. Many of the identified genes encode transcription regulators involved in hormone signaling, while some encode enzymes involved in cell wall modification. Interestingly, PIL5 directly regulates many transcription regulators of hormone signaling and indirectly regulates many genes involved in hormone metabolism. Taken together, our data indicate that PIL5 inhibits seed germination not just through GA and ABA, but also by coordinating hormone signals and modulating cell wall properties in imbibed seeds.

We present DAhunter, a web-based server that identifies homologous proteins by comparing domain architectures, the organization of protein domains. A major obstacle in comparison of domain architecture is the existence of 'promiscuous' domains, which carry out auxiliary functions and appear in many unrelated proteins. To distinguish these promiscuous domains from protein domains, we assigned a weight score to each domain extracted from RefSeq proteins, based on its abundance and versatility. A domain's score represents its importance in the 'protein world' and is used in the comparison of domain architectures. In scoring domains, DAhunter also considers domain combinations as well as single domains. To measure the similarity of two domain architectures, we developed several methods that are based on algorithms used in information retrieval (the cosine similarity, the Goodman-Kruskal gamma function, and domain duplication index) and then combined these into a similarity score. Compared with other domain architecture algorithms, DAhunter is better at identifying homology. The server is available at http://www.dahunter.kr and http://localodom.kobic.re.kr/dahunter/index.htm.

RNA interference (RNAi) with small interfering RNA (siRNA) has become a powerful tool in functional and medical genomic research through directed post-transcriptional gene silencing. In order to apply RNAi technique for eukaryotic organisms, where frequent alternative splicing results in diversification of mRNAs and finally of proteins, we need spliced mRNA isoform silencing to study the function of individual proteins. AsiDesigner is a web-based siRNA design software system, which provides siRNA design capability to account for alternative splicing for mRNA level gene silencing. It provides numerous novel functions including the designing of common siRNAs for the silencing of more than two mRNAs simultaneously, a scoring scheme to evaluate the performance of designed siRNAs by adopting currently known key design factors, a stepwise off-target searching with BLAST and FASTA algorithms and checking the folding secondary structure energy of siRNAs. To do this, we developed a novel algorithm to evaluate the common target region, where siRNAs can be designed to knockdown a specific mRNA isoform or more than two mRNA isoforms from a target gene simultaneously. The developed algorithm and the AsiDesigner were tested and validated as very effective throughout widely performed gene silencing experiments. It is expected that AsiDesigner will play an important role in functional genomics, drug discovery and other molecular biological research. AsiDesigner is freely accessible at http://sysbio.kribb.re.kr/AsiDesigner/.

With the advent of automated and high-throughput techniques, the number of patent applications containing biological sequences has been increasing rapidly. However, they have attracted relatively little attention compared to other sequence resources. We have built a database server called Patome, which contains biological sequence data disclosed in patents and published applications, as well as their analysis information. The analysis is divided into two steps. The first is an annotation step in which the disclosed sequences were annotated with RefSeq database. The second is an association step where the sequences were linked to Entrez Gene, OMIM and GO databases, and their results were saved as a gene-patent table. From the analysis, we found that 55% of human genes were associated with patenting. The gene-patent table can be used to identify whether a particular gene or disease is related to patenting. Patome is available at http://www.patome.org/; the information is updated bimonthly.

Inherited genetic variation plays a critical but largely uncharacterized role in human differentiation. The completion of the International HapMap Project makes it possible to identify loci that may cause human differentiation. We have devised an approach to find such ethnically variant single-nucleotide polymorphisms (ESNPs) from the genotype profile of the populations included in the International HapMap database. We selected ESNPs using the nearest shrunken centroid method (NSCM), and performed multiple tests for genetic heterogeneity and frequency spectrum on genes having ESNPs. The function and disease association of the selected SNPs were also annotated. This resulted in the identification of 100 736 SNPs that appeared uniquely in each ethnic group. Of these SNPs, 1009 were within disease-associated genes, and 85 were predicted as damaging using the Sorting Intolerant From Tolerant system. This study resulted in the creation of the SNP@Ethnos database, which is designed to make this type of detailed genetic variation approach available to a wider range of researchers. SNP@Ethnos is a public database of ESNPs with annotation information that currently contains 100 736 ESNPs from 10 138 genes, and can be accessed at http://variome.net and http://bioportal.net/ or directly at http://bioportal.kobic.re.kr/SNPatETHNIC/.

Motivation: Clustering technique is used to find groups of genes that show similar expression patterns under multiple experimental conditions. Nonetheless, the results obtained by cluster analysis are influenced by the existence of missing values that commonly arise in microarray experiments. Because a clustering method requires a complete data matrix as an input, previous studies have estimated the missing values using an imputation method in the preprocessing step of clustering. However, a common limitation of these conventional approaches is that once the estimates of missing values are fixed in the preprocessing step, they are not changed during subsequent processes of clustering; badly estimated missing values obtained in data preprocessing are likely to deteriorate the quality and reliability of clustering results. Thus, a new clustering method is required for improving missing values during iterative clustering process., Results: We present a method for Clustering Incomplete data using Alternating Optimization (CIAO) in which a prior imputation method is not required. To reduce the influence of imputation in preprocessing, we take an alternative optimization approach to find better estimates during iterative clustering process. This method improves the estimates of missing values by exploiting the cluster information such as cluster centroids and all available non-missing values in each iteration. To test the performance of the CIAO, we applied the CIAO and conventional imputation-based clustering methods, e.g. k-means based on KNNimpute, for clustering two yeast incomplete data sets, and compared the clustering result of each method using the Saccharomyces Genome Database annotations. The clustering results of the CIAO method are more significantly relevant to the biological gene annotations than those of other methods, indicating its effectiveness and potential for clustering incomplete gene expression data., Availability: The software was developed using Java language, and can be executed on the platforms that JVM (Java Virtual Machine) is running. It is available from the authors upon request.

Subcellular localization is one of the key functional characteristics of proteins. An automatic and efficient prediction method for the protein subcellular localization is highly required owing to the need for large-scale genome analysis. From a machine learning point of view, a dataset of protein localization has several characteristics: the dataset has too many classes (there are more than 10 localizations in a cell), it is a multi-label dataset (a protein may occur in several different subcellular locations), and it is too imbalanced (the number of proteins in each localization is remarkably different). Even though many previous works have been done for the prediction of protein subcellular localization, none of them tackles effectively these characteristics at the same time. Thus, a new computational method for protein localization is eventually needed for more reliable outcomes. To address the issue, we present a protein localization predictor based on D-SVDD (PLPD) for the prediction of protein localization, which can find the likelihood of a specific localization of a protein more easily and more correctly. Moreover, we introduce three measurements for the more precise evaluation of a protein localization predictor. As the results of various datasets which are made from the experiments of Huh et al. (2003), the proposed PLPD method represents a different approach that might play a complimentary role to the existing methods, such as Nearest Neighbor method and discriminate covariant method. Finally, after finding a good boundary for each localization using the 5184 classified proteins as training data, we predicted 138 proteins whose subcellular localizations could not be clearly observed by the experiments of Huh et al. (2003).

Motivation: Inferring the genetic interaction mechanism using Bayesian networks has recently drawn increasing attention due to its well-established theoretical foundation and statistical robustness. However, the relative insufficiency of experiments with respect to the number of genes leads to many false positive inferences., Results: We propose a novel method to infer genetic networks by alleviating the shortage of available mRNA expression data with prior knowledge. We call the proposed method 'modularized network learning' (MONET). Firstly, the proposed method divides a whole gene set to overlapped modules considering biological annotations and expression data together. Secondly, it infers a Bayesian network for each module, and integrates the learned subnetworks to a global network. An algorithm that measures a similarity between genes based on hierarchy, specificity and multiplicity of biological annotations is presented. The proposed method draws a global picture of inter-module relationships as well as a detailed look of intra-module interactions. We applied the proposed method to analyze Saccharomyces cerevisiae stress data, and found several hypotheses to suggest putative functions of unclassified genes. We also compared the proposed method with a whole-set-based approach and two expression-based clustering approaches.

Motivation: Clustering has been used as a popular technique for finding groups of genes that show similar expression patterns under multiple experimental conditions. Many clustering methods have been proposed for clustering gene-expression data, including the hierarchical clustering, k-means clustering and self-organizing map (SOM). However, the conventional methods are limited to identify different shapes of clusters because they use a fixed distance norm when calculating the distance between genes. The fixed distance norm imposes a fixed geometrical shape on the clusters regardless of the actual data distribution. Thus, different distance norms are required for handling the different shapes of clusters., Results: We present the Gustafson-Kessel (GK) clustering method for microarray gene-expression data. To detect clusters of different shapes in a dataset, we use an adaptive distance norm that is calculated by a fuzzy covariance matrix (F) of each cluster in which the eigenstructure of F is used as an indicator of the shape of the cluster. Moreover, the GK method is less prone to falling into local minima than the k-means and SOM because it makes decisions through the use of membership degrees of a gene to clusters. The algorithmic procedure is accomplished by the alternating optimization technique, which iteratively improves a sequence of sets of clusters until no further improvement is possible. To test the performance of the GK method, we applied the GK method and well-known conventional methods to three recently published yeast datasets, and compared the performance of each method using the Saccharomyces Genome Database annotations. The clustering results of the GK method are more significantly relevant to the biological annotations than those of the other methods, demonstrating its effectiveness and potential for clustering gene-expression data., Availability: The software was developed using Java language, and can be executed on the platforms that JVM (Java Virtual Machine) is running. It is available from the authors upon request., Supplementary Information: Supplementary data are available at http://dragon.kaist.ac.kr/gk.

Motivation: The structural interaction of proteins and their domains in networks is one of the most basic molecular mechanisms for biological cells. Topological analysis of such networks can provide an understanding of and solutions for predicting properties of proteins and their evolution in terms of domains. A single paradigm for the analysis of interactions at different layers, such as domain and protein layers, is needed., Results: Applying a colored vertex graph model, we integrated two basic interaction layers under a unified model: (1) structural domains and (2) their protein/complex networks. We identified four basic and distinct elements in the model that explains protein interactions at the domain level. We searched for motifs in the networks to detect their topological characteristics using a pruning strategy and a hash table for rapid detection. We obtained the following results: first, compared with a random distribution, a substantial part of the protein interactions could be explained by domain-level structural interaction information. Second, there were distinct kinds of protein interaction patterns classified by specific and distinguishable numbers of domains. The intermolecular domain interaction was the most dominant protein interaction pattern. Third, despite the coverage of the protein interaction information differing among species, the similarity of their networks indicated shared architectures of protein interaction network in living organisms. Remarkably, there were only a few basic architectures in the model (>10 for a 4-node network topology), and we propose that most biological combinations of domains into proteins and complexes can be explained by a small number of key topological motifs., Contact: doheon@kaist.ac.kr.

Motivation: The transcription of a gene is largely determined by short sequence motifs that serve as binding sites for transcription factors. Recent findings suggest direct relationships between the motifs and gene expression levels. In this work, we present a method for identifying regulatory motifs. Our method makes use of tree-based techniques for recovering the relationships between motifs and gene expression levels., Results: We treat regulatory motifs and gene expression levels as predictor variables and responses, respectively, and use a regression tree model to identify the structural relationships between them. The regression tree methodology is extended to handle responses from multiple experiments by modifying the split function. The significance of regulatory elements is determined by analyzing tree structures and using a variable importance measure. When applied to two data sets of the yeast Saccharomyces cerevisiae, the method successfully identifies most of the regulatory motifs that are known to control gene transcription under the given experimental conditions, and suggests several new putative motifs. Analysis of the tree structures also reconfirms several pairs of motifs that are known to regulate gene transcription in combination., Availability: http://if.kaist.ac.kr/~phuong/RegTree