bioRxiv Science⌕ Search

Biology subjects

Shimokawa, K.

Publications and source records attributed to Shimokawa, K..

3 recordsLinked to original sources

Artificial intelligence based computational framework for drug-target prioritization and inference of novel repositionable drugs for Alzheimer's disease

BackgroundIdentification of novel therapeutic targets is a key for successful drug development. However, the cost to experimentally identify therapeutic targets is huge and only 400 genes are targets for FDA-approved drugs. Therefore, it is inevitable to develop powerful computational tools to identify potential novel therapeutic targets. Because proteins make their functions together with their interacting partners, a protein-protein interaction network (PIN) in human could be a useful resource to build computational tools to investigate potential targets for therapeutic drugs. Network embedding methods, especially deep-learning based methods would be useful tools to extract an informative low-dimensional latent space that contains enough information required to fully represent original high-dimensional non-linear data of PINs. ResultsIn this study, we developed a deep learning based computational framework that extracts low-dimensional latent space embedded in high-dimensional data of the human PIN and uses the features in the latent space (latent features) to infer potential novel targets for therapeutic drugs. We examined the relationships between the latent features and the representative network metrics and found that the network metrics can explain a large number of the latent features, while several latent features do not correlate with all the network metrics. The results indicate that the features are likely to capture information that the representative network metrics can not capture, while the latent features also can capture information obtained from the network metrics. Our computational framework uses the latent features together with state-of-the-art machine learning techniques to infer potential drug target genes. We applied our computational framework to prioritized novel putative target genes for Alzheimers disease and successfully identified key genes for potential novel therapeutic targets (e.g., DLG4, EGFR, RAC1, SYK, PTK2B, SOCS1). Furthermore, based on these putative targets, we inferred repositionable candidate-compounds for the disease (e.g., Tamoxifen, Bosutinib, and Dasatinib) DiscussionsOur computational framework could be powerful computational tools to efficiently prioritize new therapeutic targets and drug repositioning. It is pertinent to note here that our computational platform is easily applicable to investigate novel potential targets and repositionable compounds for any diseases, especially for rare diseases.

bioinformatics↗

Management of family relationship informationfor a three-generation cohort study

A system for inputting and storing family information, named \"BirThree Enrollment,\" was developed to promote a birth and three-generation cohort study (BirThree Cohort Study), and this system was operated successfully. In the study, it was necessary to satisfy many operational demands. Input information is overwritten and changed continuously. Complex kinship information must be quickly and accurately input and corrected, and information on those families not yet recruited must be retrieved. For these purposes, many devices are needed, from an input interface to the internal data structure. In the field of genetic statistics, a simple standard expressive form is used for describing family structure. This form has sufficient information for genetics; however, we developed this form further for our purposes in conducting the BirThree Cohort Study. To provide information about family roles as required in the BirThree Cohort Study, we expanded the data structure, and constructed the system that is able to be used for the daily operation. In our system, family pedigree information is stored along with initial clinical information, and enabled the input of all self-reported information to the data base. Operators are able to input this family information before the day is out. As a result, when recruitment is completed, family information will be completed concurrently. Therefore, it is possible to immediately know a certain persons family structure. By using our system, data correction was improved dramatically, and the system was operated successfully. This study is the first report of the method for storing three generations of family data.

epidemiology↗

Pathways of DNA unlinking: A story of stepwise simplification

In Escherichia coli DNA replication yields interlinked chromosomes. Controlling topological changes associated with replication and returning the newly replicated chromosomes to an unlinked monomeric state is essential to cell survival. In the absence of the topoisomerase topoIV, the site-specific recombination complex XerCD-dif-FtsK can remove replication links by local reconnection. We previously showed mathematically that there is a unique minimal pathway of unlinking replication links by reconnection while stepwise reducing the topological complexity. However, the possibility that reconnection preserves or increases topological complexity is biologically plausible. In this case, are there other unlinking pathways? Which is the most probable? We consider these questions in an analytical and numerical study of minimal unlinking pathways. We use a Markov Chain Monte Carlo algorithm with Multiple Markov Chain sampling to model local reconnection on 491 different substrate topologies, 166 knots and 325 links, and distinguish between pathways connecting a total of 881 different topologies. We conclude that the minimal pathway of unlinking replication links that was found under more stringent assumptions is the most probable. We also present exact results on unlinking a 6-crossing replication link. These results point to a general process of topology simplification by local reconnection, with applications going beyond DNA.

bioinformatics↗