{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T04:29:48Z","timestamp":1726028988002},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030170820"},{"type":"electronic","value":"9783030170837"}],"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"},{"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-17083-7_10","type":"book-chapter","created":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T19:02:19Z","timestamp":1555268539000},"page":"158-173","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Construction of a Complete Index for Pan-Genomics Read Alignment"],"prefix":"10.1007","author":[{"given":"Alan","family":"Kuhnle","sequence":"first","affiliation":[]},{"given":"Taher","family":"Mun","sequence":"additional","affiliation":[]},{"given":"Christina","family":"Boucher","sequence":"additional","affiliation":[]},{"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[]},{"given":"Ben","family":"Langmead","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Manzini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,2]]},"reference":[{"key":"10_CR1","unstructured":"Bannai, H., Gagie, T., I, T.: Online LZ77 parsing and matching statistics with RLBWTs. In: Proceedings of the 29th Annual Symposium on Combinatorial Pattern Matching, (CPM), vol. 105, pp. 7:1\u20137:12 (2018)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Boucher, C., Gagie, T., Kuhnle, A., Manzini, G.: Prefix-free parsing for building big BWTs. In: Proceedings of 18th International Workshop on Algorithms in Bioinformatics, WABI, vol. 113, pp. 2:1\u20132:16 (2018)","DOI":"10.1101\/472399"},{"key":"10_CR3","unstructured":"Burrows, M., Wheeler, D.J.: A block sorting lossless data compression algorithm. Technical report 124. Digital Equipment Corporation (1994)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"The 1000 Genomes Project Consortium: A global reference for human genetic variation. Nature 526(7571), 68\u201374 (2015)","DOI":"10.1038\/nature15393"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Danek, A., Deorowicz, S., Grabowski, S.: Indexes of large genome collections on a PC. PLoS ONE 9(10), e109384 (2014)","DOI":"10.1371\/journal.pone.0109384"},{"issue":"10","key":"10_CR6","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1093\/bioinformatics\/btv022","volume":"31","author":"S Deorowicz","year":"2015","unstructured":"Deorowicz, S., Kokot, M., Grabowski, S., Debudaj-Grabysz, A.: KMC 2: fast and resource-frugal k-mer counting. Bioinformatics 31(10), 1569\u20131576 (2015)","journal-title":"Bioinformatics"},{"issue":"9","key":"10_CR7","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1038\/nbt.4227","volume":"36","author":"E Garrison","year":"2018","unstructured":"Garrison, E., et al.: Variation graph toolkit improves read mapping by representing genetic variation in the reference. Nat. Biotechnol. 36(9), 875\u2013879 (2018)","journal-title":"Nat. Biotechnol."},{"issue":"2016","key":"10_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1098\/rsta.2013.0137","volume":"372","author":"H Ferrada","year":"2014","unstructured":"Ferrada, H., Gagie, T., Hirvola, T., Puglisi, S.J.: Hybrid indexes for repetitive datasets. Philos. Trans. Roy. Soc. A: Math. Phys. Eng. Sci. 372(2016), 1\u20139 (2014)","journal-title":"Philos. Trans. Roy. Soc. A: Math. Phys. Eng. Sci."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Ferrada, H., Kempa, D., Puglisi, S.J.: Hybrid indexing revisited. In: Proceedings of the 21st Algorithm Engineering and Experiments, ALENEX, pp. 1\u20138 (2018)","DOI":"10.1137\/1.9781611975055.1"},{"key":"10_CR10","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, FOCS, pp. 390\u2013398 (2000)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Gagie, T., Navarro, G., Prezza, N.: Optimal-time text indexing in BWT-runs bounded space. In: Proceedings of the 29th Annual Symposium on Discrete Algorithms, SODA, pp. 1459\u20131477 (2018)","DOI":"10.1137\/1.9781611975031.96"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"10","DOI":"10.3389\/fbioe.2015.00012","volume":"3","author":"T Gagie","year":"2015","unstructured":"Gagie, T., Puglisi, S.J.: Searching and indexing genomic databases via kernelization. Front. Bioeng. Biotechnol. 3, 10\u201313 (2015)","journal-title":"Front. Bioeng. Biotechnol."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","volume":"25","author":"H Li","year":"2009","unstructured":"Li, H., Durbin, R.: Fast and accurate short read alignment with Burrows-Wheeler Transform. Bioinformatics 25, 1754\u20131760 (2009)","journal-title":"Bioinformatics"},{"issue":"13","key":"10_CR14","doi-asserted-by":"publisher","first-page":"i361","DOI":"10.1093\/bioinformatics\/btt215","volume":"29","author":"L Huang","year":"2013","unstructured":"Huang, L., Popic, V., Batzoglou, S.: Short read alignment with populations of genomes. Bioinformatics 29(13), i361\u2013i370 (2013)","journal-title":"Bioinformatics"},{"issue":"4","key":"10_CR15","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1038\/nbt.4060","volume":"36","author":"M Jain","year":"2018","unstructured":"Jain, M., et al.: Nanopore sequencing and assembly of a human genome with ultra-long reads. Nat. Biotechnol. 36(4), 338\u2013345 (2018)","journal-title":"Nat. Biotechnol."},{"issue":"7624","key":"10_CR16","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1038\/nature20098","volume":"538","author":"S Jeong-Sun","year":"2016","unstructured":"Jeong-Sun, S., et al.: De novo assembly and phasing of a Korean human genome. Nature 538(7624), 243\u2013247 (2016)","journal-title":"Nature"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-319-19929-0_28","volume-title":"Combinatorial Pattern Matching","author":"J K\u00e4rkk\u00e4inen","year":"2015","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D., Puglisi, S.J.: Parallel external memory suffix sorting. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 329\u2013342. Springer, Cham (2015). \n https:\/\/doi.org\/10.1007\/978-3-319-19929-0_28"},{"issue":"4","key":"10_CR18","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/nmeth.1923","volume":"9","author":"B Langmead","year":"2012","unstructured":"Langmead, B., Salzberg, S.L.: Fast gapped-read alignment with Bowtie 2. Nat. Methods 9(4), 357 (2012)","journal-title":"Nat. Methods"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Langmead, B., Trapnell, C., Pop, M., Salzberg, S.L.: Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol. 10, R25 (2008)","DOI":"10.1186\/gb-2009-10-3-r25"},{"issue":"10","key":"10_CR20","doi-asserted-by":"publisher","first-page":"e254","DOI":"10.1371\/journal.pbio.0050254","volume":"5","author":"S Levy","year":"2007","unstructured":"Levy, S., et al.: The diploid genome sequence of an individual human. PLoS Biol. 5(10), e254 (2007)","journal-title":"PLoS Biol."},{"issue":"15","key":"10_CR21","doi-asserted-by":"publisher","first-page":"1966","DOI":"10.1093\/bioinformatics\/btp336","volume":"25","author":"R Li","year":"2009","unstructured":"Li, R., et al.: SOAP2: an improved tool for short read alignment. Bioinformatics 25(15), 1966\u20131967 (2009)","journal-title":"Bioinformatics"},{"key":"10_CR22","unstructured":"Li, H.: Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM. \n arXiv:1303.3997\n \n [q-bio], March 2013"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-43681-4_18","volume-title":"Algorithms in Bioinformatics","author":"S Maciuca","year":"2016","unstructured":"Maciuca, S., del Ojo Elias, C., McVean, G., Iqbal, Z.: A natural encoding of genetic variation in a Burrows-Wheeler Transform to enable mapping and genome inference. In: Frith, M., Storm Pedersen, C.N. (eds.) WABI 2016. LNCS, vol. 9838, pp. 222\u2013233. Springer, Cham (2016). \n https:\/\/doi.org\/10.1007\/978-3-319-43681-4_18"},{"issue":"3","key":"10_CR24","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/cmb.2009.0169","volume":"17","author":"V M\u00e4kinen","year":"2010","unstructured":"M\u00e4kinen, V., Navarro, G., Sir\u00e9n, J., V\u00e4lim\u00e4ki, N.: Storage and retrieval of highly repetitive sequence collections. J. Comput. Biol. 17(3), 281\u2013308 (2010)","journal-title":"J. Comput. Biol."},{"issue":"11","key":"10_CR25","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1093\/bioinformatics\/bts174","volume":"28","author":"Y Peng","year":"2012","unstructured":"Peng, Y., Leung, H.C.M., Yiu, S.M., Chin, F.Y.L.: IDBA-UD: a de novo assembler for single-cell and metagenomic sequencing data with highly uneven depth. Bioinformatics 28(11), 1420\u20131428 (2012)","journal-title":"Bioinformatics"},{"issue":"7","key":"10_CR26","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"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Schneeberger, K., et al.: Simultaneous alignment of short reads against multiple genomes. Genome Biol. 10(9), R98 (2009)","DOI":"10.1186\/gb-2009-10-9-r98"},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"12065","DOI":"10.1038\/ncomms12065","volume":"7","author":"L Shi","year":"2016","unstructured":"Shi, L., et al.: Long-read sequencing and de novo assembly of a Chinese genome. Nat. Commun. 7, 12065 (2016)","journal-title":"Nat. Commun."},{"issue":"2","key":"10_CR29","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1109\/TCBB.2013.2297101","volume":"11","author":"J Sir\u00e9n","year":"2014","unstructured":"Sir\u00e9n, J., V\u00e4lim\u00e4ki, N., M\u00e4kinen, V.: Indexing graphs for path queries with applications in genome research. IEEE\/ACM Trans. Comput. Biol. Bioinform. 11(2), 375\u2013388 (2014)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"10_CR30","doi-asserted-by":"publisher","first-page":"2066","DOI":"10.1101\/gr.180893.114","volume":"24","author":"KM Steinberg","year":"2014","unstructured":"Steinberg, K.M., et al.: Single haplotype assembly of the human genome from a hydatidiform mole. Genome Res. 24, 2066\u20132076 (2014). p. gr.180893.114","journal-title":"Genome Res."},{"key":"10_CR31","doi-asserted-by":"publisher","first-page":"808","DOI":"10.3389\/fmicb.2017.00808","volume":"8","author":"EL Stevens","year":"2017","unstructured":"Stevens, E.L., et al.: The public health impact of a publically available, environmental database of microbial genomes. Front. Microbiol. 8, 808 (2017)","journal-title":"Front. Microbiol."},{"issue":"2","key":"10_CR32","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1186\/s12864-018-4465-8","volume":"19","author":"D Valenzuela","year":"2018","unstructured":"Valenzuela, D., Norri, T., V\u00e4lim\u00e4ki, N., Pitk\u00e4nen, E., M\u00e4kinen, V.: Towards pan-genome read alignment to improve variation calling. BMC Genomics 19(2), 87 (2018)","journal-title":"BMC Genomics"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Valenzuela, D., M\u00e4kinen, V.: CHIC: a short read aligner for pan-genomic references. Technical report, \n biorxiv.org\n \n (2017)","DOI":"10.1101\/178129"},{"issue":"13","key":"10_CR34","doi-asserted-by":"publisher","first-page":"1534","DOI":"10.14778\/2536258.2536265","volume":"6","author":"S Wandelt","year":"2013","unstructured":"Wandelt, S., Starlinger, J., Bux, M., Leser, U.: RCSI: scalable similarity search in thousand(s) of genomes. Proc. VLDB Endow. 6(13), 1534\u20131545 (2013)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17083-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:16:32Z","timestamp":1558343792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17083-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030170820","9783030170837"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17083-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"2 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Research in Computational Molecular Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Washington, DC","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb2019.org\/","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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"175","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"20","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10% - 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"}},{"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"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}