Kengo Sato

Prof. Dr. Kengo Sato

Tokyo Denki University, Tokyo, Japan
orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
5 January 2011 in Genome Research
Verified
Journal Article
Open access
PDF file
SKSzymon M. Kiełbasa
Szymon M. Kiełbasa
RWRaymond Wan
Raymond Wan
KSKengo Sato
Kengo Sato
PHPaul Horton
Paul Horton
MFMartin C. Frith
Martin C. Frith
The main way of analyzing biological sequences is by comparing and aligning them to each other. It remains difficult, however, to compare modern multi-billionbase DNA data sets. The difficulty is caused by the nonuniform (oligo)nucleotide composition of these sequences, rather than their size per se. To solve this problem, we modified the standard seed-and-extend approach (e.g., BLAST) to use adaptive seeds. Adaptive seeds are matches that are chosen based on their rareness, instead of using fixed-length matches. This method guarantees that the number of matches, and thus the running time, increases linearly, instead of quadratically, with sequence length. LAST, our open source implementation of adaptive seeds, enables fast and sensitive comparison of large sequences with arbitrarily nonuniform composition.

11 February 2021 in Nature Communications
Verified
Journal Article
Open access
PDF file
KSKengo Sato
Kengo Sato
MAManato Akiyama
Manato Akiyama
YSYasubumi Sakakibara
Yasubumi Sakakibara
Accurate predictions of RNA secondary structures can help uncover the roles of functional non-coding RNAs. Although machine learning-based models have achieved high performance in terms of prediction accuracy, overfitting is a common risk for such highly parameterized models. Here we show that overfitting can be minimized when RNA folding scores learnt using a deep neural network are integrated together with Turner’s nearest-neighbor free energy parameters. Training the model with thermodynamic regularization ensures that folding scores and the calculated free energy are as close as possible. In computational experiments designed for newly discovered non-coding RNAs, our algorithm (MXfold2) achieves the most robust and accurate predictions of RNA secondary structures without sacrificing computational efficiency compared to several other algorithms. The results suggest that integrating thermodynamic information could help improve the robustness of deep learning-based predictions of RNA secondary structure.

14 June 2011 in Bioinformatics
Verified
Journal Article
Open access
PDF file
KSKengo Sato
Kengo Sato
YKYuki Kato
Yuki Kato
MHMichiaki Hamada
Michiaki Hamada
Tatsuya AkutsuTatsuya Akutsu
Tatsuya Akutsu
KAKiyoshi Asai
Kiyoshi Asai
Motivation: Pseudoknots found in secondary structures of a number of functional RNAs play various roles in biological processes. Recent methods for predicting RNA secondary structures cover certain classes of pseudoknotted structures, but only a few of them achieve satisfying predictions in terms of both speed and accuracy. Results: We propose IPknot, a novel computational method for predicting RNA secondary structures with pseudoknots based on maximizing expected accuracy of a predicted structure. IPknot decomposes a pseudoknotted structure into a set of pseudoknot-free substructures and approximates a base-pairing probability distribution that considers pseudoknots, leading to the capability of modeling a wide class of pseudoknots and running quite fast. In addition, we propose a heuristic algorithm for refining base-paring probabilities to improve the prediction accuracy of IPknot. The problem of maximizing expected accuracy is solved by using integer programming with threshold cut. We also extend IPknot so that it can predict the consensus secondary structure with pseudoknots when a multiple sequence alignment is given. IPknot is validated through extensive experiments on various datasets, showing that IPknot achieves better prediction accuracy and faster running time as compared with several competitive prediction methods. Availability: The program of IPknot is available at http://www.ncrna.org/software/ipknot/. IPknot is also available as a web server at http://rna.naist.jp/ipknot/. Contact:satoken@k.u-tokyo.ac.jp; ykato@is.naist.jp Supplementary information: Supplementary data are available at Bioinformatics online.

12 May 2009 in Nucleic Acids Research
Verified
Journal Article
Open access
PDF file
KSKengo Sato
Kengo Sato
MHMichiaki Hamada
Michiaki Hamada
KAKiyoshi Asai
Kiyoshi Asai
TMToutai Mitsuyama
Toutai Mitsuyama
The CentroidFold web server (http://www.ncrna.org/centroidfold/) is a web application for RNA secondary structure prediction powered by one of the most accurate prediction engine. The server accepts two kinds of sequence data: a single RNA sequence and a multiple alignment of RNA sequences. It responses with a prediction result shown as a popular base-pair notation and a graph representation. PDF version of the graph representation is also available. For a multiple alignment sequence, the server predicts a common secondary structure. Usage of the server is quite simple. You can paste a single RNA sequence (FASTA or plain sequence text) or a multiple alignment (CLUSTAL-W format) into the textarea then click on the ‘execute CentroidFold’ button. The server quickly responses with a prediction result. The major advantage of this server is that it employs our original CentroidFold software as its prediction engine which scores the best accuracy in our benchmark results. Our web server is freely available with no login requirement.

18 December 2008 in Bioinformatics
Verified
Journal Article
Closed access
MHMichiaki Hamada
Michiaki Hamada
HKHisanori Kiryu
Hisanori Kiryu
KSKengo Sato
Kengo Sato
TMToutai Mitsuyama
Toutai Mitsuyama
KAKiyoshi Asai
Kiyoshi Asai
Motivation: Recent studies have shown that the methods for predicting secondary structures of RNAs on the basis of posterior decoding of the base-pairing probabilities has an advantage with respect to prediction accuracy over the conventionally utilized minimum free energy methods. However, there is room for improvement in the objective functions presented in previous studies, which are maximized in the posterior decoding with respect to the accuracy measures for secondary structures. Results: We propose novel estimators which improve the accuracy of secondary structure prediction of RNAs. The proposed estimators maximize an objective function which is the weighted sum of the expected number of the true positives and that of the true negatives of the base pairs. The proposed estimators are also improved versions of the ones used in previous works, namely CONTRAfold for secondary structure prediction from a single RNA sequence and McCaskill-MEA for common secondary structure prediction from multiple alignments of RNA sequences. We clarify the relations between the proposed estimators and the estimators presented in previous works, and theoretically show that the previous estimators include additional unnecessary terms in the evaluation measures with respect to the accuracy. Furthermore, computational experiments confirm the theoretical analysis by indicating improvement in the empirical accuracy. The proposed estimators represent extensions of the centroid estimators proposed in Ding et al. and Carvalho and Lawrence, and are applicable to a wide variety of problems in bioinformatics. Availability: Supporting information and the CentroidFold software are available online at: http://www.ncrna.org/software/centroidfold/. Contact: hamada-michiaki@aist.go.jp Supplementary information: Supplementary data are available at Bioinformatics online.

1 July 2016 in Cell Stem Cell
Verified
Journal Article
Closed access
KSKenya Sato
Kenya Sato
RORyo Oiwa
Ryo Oiwa
WKWakako Kumita
Wakako Kumita
RHRachel Henry
Rachel Henry
Tetsushi SakumaTetsushi Sakuma
Tetsushi Sakuma
ESErika Sasaki
Erika Sasaki