著者
Masafumi KATAYAMA Takashi HIRAYAMA Tohru KIYONO Manabu ONUMA Tetsuya TANI Satoru TAKEDA Katsuhiko NISHIMORI Tomokazu FUKUDA
出版者
日本繁殖生物学会
雑誌
Journal of Reproduction and Development (ISSN:09168818)
巻号頁・発行日
pp.2016-164, (Released:2017-03-23)
被引用文献数
13

The cellular conditions required to establish induced pluripotent stem cells (iPSCs), such as the number of reprogramming factors and/or promoter selection, differ among species. The establishment of iPSCs derived from cells of previously unstudied species therefore requires the extensive optimization of programming conditions, including promoter selection and the optimal number of reprogramming factors, through a trial-and-error approach. While the four Yamanaka factors Oct3/4, Sox2, Klf4, and c-Myc are sufficient for iPSC establishment in mice, we reported previously that six reprogramming factors were necessary for the creation of iPSCs from primary prairie vole-derived cells. Further to this study, we now show detailed data describing the optimization protocol we developed in order to obtain iPSCs from immortalized prairie vole-derived fibroblasts. Immortalized cells can be very useful tools in the optimization of cellular reprogramming conditions, as cellular senescence is known to dramatically decrease the efficiency of iPSC establishment. The immortalized prairie vole cells used in this optimization were designated K4DT cells as they contained mutant forms of CDK4, cyclin D, and telomerase reverse transcriptase (TERT). We show that iPSCs derived from these immortalized cells exhibit the transcriptional silencing of exogenous reprogramming factors while maintaining pluripotent cell morphology. There were no observed differences between the iPSCs derived from primary and immortalized prairie vole fibroblasts. Our data suggest that cells that are immortalized with mutant CDK4, cyclin D, and TERT provide a useful tool for the determination of the optimal conditions for iPSC establishment.
著者
Takakazu Matsuura Izumi C. Mori Eiko Himi Takashi Hirayama
出版者
日本育種学会
雑誌
Breeding Science (ISSN:13447610)
巻号頁・発行日
vol.69, no.4, pp.601-610, 2019 (Released:2019-12-25)
参考文献数
48
被引用文献数
14

This study examined contents of nine plant hormones in developing seeds of field-grown wheat varieties (Triticum aestivum L.) with different seed dormancy using liquid chromatography—mass spectrometry. The varieties showed marked diversity in germination indices at 15°C and 20°C. Contents of the respective hormones in seeds showed a characteristic pattern during seed maturation from 30-day post anthesis to 60-day post anthesis. Principal component analysis and hierarchical clustering analysis revealed that plant hormone profiles were not correlated with dormancy levels, indicating that hormone contents were not associated with preharvest sprouting (PHS) susceptibility. Indole acetic acid (IAA) contents of mature seeds showed positive correlation with the germination index, but no other hormone. Response of embryo-half seeds to exogenous abscisic acid (ABA) indicates that ABA sensitivity is correlated with whole-seed germinability, which can be explained in part by genotypes of MOTHER OF FT AND TFL (MFT) allele modulating ABA signaling of wheat seeds. These results demonstrate that variation in wheat seed dormancy is attributable to ABA sensitivity of mature seeds, but not to ABA contents in developing seeds.
著者
Takashi HIRAYAMA Hayato SUGAWARA Katsuhisa YAMANAKA Yasuaki NISHITANI
出版者
The Institute of Electronics, Information and Communication Engineers
雑誌
IEICE Transactions on Information and Systems (ISSN:09168532)
巻号頁・発行日
vol.E97.D, no.9, pp.2253-2261, 2014 (Released:2014-09-01)
参考文献数
23
被引用文献数
1

We present a new lower bound on the number of gates in reversible logic circuits that represent a given reversible logic function, in which the circuits are assumed to consist of general Toffoli gates and have no redundant input/output lines. We make a theoretical comparison of lower bounds, and prove that the proposed bound is better than the previous one. Moreover, experimental results for lower bounds on randomly-generated reversible logic functions and reversible benchmarks are given. The results also demonstrate that the proposed lower bound is better than the former one.