{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:19:09Z","timestamp":1763810349022,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030592110"},{"type":"electronic","value":"9783030592127"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-59212-7_20","type":"book-chapter","created":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T10:05:34Z","timestamp":1600250734000},"page":"277-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Construction of Hierarchical Overlap Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3255-9752","authenticated-orcid":false,"given":"Sung Gwan","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1761-4354","authenticated-orcid":false,"given":"Bastien","family":"Cazaux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5225-0907","authenticated-orcid":false,"given":"Kunsoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3791-3973","authenticated-orcid":false,"given":"Eric","family":"Rivals","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,17]]},"reference":[{"issue":"6","key":"20_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"AV Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333\u2013340 (1975). \nhttps:\/\/doi.org\/10.1145\/360825.360855","journal-title":"Commun. ACM"},{"key":"20_CR2","doi-asserted-by":"publisher","unstructured":"Arge, L., Brodal, G.S., Georgiadis, L.: Improved dynamic planar point location. In: 47th Proceedings of FOCS, pp. 305\u2013314 (2006). \nhttps:\/\/doi.org\/10.1109\/FOCS.2006.40","DOI":"10.1109\/FOCS.2006.40"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Armen, C., Stein, C.: A $$2\\frac{2}{3}$$-approximation algorithm for the shortest superstring problem. In: CPM, pp. 87\u2013101 (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-61258-0_8","DOI":"10.1007\/3-540-61258-0_8"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Bassino, F., Clement, J., Nicodeme, P.: Counting occurrences for a finite set of words: combinatorial methods. ACM Trans. Algorithms 8(3), 31:1\u201331:28 (2012). \nhttps:\/\/doi.org\/10.1145\/2229163.2229175","DOI":"10.1145\/2229163.2229175"},{"key":"20_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg","year":"2008","unstructured":"Berg, M., Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Berlin (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-77974-2","edition":"3"},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1145\/179812.179818","volume":"41","author":"A Blum","year":"1994","unstructured":"Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear approximation of shortest superstrings. J. ACM 41(4), 630\u2013647 (1994). \nhttps:\/\/doi.org\/10.1145\/179812.179818","journal-title":"J. ACM"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Cazaux, B., Juhel, S., Rivals, E.: Practical lower and upper bounds for the shortest linear superstring. In: SEA, pp. 18:1\u201318:14 (2018). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.SEA.2018.18","DOI":"10.4230\/LIPIcs.SEA.2018.18"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.jda.2016.05.001","volume":"37","author":"B Cazaux","year":"2016","unstructured":"Cazaux, B., Rivals, E.: A linear time algorithm for shortest cyclic cover of strings. J. Discrete Algorithms 37, 56\u201367 (2016). \nhttps:\/\/doi.org\/10.1016\/j.jda.2016.05.001","journal-title":"J. Discrete Algorithms"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"105862","DOI":"10.1016\/j.ipl.2019.105862","volume":"155","author":"B Cazaux","year":"2020","unstructured":"Cazaux, B., Rivals, E.: Hierarchical overlap graph. Inf. Process. Lett. 155, 105862 (2020). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2019.105862","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10878-013-9663-3","volume":"28","author":"TP Gevezes","year":"2013","unstructured":"Gevezes, T.P., Pitsoulis, L.S.: Recognition of overlap graphs. J. Comb. Optim. 28(1), 25\u201337 (2013). \nhttps:\/\/doi.org\/10.1007\/s10878-013-9663-3","journal-title":"J. Comb. Optim."},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Giora, Y., Kaplan, H.: Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. ACM Trans. Algorithms 5(3) (2009). \nhttps:\/\/doi.org\/10.1145\/1541885.1541889","DOI":"10.1145\/1541885.1541889"},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1186\/1471-2105-13-82","volume":"13","author":"G Gonnella","year":"2012","unstructured":"Gonnella, G., Kurtz, S.: Readjoiner: a fast and memory efficient string graph-based sequence assembler. BMC Bioinform. 13(1), 82 (2012). \nhttps:\/\/doi.org\/10.1186\/1471-2105-13-82","journal-title":"BMC Bioinform."},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0097-3165(81)90038-8","volume":"30","author":"LJ Guibas","year":"1981","unstructured":"Guibas, L.J., Odlyzko, A.M.: Periods in strings. J. Comb. Theory Ser. A 30(1), 19\u201342 (1981). \nhttps:\/\/doi.org\/10.1016\/0097-3165(81)90038-8","journal-title":"J. Comb. Theory Ser. A"},{"issue":"4","key":"20_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(92)90176-V","volume":"41","author":"D Gusfield","year":"1992","unstructured":"Gusfield, D., Landau, G.M., Schieber, B.: An efficient algorithm for the all pairs suffix-prefix problem. Inf. Process. Lett. 41(4), 181\u2013185 (1992). \nhttps:\/\/doi.org\/10.1016\/0020-0190(92)90176-V","journal-title":"Inf. Process. Lett."},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/BFb0028575","volume-title":"STACS 98","author":"T Hagerup","year":"1998","unstructured":"Hagerup, T.: Sorting and searching on the word RAM. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 366\u2013398. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0028575"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.dam.2013.02.033","volume":"163","author":"I Tomohiro","year":"2014","unstructured":"Tomohiro, I., Inenaga, S., Bannai, H., Takeda, M.: Inferring strings from suffix trees and links on a binary alphabet. Discret. Appl. Math. 163, 316\u2013325 (2014). \nhttps:\/\/doi.org\/10.1016\/j.dam.2013.02.033","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"20_CR17","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0097-3165(94)90065-5","volume":"66","author":"P Jacquet","year":"1994","unstructured":"Jacquet, P., Szpankowski, W.: Autocorrelation on words and its applications: analysis of suffix trees by string-ruler approach. J. Comb. Theory Ser. A 66(2), 237\u2013269 (1994). \nhttps:\/\/doi.org\/10.1016\/0097-3165(94)90065-5","journal-title":"J. Comb. Theory Ser. A"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Karkkainen, J., Piatkowski, M., Puglisi, S.J.: String inference from longest-common-prefix array. In: ICALP. LIPIcs, vol. 80, pp. 62:1\u201362:14 (2017). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.62","DOI":"10.4230\/LIPIcs.ICALP.2017.62"},{"key":"20_CR19","series-title":"Undergraduate Topics in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72547-5","volume-title":"Guide to Competitive Programming","author":"A Laaksonen","year":"2017","unstructured":"Laaksonen, A.: Guide to Competitive Programming. UTCS. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-72547-5"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.tcs.2017.07.013","volume":"698","author":"J Lim","year":"2017","unstructured":"Lim, J., Park, K.: A fast algorithm for the all-pairs suffix-prefix problem. Theoret. Comput. Sci. 698, 14\u201324 (2017). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2017.07.013","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR21","doi-asserted-by":"publisher","unstructured":"Mucha, M.: Lyndon words and short superstrings. In: SODA, pp. 958\u2013972. SIAM (2013). \nhttps:\/\/doi.org\/10.1137\/1.9781611973105.69","DOI":"10.1137\/1.9781611973105.69"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Myers, E.W.: The fragment assembly string graph. Bioinformatics 21(Suppl. 2), ii79\u2013ii85 (2005). \nhttps:\/\/doi.org\/10.1093\/bioinformatics\/bti1114","DOI":"10.1093\/bioinformatics\/bti1114"},{"key":"20_CR23","unstructured":"Paluch, K.: Better approximation algorithms for maximum asymmetric traveling salesman and shortest superstring (2014). \nhttps:\/\/arxiv.org\/abs\/1401.3670"},{"issue":"5","key":"20_CR24","doi-asserted-by":"publisher","first-page":"1821","DOI":"10.1137\/070685531","volume":"38","author":"G Park","year":"2009","unstructured":"Park, G., Hwang, H., Nicodeme, P., Szpankowski, W.: Profiles of tries. SIAM J. Comput. 38(5), 1821\u20131880 (2009). \nhttps:\/\/doi.org\/10.1137\/070685531","journal-title":"SIAM J. Comput."},{"key":"20_CR25","unstructured":"Peltola, H., Soderlund, H., Tarhio, J., Ukkonen, E.: Algorithms for some string matching problems arising in molecular genetics. In: IFIP Congress, pp. 53\u201364 (1983)"},{"issue":"17","key":"20_CR26","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"PA Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An eulerian path approach to DNA fragment assembly. Proc. Natl. Acad. Sci. 98(17), 9748\u20139753 (2001). \nhttps:\/\/doi.org\/10.1073\/pnas.171285098","journal-title":"Proc. Natl. Acad. Sci."},{"key":"20_CR27","doi-asserted-by":"publisher","unstructured":"Rachid, M.H., Malluhi, Q.: A practical and scalable tool to find overlaps between sequences. BioMed Res. Int. 2015 (2015). \nhttps:\/\/doi.org\/10.1155\/2015\/905261","DOI":"10.1155\/2015\/905261"},{"key":"20_CR28","volume-title":"DNA, Words and Models","author":"S Robin","year":"2005","unstructured":"Robin, S., Rodolphe, F., Schbath, S.: DNA, Words and Models. Cambridge University Press, Cambridge (2005)"},{"issue":"3","key":"20_CR29","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1137\/S0097539796324661","volume":"29","author":"Z Sweedyk","year":"2000","unstructured":"Sweedyk, Z.: A $$2\\frac{1}{2}$$-approximation algorithm for shortest superstring. SIAM J. Comput. 29(3), 954\u2013986 (2000). \nhttps:\/\/doi.org\/10.1137\/S0097539796324661","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59212-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T10:10:03Z","timestamp":1600251003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59212-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030592110","9783030592127"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59212-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Orlando, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ucf.edu\/spire2020\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","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":"17","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":"4","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":"53% - 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","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":"2","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)"}}]}}