Kazuya Haraguchi

Prof. Kazuya Haraguchi

Kyoto University
orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 July 2022 in Cell Reports
Verified
Journal Article
Open access
KTKotaro Torii
Kotaro Torii
KIKeisuke Inoue
Keisuke Inoue
KBKeita Bekki
Keita Bekki
KHKazuya Haraguchi
Kazuya Haraguchi
MKMinoru Kubo
Minoru Kubo
MEMotomu Endo
Motomu Endo
Circadian rhythms and progression of cell differentiation are closely coupled in multicellular organisms. However, whether establishment of circadian rhythms regulates cell differentiation or vice versa has not been elucidated due to technical limitations. Here, we exploit high cell fate plasticity of plant cells to perform single-cell RNA sequencing during the entire process of cell differentiation. By analyzing reconstructed actual time series of the differentiation processes at single-cell resolution using a method we developed (PeakMatch), we find that the expression profile of clock genes is changed prior to cell differentiation, including induction of the clock gene LUX ARRYTHMO (LUX). ChIP sequencing analysis reveals that LUX induction in early differentiating cells directly targets genes involved in cell-cycle progression to regulate cell differentiation. Taken together, these results not only reveal a guiding role of the plant circadian clock in cell differentiation but also provide an approach for time-series analysis at single-cell resolution.

Verified
Journal Article
Open access
PDF file
YSYu Shi
Yu Shi
JZJianshen Zhu
Jianshen Zhu
Naveed AzamNaveed Azam
Naveed Azam
KHKazuya Haraguchi
Kazuya Haraguchi
Liang ZhaoLiang Zhao
Liang Zhao
Tatsuya AkutsuTatsuya Akutsu
Tatsuya Akutsu
A novel framework for inverse quantitative structure–activity relationships (inverse QSAR) has recently been proposed and developed using both artificial neural networks and mixed integer linear programming. However, classes of chemical graphs treated by the framework are limited. In order to deal with an arbitrary graph in the framework, we introduce a new model, called a two-layered model, and develop a corresponding method. In this model, each chemical graph is regarded as two parts: the exterior and the interior. The exterior consists of maximal acyclic induced subgraphs with bounded height, the interior is the connected subgraph obtained by ignoring the exterior, and the feature vector consists of the frequency of adjacent atom pairs in the interior and the frequency of chemical acyclic graphs in the exterior. Our method is more flexible than the existing method in the sense that any type of graphs can be inferred. We compared the proposed method with an existing method using several data sets obtained from PubChem database. The new method could infer more general chemical graphs with up to 50 non-hydrogen atoms. The proposed inverse QSAR method can be applied to the inference of more general chemical graphs than before.

14 September 2021 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
JZJianshen Zhu
Jianshen Zhu
Naveed AzamNaveed Azam
Naveed Azam
FZFan Zhang
Fan Zhang
ASAleksandar Shurbevski
Aleksandar Shurbevski
KHKazuya Haraguchi
Kazuya Haraguchi
Tatsuya AkutsuTatsuya Akutsu
Tatsuya Akutsu
Drug discovery is one of the major goals of computational biology and bioinformatics. A novel framework has recently been proposed for the design of chemical graphs using both artificial neural networks (ANNs) and mixed integer linear programming (MILP). This method consists of a prediction phase and an inverse prediction phase. In the first phase, an ANN is trained using data on existing chemical compounds. In the second phase, given a target chemical property, a feature vector is inferred by solving an MILP formulated from the trained ANN and then a set of chemical structures is enumerated by a graph enumeration algorithm. Although exact solutions are guaranteed by this framework, the types of chemical graphs have been restricted to such classes as trees, monocyclic graphs and graphs with a specified polymer topology with cycle index up to 2. To overcome the limitation on the topological structure, we propose a new flexible modeling method to the framework so that we can specify a topological substructure of graphs and a partial assignment of chemical elements and bond-multiplicity to a target graph. The results of computational experiments suggest that the proposed system can infer chemical graphs with around up to 50 non-hydrogen atoms.

22 August 2024 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
RIRyota Ido
Ryota Ido
SCShengjuan Cao
Shengjuan Cao
JZJianshen Zhu
Jianshen Zhu
Naveed AzamNaveed Azam
Naveed Azam
KHKazuya Haraguchi
Kazuya Haraguchi
Tatsuya AkutsuTatsuya Akutsu
Tatsuya Akutsu
A novel framework has recently been proposed for designing the molecular structure of chemical compounds with a desired chemical property using both artificial neural networks and mixed integer linear programming. In this paper, we design a new method for inferring a polymer based on the framework. For this, we introduce a new way of representing a polymer as a form of monomer and define new descriptors that feature the structure of polymers. We also use linear regression as a building block of constructing a prediction function in the framework. The results of our computational experiments reveal a set of chemical properties on polymers to which a prediction function constructed with linear regression performs well. We also observe that the proposed method can infer polymers with up to 50 nonhydrogen atoms in a monomer form

24 January 2022 in Algorithmica
Verified
Journal Article
Closed access
PDF file
KHKazuya Haraguchi
Kazuya Haraguchi
HNHiroshi Nagamochi
Hiroshi Nagamochi

23 September 2016 in Journal of Heuristics
Verified
Journal Article
Open access
PDF file
KHKazuya Haraguchi
Kazuya Haraguchi
A partial Latin square (PLS) is a partial assignment of n symbols to an \(n\times n\) grid such that, in each row and in each column, each symbol appears at most once. The PLS extension problem is an NP-hard problem that asks for a largest extension of a given PLS. We consider the local search such that the neighborhood is defined by (p, q)-swap , i.e., the operation of dropping exactly p symbols and then assigning symbols to at most q empty cells. As a fundamental result, we provide an efficient \((p,\infty )\)-neighborhood search algorithm that finds an improved solution or concludes that no such solution exists for \(p\in \{1,2,3\}\). The running time of the algorithm is \(O(n^{p+1})\). We then propose a novel swap operation, Trellis-swap, which is a generalization of (p, q)-swap with \(p\le 2\). The proposed Trellis-neighborhood search algorithm runs in \(O(n^{3.5})\) time. The iterated local search (ILS) algorithm with Trellis-neighborhood is more likely to deliver a high-quality solution than not only ILSs with \((p,\infty )\)-neighborhood but also state-of-the-art optimization solvers such as IBM ILOG CPLEX and LocalSolver.