{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:49:34Z","timestamp":1743137374474,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_27","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"369-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Practical Space-Efficient Index for Structural Pattern Matching"],"prefix":"10.1007","author":[{"given":"Sung-Hwan","family":"Kim","sequence":"first","affiliation":[]},{"given":"Hwan-Gue","family":"Cho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2015.05.016","volume":"592","author":"R Beal","year":"2015","unstructured":"Beal, R., Adjeroh, D.: Efficient pattern matching for RNA secondary structures. Theoret. Comput. Sci. 592, 59\u201371 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.05.016","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR2","unstructured":"Clark, D.: Compact pat trees. Ph.D. thesis, University of Waterloo (1996)"},{"key":"27_CR3","doi-asserted-by":"publisher","unstructured":"Ferragina, P., Manzini, G., M\u00e4kinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms 3(2), 20\u2013es (2007). https:\/\/doi.org\/10.1145\/1240233.1240243","DOI":"10.1145\/1240233.1240243"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-12200-2_16","volume-title":"LATIN 2010: Theoretical Informatics","author":"J Fischer","year":"2010","unstructured":"Fischer, J.: Optimal succinctness for range minimum queries. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 158\u2013169. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12200-2_16"},{"key":"27_CR5","doi-asserted-by":"publisher","unstructured":"Ganguly, A., Shah, R., Thankachan, S.V.: Structural pattern matching - succinctly. In: Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC), pp. 35:1\u201335:13 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2017.35","DOI":"10.4230\/LIPIcs.ISAAC.2017.35"},{"key":"27_CR6","doi-asserted-by":"publisher","unstructured":"Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: plug and play with succinct data structures. In: Proceedings of the 13th International Symposium on Experimental Algorithms (SEA), pp. 326\u2013337 (2014). https:\/\/doi.org\/10.1007\/978-3-319-07959-2_28","DOI":"10.1007\/978-3-319-07959-2_28"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-75520-3_34","volume-title":"Algorithms \u2013 ESA 2007","author":"A Golynski","year":"2007","unstructured":"Golynski, A., Grossi, R., Gupta, A., Raman, R., Rao, S.S.: On the size of succinct indices. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 371\u2013382. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_34"},{"key":"27_CR8","doi-asserted-by":"publisher","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 841\u2013850 (2003). https:\/\/doi.org\/10.5555\/644108.644250","DOI":"10.5555\/644108.644250"},{"key":"27_CR9","doi-asserted-by":"publisher","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS), pp. 549\u2013554 (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63533","DOI":"10.1109\/SFCS.1989.63533"},{"key":"27_CR10","doi-asserted-by":"publisher","unstructured":"Kim, S.H., Cho, H.G.: Indexing isodirectional pointer sequences. In: Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC), pp. 35:1\u201335:15 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2020.35","DOI":"10.4230\/LIPIcs.ISAAC.2020.35"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.jda.2013.07.004","volume":"25","author":"G Navarro","year":"2014","unstructured":"Navarro, G.: Wavelet trees for all. J. Discrete Algorithms 25, 2\u201320 (2014). https:\/\/doi.org\/10.1016\/j.jda.2013.07.004","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2601073","volume":"10","author":"G Navarro","year":"2014","unstructured":"Navarro, G., Sadakane, K.: Fully functional static and dynamic succinct trees. ACM Trans. Algorithms 10(3), 1\u201339 (2014). https:\/\/doi.org\/10.1145\/2601073","journal-title":"ACM Trans. Algorithms"},{"key":"27_CR13","doi-asserted-by":"publisher","unstructured":"Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 134\u2013149 (2010). https:\/\/doi.org\/10.5555\/1873601.1873614","DOI":"10.5555\/1873601.1873614"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/3-540-44985-X_34","volume-title":"Algorithm Theory - SWAT 2000","author":"T Shibuya","year":"2000","unstructured":"Shibuya, T.: Generalization of a suffix tree for RNA structural pattern matching. In: SWAT 2000. LNCS, vol. 1851, pp. 393\u2013406. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44985-X_34"},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-003-1067-9","volume":"39","author":"T Shibuya","year":"2004","unstructured":"Shibuya, T.: Generalization of a suffix tree for RNA structural pattern matching. Algorithmica 39, 1\u201319 (2004). https:\/\/doi.org\/10.1007\/s00453-003-1067-9","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:07:43Z","timestamp":1653779263000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}