Demo Data from EDBT 2026 / reviewers in the wild / expert
Takuji Yamada
dblp:06/4570
· DBLP profile ↗
8ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0002-9622-1849ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 8 · 1 first-author · 3 since 2021
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
2 papers |
Bioinformatics and computational biology · 100% | |
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% | |
| Artificial intelligence
1 paper |
Deep learning architectures and training · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › protein function prediction
enzyme function annotation |
0.9 | 1 | 2025 | DeepES: deep learning-based enzyme screening to identify orphan enzyme genes · Bioinform. 2025 |
Bioinformatics and computational biology
functional genomics |
0.4 | 1 | 2019 | FuncTree2: an interactive radial tree for functional hierarchies and omics data visualization · Bioinform. 2019 |
Visualization and visual analytics
biological data visualization |
0.4 | 1 | 2019 | FuncTree2: an interactive radial tree for functional hierarchies and omics data visualization · Bioinform. 2019 |
Visualization and visual analytics
hierarchical data visualization |
0.4 | 1 | 2019 | FuncTree2: an interactive radial tree for functional hierarchies and omics data visualization · Bioinform. 2019 |
Methods — techniques the papers use, named apart from their topics
deep learning · 1.7binary classifier · 1.7radial tree layout · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | DeepES: deep learning-based enzyme screening to identify orphan enzyme genesabstractMOTIVATION: Progress in sequencing technology has led to determination of large numbers of protein sequences, and large enzyme databases are now available. Although many computational tools for enzyme annotation were developed, sequence information is unavailable for many enzymes, known as orphan enzymes. These orphan enzymes hinder sequence similarity-based functional annotation, leading gaps in understanding the association between sequences and enzymatic reactions. RESULTS: Therefore, we developed DeepES, a deep learning-based tool for enzyme screening to identify orphan enzyme genes, focusing on biosynthetic gene clusters and reaction class. DeepES uses protein sequences as inputs and evaluates whether the input genes contain biosynthetic gene clusters of interest by integrating the outputs of the binary classifier for each reaction class. The validation results suggested that DeepES can capture functional similarity between protein sequences, and it can be implemented to explore orphan enzyme genes. By applying DeepES to 4744 metagenome-assembled genomes, we identified candidate genes for 236 orphan enzymes, including those involved in short-chain fatty acid production as a characteristic pathway in human gut bacteria. AVAILABILITY AND IMPLEMENTATION: DeepES is available at https://github.com/yamada-lab/DeepES. Model weights and the candidate genes are available at Zenodo (https://doi.org/10.5281/zenodo.11123900). Keisuke Hirota, Felix Salim, Takuji Yamada |
Bioinform. | 3 |
| 2024 | Enteropathway: the metabolic pathway database for the human gut microbiotaabstractThe human gut microbiota produces diverse, extensive metabolites that have the potential to affect host physiology. Despite significant efforts to identify metabolic pathways for producing these microbial metabolites, a comprehensive metabolic pathway database for the human gut microbiota is still lacking. Here, we present Enteropathway, a metabolic pathway database that integrates 3269 compounds, 3677 reactions, and 876 modules that were obtained from 1012 manually curated scientific literature. Notably, 698 modules of these modules are new entries and cannot be found in any other databases. The database is accessible from a web application (https://enteropathway.org) that offers a metabolic diagram for graphical visualization of metabolic pathways, a customization interface, and an enrichment analysis feature for highlighting enriched modules on the metabolic diagram. Overall, Enteropathway is a comprehensive reference database that can complement widely used databases, and a tool for visual and statistical analysis in human gut microbiota studies and was designed to help researchers pinpoint new insights into the complex interplay between microbiota and host metabolism. Hirotsugu Shiroma, Youssef Darzi, Etsuko Terajima, Zenichi Nakagawa, Hirotaka Tsuchikura, Naoki Tsukuda, Yuki Moriya, Shujiro Okuda, Susumu Goto, Takuji Yamada |
Briefings Bioinform. | 10 |
| 2024 | QNetDiff: a quantitative measurement of network rewiringabstractBacteria in the human body, particularly in the large intestine, are known to be associated with various diseases. To identify disease-associated bacteria (markers), a typical method is to statistically compare the relative abundance of bacteria between healthy subjects and diseased patients. However, since bacteria do not necessarily cause diseases in isolation, it is also important to focus on the interactions and relationships among bacteria when examining their association with diseases. In fact, although there are common approaches to represent and analyze bacterial interaction relationships as networks, there are limited methods to find bacteria associated with diseases through network-driven analysis. In this paper, we focus on rewiring of the bacterial network and propose a new method for quantifying the rewiring. We then apply the proposed method to a group of colorectal cancer patients. We show that it can identify and detect bacteria that cannot be detected by conventional methods such as abundance comparison. Furthermore, the proposed method is implemented as a general-purpose tool and made available to the general public. Shota Nose, Hirotsugu Shiroma, Takuji Yamada, Yushi Uno |
BMC Bioinform. | 3 |
| 2019 | FuncTree2: an interactive radial tree for functional hierarchies and omics data visualizationabstractSUMMARY: Functional annotations and their hierarchical classification are widely used in omics workflows to build novel insight upon existing biological knowledge. Currently, a plethora of tools is available to explore omics datasets at the level of functional annotations, but there is a lack of feature rich and user-friendly tools that help scientists take advantage of their hierarchical classification for additional and often invaluable insights. Here, we present FuncTree2, a user-friendly web application that turns hierarchical classifications into interactive and highly customizable radial trees, and enables researchers to visualize their data simultaneously on all its levels. FuncTree2 features mapping of data from multiple samples and several navigation features like zooming, panning, re-rooting and collapsing of nodes or levels. AVAILABILITY AND IMPLEMENTATION: FuncTree2 is freely available at https://bioviz.tokyo/functree2/ as a web application and a REST API. Source code is available on GitHub https://github.com/yamada-lab/functree-ng. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Youssef Darzi, Yuta Yamate, Takuji Yamada |
Bioinform. | 3 |
| 2015 | DomSign: a top-down annotation pipeline to enlarge enzyme space in the protein universeabstractBACKGROUND: Computational predictions of catalytic function are vital for in-depth understanding of enzymes. Because several novel approaches performing better than the common BLAST tool are rarely applied in research, we hypothesized that there is a large gap between the number of known annotated enzymes and the actual number in the protein universe, which significantly limits our ability to extract additional biologically relevant functional information from the available sequencing data. To reliably expand the enzyme space, we developed DomSign, a highly accurate domain signature-based enzyme functional prediction tool to assign Enzyme Commission (EC) digits. RESULTS: DomSign is a top-down prediction engine that yields results comparable, or superior, to those from many benchmark EC number prediction tools, including BLASTP, when a homolog with an identity >30% is not available in the database. Performance tests showed that DomSign is a highly reliable enzyme EC number annotation tool. After multiple tests, the accuracy is thought to be greater than 90%. Thus, DomSign can be applied to large-scale datasets, with the goal of expanding the enzyme space with high fidelity. Using DomSign, we successfully increased the percentage of EC-tagged enzymes from 12% to 30% in UniProt-TrEMBL. In the Kyoto Encyclopedia of Genes and Genomes bacterial database, the percentage of EC-tagged enzymes for each bacterial genome could be increased from 26.0% to 33.2% on average. Metagenomic mining was also efficient, as exemplified by the application of DomSign to the Human Microbiome Project dataset, recovering nearly one million new EC-labeled enzymes. CONCLUSIONS: Our results offer preliminarily confirmation of the existence of the hypothesized huge number of "hidden enzymes" in the protein universe, the identification of which could substantially further our understanding of the metabolisms of diverse organisms and also facilitate bioengineering by providing a richer enzyme resource. Furthermore, our results highlight the necessity of using more advanced computational tools than BLAST in protein database annotations to extract additional biologically relevant functional information from the available biological sequences. Tianmin Wang, Hiroshi Mori, Ken Kurokawa, Xin-Hui Xing, Takuji Yamada |
BMC Bioinform. | 6 |
| 2014 | CLAST: CUDA implemented large-scale alignment search toolabstractBACKGROUND: Metagenomics is a powerful methodology to study microbial communities, but it is highly dependent on nucleotide sequence similarity searching against sequence databases. Metagenomic analyses with next-generation sequencing technologies produce enormous numbers of reads from microbial communities, and many reads are derived from microbes whose genomes have not yet been sequenced, limiting the usefulness of existing sequence similarity search tools. Therefore, there is a clear need for a sequence similarity search tool that can rapidly detect weak similarity in large datasets. RESULTS: We developed a tool, which we named CLAST (CUDA implemented large-scale alignment search tool), that enables analyses of millions of reads and thousands of reference genome sequences, and runs on NVIDIA Fermi architecture graphics processing units. CLAST has four main advantages over existing alignment tools. First, CLAST was capable of identifying sequence similarities ~80.8 times faster than BLAST and 9.6 times faster than BLAT. Second, CLAST executes global alignment as the default (local alignment is also an option), enabling CLAST to assign reads to taxonomic and functional groups based on evolutionarily distant nucleotide sequences with high accuracy. Third, CLAST does not need a preprocessed sequence database like Burrows-Wheeler Transform-based tools, and this enables CLAST to incorporate large, frequently updated sequence databases. Fourth, CLAST requires <2 GB of main memory, making it possible to run CLAST on a standard desktop computer or server node. CONCLUSIONS: CLAST achieved very high speed (similar to the Burrows-Wheeler Transform-based Bowtie 2 for long reads) and sensitivity (equal to BLAST, BLAT, and FR-HIT) without the need for extensive database preprocessing or a specialized computing platform. Our results demonstrate that CLAST has the potential to be one of the most powerful and realistic approaches to analyze the massive amount of sequence data from next-generation sequencing technologies. Masahiro Yano, Hiroshi Mori, Yutaka Akiyama, Takuji Yamada, Ken Kurokawa |
BMC Bioinform. | 4 |
| 2006 | Extraction of phylogenetic network modules from the metabolic networkabstractBACKGROUND: In bio-systems, genes, proteins and compounds are related to each other, thus forming complex networks. Although each organism has its individual network, some organisms contain common sub-networks based on function. Given a certain sub-network, the distribution of organisms common to it represents the diversity of its function. RESULTS: We extracted such "common" sub-networks, defined as "phylogenetic network modules," using phylogenetic profiles and cluster analysis. The enzymes in the same "phylogenetic network module" have similar phylogenetic profiles and related functions. These modules are shown to be phylogenetic building blocks. Furthermore, the network of the modules illustrated hierarchical feature as well as the network of enzymes involved in the metabolism. CONCLUSION: We conclude that phylogenetic network modules are evolutionary conserved functional units in the metabolic network. We claim that our concept of phylogenetic modules provides a more accurate understanding of the evolution of biological networks. Takuji Yamada, Minoru Kanehisa, Susumu Goto |
BMC Bioinform. | 1 |
| 2004 | Clustering under the line graph transformation: application to reaction networkabstractBACKGROUND: Many real networks can be understood as two complementary networks with two kind of nodes. This is the case of metabolic networks where the first network has chemical compounds as nodes and the second one has nodes as reactions. In general, the second network may be related to the first one by a technique called line graph transformation (i.e., edges in an initial network are transformed into nodes). Recently, the main topological properties of the metabolic networks have been properly described by means of a hierarchical model. While the chemical compound network has been classified as hierarchical network, a detailed study of the chemical reaction network had not been carried out. RESULTS: We have applied the line graph transformation to a hierarchical network and the degree-dependent clustering coefficient C(k) is calculated for the transformed network. C(k) indicates the probability that two nearest neighbours of a vertex of degree k are connected to each other. While C(k) follows the scaling law C(k) approximately k(-1.1) for the initial hierarchical network, C(k) scales weakly as k0.08 for the transformed network. This theoretical prediction was compared with the experimental data of chemical reactions from the KEGG database finding a good agreement. CONCLUSIONS: The weak scaling found for the transformed network indicates that the reaction network can be identified as a degree-independent clustering network. By using this result, the hierarchical classification of the reaction network is discussed. Jose C. Nacher, Nobuhisa Ueda, Takuji Yamada, Minoru Kanehisa, Tatsuya Akutsu |
BMC Bioinform. | 3 |