{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:30:29Z","timestamp":1743100229052,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031439797"},{"type":"electronic","value":"9783031439803"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43980-3_8","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:15Z","timestamp":1695124935000},"page":"89-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Data Structures for\u00a0SMEM-Finding in\u00a0the\u00a0PBWT"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7289-4988","authenticated-orcid":false,"given":"Paola","family":"Bonizzoni","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9509-9725","authenticated-orcid":false,"given":"Christina","family":"Boucher","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2439-0608","authenticated-orcid":false,"given":"Davide","family":"Cozzi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3689-327X","authenticated-orcid":false,"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8721-4444","authenticated-orcid":false,"given":"Dominik","family":"K\u00f6ppl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3012-1394","authenticated-orcid":false,"given":"Massimiliano","family":"Rossi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2019.08.005","volume":"812","author":"H Bannai","year":"2020","unstructured":"Bannai, H., Gagie, T., Tomohiro, I.: Refining the R-index. Theor. Comput. Sci. 812, 96\u2013108 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1101\/gr.083634.108","volume":"19","author":"GK Chen","year":"2009","unstructured":"Chen, G.K., Marjoram, P., Wall, J.D.: Fast and flexible simulation of DNA sequence data. Genome Res. 19(1), 136\u2013142 (2009)","journal-title":"Genome Res."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Cozzi, D., Rossi, M., Rubinacci, S., K\u00f6ppl, D., Boucher, C., Bonizzoni, P.: $$\\mu $$-PBWT: enabling the storage and use of UK biobank data on a commodity laptop. bioRxiv, pp. 2023\u201302 (2023)","DOI":"10.1101\/2023.02.15.528658"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Danecek, P., et al.: Twelve years of SAMtools and BCFtools. GigaScience 10(2) (2021)","DOI":"10.1093\/gigascience\/giab008"},{"issue":"9","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1266","DOI":"10.1093\/bioinformatics\/btu014","volume":"30","author":"R Durbin","year":"2014","unstructured":"Durbin, R.: Efficient haplotype matching and storage using the positional Burrows-Wheeler transform (PBWT). Bioinformatics 30(9), 1266\u20131272 (2014)","journal-title":"Bioinformatics"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1137\/090779759","volume":"40","author":"J Fischer","year":"2011","unstructured":"Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40(2), 465\u2013492 (2011)","journal-title":"SIAM J. Comput."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Gagie, T., Navarro, G., Prezza, N.: Fully functional suffix trees and optimal text searching in BWT-runs bounded space. J. ACM 67(1), 2:1\u20132:54 (2020)","DOI":"10.1145\/3375890"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.tcs.2019.07.002","volume":"812","author":"P Gawrychowski","year":"2020","unstructured":"Gawrychowski, P., Jo, S., Mozes, S., Weimann, O.: Compressed range minimum queries. Theor. Comput. Sci. 812, 39\u201348 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Kempa, D., Prezza, N.: At the roots of dictionary compression: string attractors. In: Proceedings of ACM SIGACT Symposium on Theory of Computing (STOC), pp. 827\u2013840 (2018)","DOI":"10.1145\/3188745.3188814"},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1093\/bioinformatics\/btv613","volume":"32","author":"H Li","year":"2016","unstructured":"Li, H.: BGT: efficient and flexible genotype query across many samples. Bioinformatics 32(4), 590\u2013592 (2016)","journal-title":"Bioinformatics"},{"issue":"2","key":"8_CR11","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1515\/gcc-2012-0016","volume":"4","author":"M Lohrey","year":"2012","unstructured":"Lohrey, M.: Algorithmics on SLP-compressed strings: a survey. Groups - Complex. - Cryptol. 4(2), 241\u2013299 (2012)","journal-title":"Groups - Complex. - Cryptol."},{"issue":"7","key":"8_CR12","doi-asserted-by":"publisher","first-page":"1986","DOI":"10.1007\/s00453-017-0327-z","volume":"80","author":"A Policriti","year":"2018","unstructured":"Policriti, A., Prezza, N.: LZ77 computation based on the run-length encoded BWT. Algorithmica 80(7), 1986\u20132011 (2018)","journal-title":"Algorithmica"},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1089\/cmb.2021.0290","volume":"29","author":"M Rossi","year":"2022","unstructured":"Rossi, M., Oliva, M., Langmead, B., Gagie, T., Boucher, C.: MONI: a pangenomic index for finding maximal exact matches. J. Comput. Biol. 29(2), 169\u2013187 (2022)","journal-title":"J. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43980-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:47Z","timestamp":1695124967000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43980-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439797","9783031439803"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43980-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 September 2023","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":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","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":"spire2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2023.isti.cnr.it\/","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":"47","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":"31","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":"66% - 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":"3","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)"}}]}}