{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:13:29Z","timestamp":1742998409536,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030276836"},{"type":"electronic","value":"9783030276843"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-27684-3_1","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:03:04Z","timestamp":1566169384000},"page":"3-7","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Approach for LPF Table Computation"],"prefix":"10.1007","author":[{"given":"Supaporn","family":"Chairungsee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thana","family":"Charuphanthuset","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"key":"1_CR1","volume-title":"Text Compression","author":"TC Bell","year":"1990","unstructured":"Bell, T.C., Clearly, J.G., Witten, I.H.: Text Compression. Prentice Hall Inc., Upper Saddle River (1990)"},{"key":"1_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2007.10.006","volume":"106","author":"C Crochemore","year":"2008","unstructured":"Crochemore, C., Ilie, L.: Computing longest previous factor in linear time and applications. Inf. Process. Lett. 106(2), 75\u201380 (2008)","journal-title":"Inf. Process. Lett."},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-10217-2_18","volume-title":"Combinatorial Algorithms","author":"M Crochemore","year":"2009","unstructured":"Crochemore, M., Ilie, L., Iliopoulos, C.S., Kubica, M., Rytter, W., Wale\u0144, T.: LPF computation revisited. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol. 5874, pp. 158\u2013169. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10217-2_18"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-11266-9_25","volume-title":"SOFSEM 2010: Theory and Practice of Computer Science","author":"M Crochemore","year":"2010","unstructured":"Crochemore, M., Iliopoulos, C.S., Kubica, M., Rytter, W., Wale\u0144, T.: Efficient algorithms for two extensions of LPF table: the power of suffix arrays. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorn\u00fd, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol. 5901, pp. 296\u2013307. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11266-9_25"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejc.2012.07.011","volume":"34","author":"M Crochemore","year":"2013","unstructured":"Crochemore, M., Ilie, L., Iliopoulos, C.S., Kubica, M., Rytter, W., Wale, T.: Computing the longest previous factor. Eur. J. Comb. 34(1), 15\u201326 (2013)","journal-title":"Eur. J. Comb."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.ipl.2010.12.005","volume":"111","author":"C Crochemore","year":"2011","unstructured":"Crochemore, C., Tischler, G.: Computing longest previous nonoverlapping factors. Inf. Process. Lett. 111, 291\u2013295 (2011)","journal-title":"Inf. Process. Lett."},{"key":"1_CR8","volume-title":"Data Structures and Algorithms in C++","author":"A Drozdek","year":"2013","unstructured":"Drozdek, A.: Data Structures and Algorithms in C++. Cengage Learning, Boston (2013)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-38905-4_11","volume-title":"Combinatorial Pattern Matching","author":"T Gagie","year":"2013","unstructured":"Gagie, T., Hon, W.-K., Ku, T.-H.: New algorithms for position heaps. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol. 7922, pp. 95\u2013106. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38905-4_11"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Kongsen, J., Chairungsee, S.: Using suffix tray and longest previous factor for pattern searching. In: International Conference on Information Technology, Singapore, Singapore (2017)","DOI":"10.1145\/3176653.3176662"},{"key":"1_CR11","volume-title":"Fundamental Data Compression","author":"IM Pu","year":"2006","unstructured":"Pu, I.M.: Fundamental Data Compression. A Butterworth-Heinemann, Oxford (2006)"},{"key":"1_CR12","volume-title":"Data Compression: Methods and Theory","author":"JA Storer","year":"1988","unstructured":"Storer, J.A.: Data Compression: Methods and Theory. Computer Science Press, New York (1988)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory. 23, 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theory."}],"container-title":["Communications in Computer and Information Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27684-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:20:10Z","timestamp":1710354010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27684-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030276836","9783030276843"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27684-3_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Linz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mixed (Single-blind and Double-blind)","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ConfDriver","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"157","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":"32","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":"34","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":"20% - 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":"4-6","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":"3-4","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)"}}]}}