{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00206700","sets":["934:989:10088:10277"]},"path":["10277"],"owner":"44499","recid":"206700","title":["Grammar-compressed Self-index with Lyndon Words"],"pubdate":{"attribute_name":"公開日","attribute_value":"2020-08-28"},"_buckets":{"deposit":"64a52190-9d85-44f7-8cea-787cae29c01f"},"_deposit":{"id":"206700","pid":{"type":"depid","value":"206700","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Grammar-compressed Self-index with Lyndon Words","author_link":["514473","514471","514478","514474","514472","514477","514468","514470","514476","514469","514475","514467"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Grammar-compressed Self-index with Lyndon Words"},{"subitem_title":"Grammar-compressed Self-index with Lyndon Words","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[オリジナル論文] grammar compression, Lyndon words, self-index","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2020-08-28","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Informatics, Kyushu University"},{"subitem_text_value":"Department of Informatics, Kyushu University／Japan Society for Promotion of Science"},{"subitem_text_value":"Department of Informatics, Kyushu University"},{"subitem_text_value":"Department of Informatics, Kyushu University／PRESTO, Japan Science and Technology Agency"},{"subitem_text_value":"M&D Data Science Center, Tokyo Medical and Dental University"},{"subitem_text_value":"Department of Informatics, Kyushu University"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Informatics, Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Department of Informatics, Kyushu University / Japan Society for Promotion of Science","subitem_text_language":"en"},{"subitem_text_value":"Department of Informatics, Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Department of Informatics, Kyushu University / PRESTO, Japan Science and Technology Agency","subitem_text_language":"en"},{"subitem_text_value":"M&D Data Science Center, Tokyo Medical and Dental University","subitem_text_language":"en"},{"subitem_text_value":"Department of Informatics, Kyushu University","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/206700/files/IPSJ-TOM1302009.pdf","label":"IPSJ-TOM1302009.pdf"},"date":[{"dateType":"Available","dateValue":"2022-08-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOM1302009.pdf","filesize":[{"value":"420.0 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":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"f599e7bb-214d-46ee-866e-5334c74ef90a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2020 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazuya, Tsuruta"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Dominik, Köppl"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yuto, Nakashima"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shunsuke, Inenaga"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hideo, Bannai"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Masayuki, Takeda"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Kazuya, Tsuruta","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Dominik, Köppl","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yuto, Nakashima","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shunsuke, Inenaga","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hideo, Bannai","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Masayuki, Takeda","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464803","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7780","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"We introduce a new class of straight-line programs (SLPs), named the Lyndon SLP, inspired by the Lyndon trees (Barcelo, 1990). Based on this SLP, we propose a self-index data structure of O(g) words of spacethat can be built from a string T in O(n lg n) expected time, retrieving the starting positions of all occurrences of a pattern P of length m in O(m + lg m lg n + occ lg g) time, where n is the length of T, g is the size of the Lyndon SLP for T, and occ is the number of occurrences of P in T.","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We introduce a new class of straight-line programs (SLPs), named the Lyndon SLP, inspired by the Lyndon trees (Barcelo, 1990). Based on this SLP, we propose a self-index data structure of O(g) words of spacethat can be built from a string T in O(n lg n) expected time, retrieving the starting positions of all occurrences of a pattern P of length m in O(m + lg m lg n + occ lg g) time, where n is the length of T, g is the size of the Lyndon SLP for T, and occ is the number of occurrences of P in T.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"92","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌数理モデル化と応用（TOM）"}],"bibliographicPageStart":"84","bibliographicIssueDates":{"bibliographicIssueDate":"2020-08-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"13"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T19:21:23.056060+00:00","created":"2025-01-19T01:08:38.356893+00:00","links":{},"id":206700}