{"created":"2025-01-19T01:11:32.503295+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00210287","sets":["1164:2592:10486:10558"]},"path":["10558"],"owner":"44499","recid":"210287","title":["接尾辞木にもとづく部分文字列の数え上げ法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-03-10"},"_buckets":{"deposit":"22ad410d-a594-4c1a-9612-7f5c3f463df3"},"_deposit":{"id":"210287","pid":{"type":"depid","value":"210287","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"接尾辞木にもとづく部分文字列の数え上げ法","author_link":["531903","531902"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"接尾辞木にもとづく部分文字列の数え上げ法"},{"subitem_title":"A Suffix Tree-Based Algorithm for Counting Substrings","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2021-03-10","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"神奈川大学理学部情報科学科"},{"subitem_text_value":"神奈川大学理学部情報科学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Information Sciences, Faculty of Science, Kanagawa University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information Sciences, Faculty of Science, Kanagawa University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/210287/files/IPSJ-AL21182006.pdf","label":"IPSJ-AL21182006.pdf"},"date":[{"dateType":"Available","dateValue":"2023-03-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL21182006.pdf","filesize":[{"value":"1.0 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"f4fa698d-30eb-4dad-98f6-cd8605106ac2","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"ローレンシウス, レオナード"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"田中, 賢"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"文字列を取り扱う様々な問題を効率よく解くためのアルゴリズムとデータ構造の研究は古くから研究されており，それらは計算機科学の分野のみならず，計算分子生物学などの分野で応用されている．本稿では接尾辞木というデータ構造を利用し，ある文字列に対し，指定された接頭辞と接尾辞を持つような相異なる部分文字列の個数を求めるという問題を線形時間と線形メモリで解くアルゴリズムを提案する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Algorithms to solve various problems regarding string processing has long been a topic of research interest. Their applications extend beyond the field of computer science, into other fields such as computational molecular biology. In this paper, by making use of the suffix tree, we propose a linear-time, linear-memory algorithm for the following problem: Given three strings T, P and S, count all the unique substrings of T that has P as its prefix and S as its suffix.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2021-03-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"6","bibliographicVolumeNumber":"2021-AL-182"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":210287,"updated":"2025-01-19T18:12:10.375868+00:00","links":{}}