Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kota Kasahara

dblp:71/8321 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
1since 2021 · last 2022
0000-0003-0207-6271ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 5 · 3 first-author · 1 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
Computational science and engineering · 70% Bioinformatics and computational biology · 30%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational science and engineering › computational chemistry › molecular simulation
molecular dynamics
0.212016
mDCC_tools: characterizing multi-modal atomic motions in molecular dynamics trajectories · Bioinform. 2016
Computational science and engineering › computational chemistry › molecular simulation › molecular dynamics
trajectory analysis
0.212016
mDCC_tools: characterizing multi-modal atomic motions in molecular dynamics trajectories · Bioinform. 2016
Bioinformatics and computational biology › gene regulation › binding site prediction
ligand binding site prediction
0.112010
Ligand-binding site prediction of proteins based on known fragment-fragment interactions · Bioinform. 2010
Bioinformatics and computational biology
protein structure analysis
0.112010
Ligand-binding site prediction of proteins based on known fragment-fragment interactions · Bioinform. 2010

Methods — techniques the papers use, named apart from their topics

dynamic cross-correlation · 0.2complex network analysis · 0.2bayesian pattern recognition · 0.2knowledge-based approach · 0.1fragment superposition · 0.1
YearPublicationVenuePosition
2022 Extended ensemble simulations of a SARS-CoV-2 nsp1-5'-UTR complex
abstract
Nonstructural protein 1 (nsp1) of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) is a 180-residue protein that blocks translation of host mRNAs in SARS-CoV-2-infected cells. Although it is known that SARS-CoV-2's own RNA evades nsp1's host translation shutoff, the molecular mechanism underlying the evasion was poorly understood. We performed an extended ensemble molecular dynamics simulation to investigate the mechanism of the viral RNA evasion. Simulation results suggested that the stem loop structure of the SARS-CoV-2 RNA 5'-untranslated region (SL1) binds to both nsp1's N-terminal globular region and intrinsically disordered region. The consistency of the results was assessed by modeling nsp1-40S ribosome structure based on reported nsp1 experiments, including the X-ray crystallographic structure analysis, the cryo-EM electron density map, and cross-linking experiments. The SL1 binding region predicted from the simulation was open to the solvent, yet the ribosome could interact with SL1. Cluster analysis of the binding mode and detailed analysis of the binding poses suggest residues Arg124, Lys47, Arg43, and Asn126 may be involved in the SL1 recognition mechanism, consistent with the existing mutational analysis.
Shun Sakuraba, Qilin Xie, Kota Kasahara, Junichi Iwakiri, Hidetoshi Kono
PLoS Comput. Biol.3
2016 Architecture of an FPGA accelerator for molecular dynamics simulation using OpenCL
abstract
Molecular dynamics (MD) simulations are very important to study physical properties of the atoms and molecules. However, a huge amount of processing time is required to simulate a few nano-seconds of an actual experiment. Although the hardware acceleration using FPGAs provides promising results, huge design time and hardware design skills are required to implement an accelerator successfully. In this paper, we propose an FPGA accelerator designed using C-based OpenCL. We achieved over 4.6 times of speed-up compared to CPU-based processing, by using only 36% of the Stratix V FPGA resources. Maximum of 18.4 times speed-up is possible by using 80% of the FPGA resources.
Hasitha Muthumala Waidyasooriya, Masanori Hariyama, Kota Kasahara
ICIS3
2016 mDCC_tools: characterizing multi-modal atomic motions in molecular dynamics trajectories
abstract
UNLABELLED: We previously reported the multi-modal Dynamic Cross Correlation (mDCC) method for analyzing molecular dynamics trajectories. This method quantifies the correlation coefficients of atomic motions with complex multi-modal behaviors by using a Bayesian-based pattern recognition technique that can effectively capture transiently formed, unstable interactions. Here, we present an open source toolkit for performing the mDCC analysis, including pattern recognitions, complex network analyses and visualizations. We include a tutorial document that thoroughly explains how to apply this toolkit for an analysis, using the example trajectory of the 100 ns simulation of an engineered endothelin-1 peptide dimer. AVAILABILITY AND IMPLEMENTATION: The source code is available for free at http://www.protein.osaka-u.ac.jp/rcsfp/pi/mdcctools/, implemented in C ++ and Python, and supported on Linux. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Kota Kasahara, Neetha Mohan, Ikuo Fukuda, Haruki Nakamura
Bioinform.1
2014 GIANT: pattern analysis of molecular interactions in 3D structures of protein-small ligand complexes
abstract
BACKGROUND: Interpretation of binding modes of protein-small ligand complexes from 3D structure data is essential for understanding selective ligand recognition by proteins. It is often performed by visual inspection and sometimes largely depends on a priori knowledge about typical interactions such as hydrogen bonds and π-π stacking. Because it can introduce some biases due to scientists' subjective perspectives, more objective viewpoints considering a wide range of interactions are required. DESCRIPTION: In this paper, we present a web server for analyzing protein-small ligand interactions on the basis of patterns of atomic contacts, or "interaction patterns" obtained from the statistical analyses of 3D structures of protein-ligand complexes in our previous study. This server can guide visual inspection by providing information about interaction patterns for each atomic contact in 3D structures. Users can visually investigate what atomic contacts in user-specified 3D structures of protein-small ligand complexes are statistically overrepresented. This server consists of two main components: "Complex Analyzer", and "Pattern Viewer". The former provides a 3D structure viewer with annotations of interacting amino acid residues, ligand atoms, and interacting pairs of these. In the annotations of interacting pairs, assignment to an interaction pattern of each contact and statistical preferences of the patterns are presented. The "Pattern Viewer" provides details of each interaction pattern. Users can see visual representations of probability density functions of interactions, and a list of protein-ligand complexes showing similar interactions. CONCLUSIONS: Users can interactively analyze protein-small ligand binding modes with statistically determined interaction patterns rather than relying on a priori knowledge of the users, by using our new web server named GIANT that is freely available at http://giant.hgc.jp/.
Kota Kasahara, Kengo Kinoshita
BMC Bioinform.1
2010 Ligand-binding site prediction of proteins based on known fragment-fragment interactions
abstract
MOTIVATION: The identification of putative ligand-binding sites on proteins is important for the prediction of protein function. Knowledge-based approaches using structure databases have become interesting, because of the recent increase in structural information. Approaches using binding motif information are particularly effective. However, they can only be applied to well-known ligands that frequently appear in the structure databases. RESULTS: We have developed a new method for predicting the binding sites of chemically diverse ligands, by using information about the interactions between fragments. The selection of the fragment size is important. If the fragments are too small, then the patterns derived from the binding motifs cannot be used, since they are many-body interactions, while using larger fragments limits the application to well-known ligands. In our method, we used the main and side chains for proteins, and three successive atoms for ligands, as fragments. After superposition of the fragments, our method builds the conformations of ligands and predicts the binding sites. As a result, our method could accurately predict the binding sites of chemically diverse ligands, even though the Protein Data Bank currently contains a large number of nucleotides. Moreover, a further evaluation for the unbound forms of proteins revealed that our building up procedure was robust to conformational changes induced by ligand binding. AVAILABILITY: Our method, named 'BUMBLE', is available at http://bumble.hgc.jp/. SUPPLEMENTARY INFORMATION: Supplementary Material is available at Bioinformatics online.
Kota Kasahara, Kengo Kinoshita, Toshihisa Takagi
Bioinform.1