Zobrazeno 1 - 10
of 13
pro vyhledávání: '"KAZUYA TSURUTA"'
Autor:
Naoya Takeda, Keisuke Hirata, Kazuya Tsuruta, Garrett D. Santis, Sotiris S. Xantheas, Shun-ichi Ishiuchi, Masaaki Fujii
Publikováno v:
Physical Chemistry Chemical Physics. 24:5786-5793
The infrared (IR) spectra of gas phase protonated nicotine has been measured in the never-before probed N–H “fingerprint region” (3200–3500 cm−1).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae0157f4370b5cbf9af2a98b0bdf4dd4
https://doi.org/10.1039/d1cp05175j
https://doi.org/10.1039/d1cp05175j
Autor:
Shun-ichi Ishiuchi, Masaaki Fujii, Kazuya Tsuruta, Garrett Santis, Sotiris S. Xantheas, Naoya Takeda
Publikováno v:
Proceedings of the 2021 International Symposium on Molecular Spectroscopy.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cefea799fa85e6288d91d8f47880c6e0
https://doi.org/10.15278/isms.2021.tk06
https://doi.org/10.15278/isms.2021.tk06
Autor:
Shun-ichi Ishiuchi, Masaaki Fujii, Hyuk Kang, Jang Han Kwon, Gyeongok Song, Min Ji Lee, Kazuya Tsuruta
Publikováno v:
The journal of physical chemistry letters. 11(17)
Cryogenic ion spectroscopy (CIS) was applied to singly protonated DYYVVR, a tryptic peptide that contains the two active tyrosine residues (Y980 and Y981) of the Janus kinase 3 (JAK3) kinase domain, together with its point mutants (Y980F and Y981F) a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fade0c84026a709ecb40c61cc693a2af
https://pubmed.ncbi.nlm.nih.gov/32787320
https://pubmed.ncbi.nlm.nih.gov/32787320
Autor:
Kazuya Tsuruta, Shunsuke Kanda, Hideo Bannai, Shunsuke Inenaga, Dominik Köppl, Yuto Nakashima, Masayuki Takeda
Given a dynamic set K of k strings of total length n whose characters are drawn from an alphabet of size σ, a keyword dictionary is a data structure built on K that provides lookup, prefix search, and update operations on K . Under the assumption th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0659dbdd4780cfb047eddf84d45c81c7
Publikováno v:
Journal of Wood Science. 59:238-242
In our ongoing efforts to develop new uses for wood-based waste streams, the growth inhibition activities of extracts obtained from Sugi (Cryptomeria japonica) bark were examined against Heterosigma akashiwo, otherwise known as red tide plankton. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f8a33b1aeb01ab0bb2ccac0194e795a
https://doi.org/10.1007/s10086-013-1328-4
https://doi.org/10.1007/s10086-013-1328-4
Autor:
Kazuya Tsuruta, Norihisa Kusumoto, Yayoi Yoshida, Koetsu Takahashi, Tatsuya Ashitani, Nobuhiro Sekine
Publikováno v:
Journal of Wood Science. 57:520-525
The growth inhibition activities of essential oils obtained from Cryptomeria japonica, Chamaecyparis obtusa, and Pinus thunbergii were examined against the bacillariophyceae Skeletonema costatum, also known as red tide plankton. The essential oils we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0db8996d1594717e722a5978fff0729c
https://doi.org/10.1007/s10086-011-1209-7
https://doi.org/10.1007/s10086-011-1209-7
Publikováno v:
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9aa69ce21bc64bae98a3829e0bbf3ce
https://doi.org/10.1137/1.9781611973730.38
https://doi.org/10.1137/1.9781611973730.38
Publikováno v:
SOFSEM 2014: Theory and Practice of Computer Science ISBN: 9783319042978
SOFSEM
SOFSEM
We present an optimal, linear time algorithm for the shortest unique substring problem, thus improving the algorithm by Pei et al. (ICDE 2013). Our implementation is simple and based on suffix arrays. Computational experiments show that our algorithm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::597e059f810d41d3394c93338e4f7232
https://doi.org/10.1007/978-3-319-04298-5_44
https://doi.org/10.1007/978-3-319-04298-5_44
We give a new characterization of maximal repetitions (or runs) in strings based on Lyndon words. The characterization leads to a proof of what was known as the "runs" conjecture (Kolpakov \& Kucherov (FOCS '99)), which states that the maximum number
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2bf1d01070967ae4ec3eedfd100dc705
Autor:
HIDEO BANNAI, I., TOMOHIRO, SHUNSUKE INENAGA, YUTO NAKASHIMA, MASAYUKI TAKEDA, KAZUYA TSURUTA
Publikováno v:
SIAM Journal on Computing; 2017, Vol. 46 Issue 5, p1501-1514, 14p