- 著者
- Aoki Wataru Watanabe Maiko Watanabe Masaki Kobayashi Naoki Terajima Jun Sugita-Konishi Yoshiko Kondo Kazunari Hara-Kudo Yukiko
- 出版者
- 日本遺伝学会
- 雑誌
- Genes & Genetic Systems (ISSN:13417568)
- 巻号頁・発行日
- vol.95, no.3, pp.133-139, 2020
- 被引用文献数
- 3
<p><i>Entoloma sarcopum</i> is widely known as an edible mushroom but appears morphologically similar to the poisonous mushrooms <i>E. rhodopolium</i> sensu lato (s. l.) and <i>E. sinuatum</i> s. l. Many cases of food poisoning caused by eating these poisonous mushrooms occur each year in Japan. Therefore, they were recently reclassified based on both morphological and molecular characteristics as sensu stricto species. In this study, we analyzed the nucleotide sequences of the rRNA gene (rDNA) cluster region, mainly including the internal transcribed spacer regions and mitochondrial cytochrome oxidase 1 (CO1) gene, in <i>E. sarcopum</i> and its related species, to evaluate performances of these genes as genetic markers for identification and molecular phylogenetic analysis. We found that the CO1 gene contained lineage-specific insertion/deletion sequences, and our CO1 tree yielded phylogenetic information that was not supported by analysis of the rDNA cluster region sequence. Our results suggested that the CO1 gene is a better genetic marker than the rDNA cluster region, which is the most widely used marker for fungal identification and classification, for discrimination between edible and poisonous mushrooms among Japanese <i>E. sarcopum</i> and related species. Our study thus reports a new genetic marker that is useful for detection of Japanese poisonous mushrooms, <i>Entoloma</i>.</p>
- 著者
- Unno Hiroshi Terauchi Tachio Kobayashi Naoki
- 出版者
- ACM
- 雑誌
- Proceeding POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- 巻号頁・発行日
- pp.75-86, 2013-01
- 被引用文献数
- 30
We present an automated approach to relatively completely verifying safety (i.e., reachability) property of higher-order functional programs. Our contribution is two-fold. First, we extend the refinement type system framework employed in the recent work on (incomplete) automated higher-order verification by drawing on the classical work on relatively complete "Hoare logic like" program logic for higher-order procedural languages. Then, by adopting the recently proposed techniques for solving constraints over quantified first-order logic formulas, we develop an automated type inference method for the type system, thereby realizing an automated relatively complete verification of higher-order programs.