Demo Data from VLDB 2026 / reviewers in the wild / expert
Kenji Satou
dblp:74/3833
· DBLP profile ↗
11ranked-venue papers
2as first author
0since 2021 · last 2014
0000-0001-5474-7087ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 9 · 2 first-authorArtificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
5 papers |
Bioinformatics and computational biology · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › phylogenetics › phylogenetic inference
distance-based tree reconstruction |
0.1 | 1 | 2007 | Phylogenetic reconstruction from non-genomic data · Bioinform. 2007 |
Bioinformatics and computational biology
phylogenetics |
0.1 | 1 | 2007 | Phylogenetic reconstruction from non-genomic data · Bioinform. 2007 |
Bioinformatics and computational biology › phylogenetics
phylogenetic inference |
0.1 | 1 | 2007 | Phylogenetic reconstruction from non-genomic data · Bioinform. 2007 |
Bioinformatics and computational biology
association rule mining |
0.0 | 1 | 2002 | Extraction of knowledge on protein-protein interaction by association rule discovery · Bioinform. 2002 |
Bioinformatics and computational biology › protein analysis
protein-protein interaction |
0.0 | 1 | 2002 | Extraction of knowledge on protein-protein interaction by association rule discovery · Bioinform. 2002 |
Bioinformatics and computational biology
protein structure analysis |
0.0 | 2 | 1997 | Application of a deductive database system to search for topological and similar three-dimensional structures in protein · Comput. Appl. Biosci. 1997 A deductive database system PACADE for analyzing 3-D and secondary structures of protein · Comput. Appl. Biosci. 1993 |
Bioinformatics and computational biology › protein analysis › protein bioinformatics
protein function analysis |
0.0 | 1 | 1997 | Extraction of Substructures of Proteins Essential to their Biological Functions by a Data Mining Technique · ISMB 1997 |
Bioinformatics and computational biology › protein structure analysis
structural similarity search |
0.0 | 1 | 1997 | Application of a deductive database system to search for topological and similar three-dimensional structures in protein · Comput. Appl. Biosci. 1997 |
Methods — techniques the papers use, named apart from their topics
neighbor-joining · 0.1enzyme similarity measures · 0.1UPGMA · 0.1data mining · 0.1association rule mining · 0.0deductive database · 0.0declarative rules · 0.0logic programming · 0.0deductive inference · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Discovering statistically non-redundant subgroups
Jiuyong Li, Jixue Liu, Hannu Toivonen, Kenji Satou, Youqiang Sun, Bing-Yu Sun |
Knowl. Based Syst. | 4 |
| 2013 | Inferring microRNA and transcription factor regulatory networks in heterogeneous dataabstractBACKGROUND: Transcription factors (TFs) and microRNAs (miRNAs) are primary metazoan gene regulators. Regulatory mechanisms of the two main regulators are of great interest to biologists and may provide insights into the causes of diseases. However, the interplay between miRNAs and TFs in a regulatory network still remains unearthed. Currently, it is very difficult to study the regulatory mechanisms that involve both miRNAs and TFs in a biological lab. Even at data level, a network involving miRNAs, TFs and genes will be too complicated to achieve. Previous research has been mostly directed at inferring either miRNA or TF regulatory networks from data. However, networks involving a single type of regulator may not fully reveal the complex gene regulatory mechanisms, for instance, the way in which a TF indirectly regulates a gene via a miRNA. RESULTS: We propose a framework to learn from heterogeneous data the three-component regulatory networks, with the presence of miRNAs, TFs, and mRNAs. This method firstly utilises Bayesian network structure learning to construct a regulatory network from multiple sources of data: gene expression profiles of miRNAs, TFs and mRNAs, target information based on sequence data, and sample categories. Then, in order to produce more meaningful results for further biological experimentation and research, the method searches the learnt network to identify the interplay between miRNAs and TFs and applies a network motif finding algorithm to further infer the network.We apply the proposed framework to the data sets of epithelial-to-mesenchymal transition (EMT). The results elucidate the complex gene regulatory mechanism for EMT which involves both TFs and miRNAs. Several discovered interactions and molecular functions have been confirmed by literature. In addition, many other discovered interactions and bio-markers are of high statistical significance and thus can be good candidates for validation by experiments. Moreover, the results generated by our method are compact, involving a small number of interactions which have been proved highly relevant to EMT. CONCLUSIONS: We have designed a framework to infer gene regulatory networks involving both TFs and miRNAs from multiple sources of data, including gene expression data, target information, and sample categories. Results on the EMT data sets have shown that the proposed approach is able to produce compact and meaningful gene regulatory networks that are highly relevant to the biological conditions of the data sets. This framework has the potential for application to other heterogeneous datasets to reveal the complex gene regulatory relationships. Thuc Duy Le, Lin Liu 0003, Bing Liu 0002, Anna Tsykin, Gregory J. Goodall, Kenji Satou, Jiuyong Li |
BMC Bioinform. | 6 |
| 2012 | EpicCapo: epitope prediction using combined information of amino acid pairwise contact potentials and HLA-peptide contact site informationabstractBACKGROUND: Epitope identification is an essential step toward synthetic vaccine development since epitopes play an important role in activating immune response. Classical experimental approaches are laborious and time-consuming, and therefore computational methods for generating epitope candidates have been actively studied. Most of these methods, however, are based on sophisticated nonlinear techniques for achieving higher predictive performance. The use of these techniques tend to diminish their interpretability with respect to binding potential: that is, they do not provide much insight into binding mechanisms. RESULTS: We have developed a novel epitope prediction method named EpicCapo and its variants, EpicCapo(+) and EpicCapo(+REF). Nonapeptides were encoded numerically using a novel peptide-encoding scheme for machine learning algorithms by utilizing 40 amino acid pairwise contact potentials (referred to as AAPPs throughout this paper). The predictive performances of EpicCapo(+) and EpicCapo(+REF) outperformed other state-of-the-art methods without losing interpretability. Interestingly, the most informative AAPPs estimated by our study were those developed by Micheletti and Simons while previous studies utilized two AAPPs developed by Miyazawa & Jernigan and Betancourt & Thirumalai. In addition, we found that all amino acid positions in nonapeptides could effect on performances of the predictive models including non-anchor positions. Finally, EpicCapo(+REF) was applied to identify candidates of promiscuous epitopes. As a result, 67.1% of the predicted nonapeptides epitopes were consistent with preceding studies based on immunological experiments. CONCLUSIONS: Our method achieved high performance in testing with benchmark datasets. In addition, our study identified a number of candidates of promiscuous CTL epitopes consistent with previously reported immunological experiments. We speculate that our techniques may be useful in the development of new vaccines. The R implementation of EpicCapo(+REF) is available at http://pirun.ku.ac.th/~fsciiok/EpicCapoREF.zip. Datasets are available at http://pirun.ku.ac.th/~fsciiok/Datasets.zip. Thammakorn Saethang, Osamu Hirose, Ingorn Kimkong, Vu Anh Tran, Xuan Tho Dang, Thi Lan Anh Nguyen, Thi Tu Kien Le, Mamoru Kubo, Yoichi Yamada, Kenji Satou |
BMC Bioinform. | 10 |
| 2008 | Finding microRNA regulatory modules in human genome using rule inductionabstractBACKGROUND: MicroRNAs (miRNAs) are a class of small non-coding RNA molecules (20-24 nt), which are believed to participate in repression of gene expression. They play important roles in several biological processes (e.g. cell death and cell growth). Both experimental and computational approaches have been used to determine the function of miRNAs in cellular processes. Most efforts have concentrated on identification of miRNAs and their target genes. However, understanding the regulatory mechanism of miRNAs in the gene regulatory network is also essential to the discovery of functions of miRNAs in complex cellular systems. To understand the regulatory mechanism of miRNAs in complex cellular systems, we need to identify the functional modules involved in complex interactions between miRNAs and their target genes. RESULTS: We propose a rule-based learning method to identify groups of miRNAs and target genes that are believed to participate cooperatively in the post-transcriptional gene regulation, so-called miRNA regulatory modules (MRMs). Applying our method to human genes and miRNAs, we found 79 MRMs. The MRMs are produced from multiple information sources, including miRNA-target binding information, gene expression and miRNA expression profiles. Analysis of two first MRMs shows that these MRMs consist of highly-related miRNAs and their target genes with respect to biological processes. CONCLUSION: The MRMs found by our method have high correlation in expression patterns of miRNAs as well as mRNAs. The mRNAs included in the same module shared similar biological functions, indicating the ability of our method to detect functionality-related genes. Moreover, review of the literature reveals that miRNAs in a module are involved in several types of human cancer. Dang Hung Tran, Kenji Satou |
BMC Bioinform. | 2 |
| 2007 | Prediction of Histone Modifications in DNA sequencesabstractDNA molecules are wrapped around histone octamers to form nucleosome structures whose occupancy and histone modification states profoundly influence the gene expression. Depending on the DNA segment that a nuleosome incorporated, its histone proteins exihibit paticular modifications by added some functional chemical groups to specific amino acids. The key approach up to now to determining the DNA locations of histone occupancy as well as histone modifications is an experimental technique called ChiP-Chip, or Chromatin Immunoprecipitation on Microarray Chip. This experimental technique has some disadvantages such as it is tedious, wastes time and money, produces noise, and cannot provide results at an arbitrarily high resolution, especially with large genomes like human's. We have developed a computational method to determine qualitatively histone-occupied as well as acetylation and methylation locations in DNA sequences. The method is based on support vector machines (SVMs) to learn models from training data sets that discriminate between areas with high and low levels of histone occupancy, acetylation or methylation. Our computational method can give quickly the prediction at any position in a DNA sequence based on the content and context of the subsequence around that position. The prediction results on the yeast genome by three-fold cross-validation showed high accuracy and were consistent with the ones from experimental methods. Moreover, SVM-classification models in our method can present genetic preferences of DNA areas that have high modification levels. Tho Hoan Pham, Dang Hung Tran, Kenji Satou |
BIBE | 4 |
| 2007 | Phylogenetic reconstruction from non-genomic dataabstractMOTIVATION: Recent results related to horizontal gene transfer suggest that phylogenetic reconstruction cannot be determined conclusively from sequence data, resulting in a shift from approaches based on polymorphism information in DNA or protein sequence to studies aimed at understanding the evolution of complete biological processes. The increasing amount of available information on metabolic pathways for several species makes it of greater relevance to understand the similarities and differences among such pathways. These similarities can then be used to infer phylogenetic trees not based exclusively in sequence data, therefore avoiding the previously mentioned problems. RESULTS: In this article, we present a method to assess the structural similarity of metabolic pathways for several organisms. Our algorithms work by using one of the three possible enzyme similarity measures (hierarchical, information content, gene ontology), and one of the two clustering methods (neighbor-joining, unweighted pair group method with arithmetic mean), to produce a phylogenetic tree both in Newick and graphic format. The web server implementing our algorithms is optimized to answer queries in linear time. AVAILABILITY: The software is available for free public use on a web server, at the address http://www.jaist.ac.jp/~clemente/cgi-bin/phylo.pl. It is available on demand in source code form for research use to educational institutions, non-profit research institutes, government research laboratories and individuals, for non-exclusive use, without the right of the licensee to further redistribute the source code. José Carlos Clemente, Kenji Satou, Gabriel Valiente |
Bioinform. | 2 |
| 2005 | Using Inductive Logic Programming for Predicting Protein-Protein Interactions from Multiple Genomic Data
Tuan Nam Tran, Kenji Satou |
PKDD | 2 |
| 2002 | Extraction of knowledge on protein-protein interaction by association rule discoveryabstractMOTIVATION: Protein-protein interactions are systematically examined using the yeast two-hybrid method. Consequently, a lot of protein-protein interaction data are currently being accumulated. Nevertheless, general information or knowledge on protein-protein interactions is poorly extracted from these data. Thus we have been trying to extract the knowledge from the protein-protein interaction data using data mining. RESULTS: A data mining method is proposed to discover association rules related to protein-protein interactions. To evaluate the detected rules by the method, a new scoring measure of the rules is introduced. The method allowed us to detect popular interaction rules such as "An SH3 domain binds to a proline-rich region." These results indicate that the method may detect novel knowledge on protein-protein interactions. T. Oyama, K. Kitano, Kenji Satou, Takashi Ito |
Bioinform. | 3 |
| 1997 | Extraction of Substructures of Proteins Essential to their Biological Functions by a Data Mining Technique
Kenji Satou, Toshihide Ono, Yoshihisa Yamamura, Emiko Furuichi, Satoru Kuhara, Toshihisa Takagi |
ISMB | 1 |
| 1997 | Application of a deductive database system to search for topological and similar three-dimensional structures in proteinabstractA deductive database system PACADE (Protein Atomic Coordinate Analyzer with Deductive Engine) has been developed for protein structure analysis. With this system, super-secondary structures described in logical and declarative rules can be retrieved effectively. For protein structure analysis, comparison of local structures in different proteins is a necessary mean. A function to search for similar structures has, therefore, been added to the PACADE system. We describe herein the result of searches for the same topological structures and three-dimensionally similar ones. A user of PACADE can select these two levels of similarity by changing parameters. This function enables the inference system to retrieve similar structures, according to the restraints of variables defined by the user. Similar super-secondary structures among proteins can be searched for automatically, which is useful for protein structure analysis. The retrieved similar super-secondary structures can serve as criteria for protein spatial alignment. Y. Tsukamoto, Kyoko Takiguchi, Kenji Satou, Emiko Furuichi, Toshihisa Takagi, Satoru Kuhara |
Comput. Appl. Biosci. | 3 |
| 1993 | A deductive database system PACADE for analyzing 3-D and secondary structures of proteinabstractWe have developed a deductive database system PACADE for analyzing 3-D and secondary structures of protein. The PACADE system consists of a relational database created from Protein Data Bank and a deductive engine DEE based on logic programming. It has the following features: (1) The system has an inference mechanism. This means by which users can easily write and check biological hypotheses using logical and declarative rules instead of procedural programs. (2) The relational database of the PACADE system stores data on both 3-D and secondary structures of protein. The integration of this two level structure makes feasible an abstract representation of the protein structure. We describe herein the design, functions, and implementation of this PACADE system. Kenji Satou, Emiko Furuichi, Kyoko Takiguchi, Toshihisa Takagi, Satoru Kuhara |
Comput. Appl. Biosci. | 1 |