{"created":"2025-01-18T23:31:05.303724+00:00","updated":"2025-01-21T22:09:06.692892+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00072914","sets":["1164:2592:6240:6332"]},"path":["6332"],"owner":"10","recid":"72914","title":["圧縮テキスト上での<i>q</i>-gram非重複頻度の効率的な計算とその応用"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-02-28"},"_buckets":{"deposit":"bb97de70-7043-4ecc-bb14-1cabbd6dbb22"},"_deposit":{"id":"72914","pid":{"type":"depid","value":"72914","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"圧縮テキスト上での<i>q</i>-gram非重複頻度の効率的な計算とその応用","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"圧縮テキスト上での<i>q</i>-gram非重複頻度の効率的な計算とその応用"}]},"item_type_id":"4","publish_date":"2011-02-28","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Informatics"},{"subitem_text_value":"Department of Electrical Engineering and Computer Science"},{"subitem_text_value":"Department of Informatics"},{"subitem_text_value":"Graduate School of Information Science and Electrical Engineering Kyushu University"},{"subitem_text_value":"Department of Informatics"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Informatics","subitem_text_language":"en"},{"subitem_text_value":"Department of Electrical Engineering and Computer Science","subitem_text_language":"en"},{"subitem_text_value":"Department of Informatics","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Electrical Engineering Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Department of Informatics","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/72914/files/IPSJ-AL11134011.pdf"},"date":[{"dateType":"Available","dateValue":"2013-02-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL11134011.pdf","filesize":[{"value":"166.6 kB"}],"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":"e1423970-4c82-4e60-b662-670579ce9872","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Keisuke, Goto"},{"creatorName":"Nami, Fukui"},{"creatorName":"Hideo, Bannai"},{"creatorName":"Shunsuke, Ikenaga"},{"creatorName":"Masayuki, Takeda"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Keisuke, Goto","creatorNameLang":"en"},{"creatorName":"Nami, Fukui","creatorNameLang":"en"},{"creatorName":"Hideo, Bannai","creatorNameLang":"en"},{"creatorName":"Shunsuke, Ikenaga","creatorNameLang":"en"},{"creatorName":"Masayuki, Takeda","creatorNameLang":"en"}],"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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"In many problems concerning text data, length-q substrings, or q-grams, can represent important characteristics of the data. Determining the frequencies of all q-grams contained in the data is an important problem with many applications. In this paper, we consider the problem of calculating the non-overlapping frequencies of all q-grams in a text represented as a straight line program (SLP). We show that the problem can be solved in O(q2n) time, where n is the size of the SLP. We also show an interesting application of the algorithm, which converts an arbitrary SLP to an SLP that is constructed based on frequency information.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In many problems concerning text data, length-q substrings, or q-grams, can represent important characteristics of the data. Determining the frequencies of all q-grams contained in the data is an important problem with many applications. In this paper, we consider the problem of calculating the non-overlapping frequencies of all q-grams in a text represented as a straight line program (SLP). We show that the problem can be solved in O(q2n) time, where n is the size of the SLP. We also show an interesting application of the algorithm, which converts an arbitrary SLP to an SLP that is constructed based on frequency information.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2011-02-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"11","bibliographicVolumeNumber":"2011-AL-134"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"id":72914,"links":{}}