{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00228921","sets":["1164:2592:11085:11360"]},"path":["11360"],"owner":"44499","recid":"228921","title":["LZDとLZMW分解の部分文字列圧縮について"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-11-09"},"_buckets":{"deposit":"46201196-1e5b-4aee-a5dc-dbbbdef7fba6"},"_deposit":{"id":"228921","pid":{"type":"depid","value":"228921","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"LZDとLZMW分解の部分文字列圧縮について","author_link":["614760"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"LZDとLZMW分解の部分文字列圧縮について"}]},"item_type_id":"4","publish_date":"2023-11-09","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"山梨大学コンピュータ理工学"}]},"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/228921/files/IPSJ-AL23195001.pdf","label":"IPSJ-AL23195001.pdf"},"date":[{"dateType":"Available","dateValue":"2025-11-09"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL23195001.pdf","filesize":[{"value":"833.1 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":"60eceb11-6b5e-4139-beac-3f2d4cf99572","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"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":"LZD と LZMW は LZ78 から生じる文字列分解である．項の個数で考えた場合，LZ78 は Ω(√n) の下界を持つが，LZD と LZMW の下界は Ω(lg n) である．ただし n は文字列の長さである．整数アルファベットとして，LZ78 を決定的線形時間で計算できるが，LZD または LZMW を同様に計算できるかまだ明らかではない．本研究は，この問題を明らかにするとともに，LZD と LZMW の部分文字列圧縮問題についてのアルゴリズムを提案する．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"3","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-11-09","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2023-AL-195"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":228921,"updated":"2025-01-19T11:40:17.255544+00:00","links":{},"created":"2025-01-19T01:28:03.182702+00:00"}