乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T21:17:40Z","timestamp":1726435060708},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T00:00:00Z","timestamp":1558656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T00:00:00Z","timestamp":1558656000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS 1618814"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"FONDECYT","award":["1171058"]},{"name":"PRIN","award":["201534HNXC"]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s13015-019-0148-5","type":"journal-article","created":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T12:03:22Z","timestamp":1558699402000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Prefix-free parsing for building big BWTs"],"prefix":"10.1186","volume":"14","author":[{"given":"Christina","family":"Boucher","sequence":"first","affiliation":[]},{"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6506-1902","authenticated-orcid":false,"given":"Alan","family":"Kuhnle","sequence":"additional","affiliation":[]},{"given":"Ben","family":"Langmead","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Manzini","sequence":"additional","affiliation":[]},{"given":"Taher","family":"Mun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,24]]},"reference":[{"key":"148_CR1","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1038\/nature15393","volume":"526","author":"The 1000 Genomes Project Consortium","year":"2015","unstructured":"The 1000 Genomes Project Consortium. A global reference for human genetic variation. Nature. 2015;526:68\u201374.","journal-title":"Nature."},{"key":"148_CR2","doi-asserted-by":"publisher","first-page":"1687","DOI":"10.1136\/bmj.k1687","volume":"361","author":"C Turnbull","year":"2018","unstructured":"Turnbull C, et al. The 100,000 genomes project: bringing whole genome sequencing to the nhs. Br Med J. 2018;361:1687.","journal-title":"Br Med J"},{"key":"148_CR3","first-page":"311","volume":"11","author":"HA Carleton","year":"2016","unstructured":"Carleton HA, Gerner-Smidt P. Whole-genome sequencing is taking over foodborne disease surveillance. Microbe. 2016;11:311\u20137.","journal-title":"Microbe"},{"key":"148_CR4","doi-asserted-by":"publisher","first-page":"808","DOI":"10.3389\/fmicb.2017.00808","volume":"8","author":"EL Stevens","year":"2017","unstructured":"Stevens EL, Timme R, Brown EW, Allard MW, Strain E, Bunning K, Musser S. The public health impact of a publically available, environmental database of microbial genomes. Front Microbiol. 2017;8:808.","journal-title":"Front Microbiol"},{"key":"148_CR5","unstructured":"Burrows M, Wheeler DJ. A block-sorting lossless compression algorithm, Technical report. : Digital Equipment Corporation; 1994."},{"key":"148_CR6","doi-asserted-by":"crossref","unstructured":"Sir\u00e9n J. Burrows-Wheeler transform for terabases. In: Proccedings of the 2016 data compression conference (DCC), 2016; p. 211\u2013220.","DOI":"10.1109\/DCC.2016.17"},{"issue":"3","key":"148_CR7","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s00453-011-9535-0","volume":"63","author":"P Ferragina","year":"2012","unstructured":"Ferragina P, Gagie T, Manzini G. Lightweight data indexing and compression in external memory. Algorithmica. 2012;63(3):707\u201330.","journal-title":"Algorithmica"},{"key":"148_CR8","unstructured":"Policriti A, Prezza N. From LZ77 to the run-length encoded burrows-wheeler transform, and back. In: Proceedings of the 28th symposium on combinatorial pattern matching (CPM), 2017; p. 17\u201311710."},{"key":"148_CR9","unstructured":"https:\/\/rsync.samba.org\n \n . Accessed 10 Apr 2019."},{"issue":"3","key":"148_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2493175.2493180","volume":"31","author":"G Nong","year":"2013","unstructured":"Nong G. Practical linear-time O(1)-workspace suffix sorting for constant alphabets. ACM Trans Inf Syst. 2013;31(3):15.","journal-title":"ACM Trans Inf Syst"},{"issue":"4","key":"148_CR11","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P Ferragina","year":"2005","unstructured":"Ferragina P, Manzini G. Indexing compressed text. J ACM (JACM). 2005;52(4):552\u201381.","journal-title":"J ACM (JACM)"},{"key":"148_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2017.03.039","volume":"678","author":"FA Louza","year":"2017","unstructured":"Louza FA, Gog S, Telles GP. Inducing enhanced suffix arrays for string collections. Theor Comput Sci. 2017;678:22\u201339.","journal-title":"Theor Comput Sci"},{"key":"148_CR13","unstructured":"http:\/\/pizzachili.dcc.uchile.cl\/repcorpus.html\n \n . Accessed 10 Apr 2019."},{"issue":"3","key":"148_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1186\/gb-2009-10-3-r25","volume":"10","author":"B Langmead","year":"2009","unstructured":"Langmead B, Trapnell C, Pop M, Salzberg SL. Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol. 2009;10(3):25.","journal-title":"Genome Biol"},{"issue":"4","key":"148_CR15","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/nmeth.1923","volume":"9","author":"B Langmead","year":"2012","unstructured":"Langmead B, Salzberg SL. Fast gapped-read alignment with Bowtie 2. Nat Methods. 2012;9(4):357\u201360. \n https:\/\/doi.org\/10.1038\/nmeth.1923\n \n .","journal-title":"Nat Methods"},{"issue":"5","key":"148_CR16","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1093\/bioinformatics\/btp698","volume":"26","author":"H Li","year":"2010","unstructured":"Li H, Durbin R. Fast and accurate long-read alignment with burrows-wheeler transform. Bioinformatics. 2010;26(5):589\u201395.","journal-title":"Bioinformatics"},{"issue":"15","key":"148_CR17","doi-asserted-by":"publisher","first-page":"1966","DOI":"10.1093\/bioinformatics\/btp336","volume":"25","author":"R Li","year":"2009","unstructured":"Li R, Yu C, Li Y, Lam T-W, Yiu S-M, Kristiansen K, Wang J. Soap2: an improved ultrafast tool for short read alignment. Bioinformatics. 2009;25(15):1966\u20137.","journal-title":"Bioinformatics"},{"key":"148_CR18","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1137\/1.9781611975031.96","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Travis Gagie","year":"2018","unstructured":"Gagie T, Navarro G, Prezza N. Optimal-time text indexing in bwt-runs bounded space. In: Proceedings of the 29th symposium on discrete algorithms (SODA), 2018. p. 1459\u201377."},{"key":"148_CR19","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-07959-2_28","volume-title":"Experimental Algorithms","author":"Simon Gog","year":"2014","unstructured":"Gog S, Beller T, Moffat A, Petri M. From theory to practice: plug and play with succinct data structures. In: 13th international symposium on experimental algorithms, (SEA 2014), 2014. p. 326\u201337."},{"issue":"7571","key":"148_CR20","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1038\/nature15393","volume":"526","author":"TGP Consortium","year":"2015","unstructured":"Consortium TGP. A global reference for human genetic variation. Nature. 2015;526(7571):68\u201374. \n https:\/\/doi.org\/10.1038\/nature15393\n \n Accessed 2018-09-28.","journal-title":"Nature"},{"issue":"11","key":"148_CR21","doi-asserted-by":"publisher","first-page":"1749","DOI":"10.1093\/bioinformatics\/btw044","volume":"32","author":"V Narasimhan","year":"2016","unstructured":"Narasimhan V, Danecek P, Scally A, Xue Y, Tyler-Smith C, Durbin R. BCFtools\/RoH: a hidden Markov model approach for detecting autozygosity from next-generation sequencing data. Bioinformatics. 2016;32(11):1749\u201351.","journal-title":"Bioinformatics"},{"issue":"1","key":"148_CR22","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1186\/s40168-016-0168-z","volume":"4","author":"A MetaSUB International Consortium","year":"2016","unstructured":"MetaSUB International Consortium A. The metagenomics and metadesign of the subways and urban biomes (MetaSUB) international consortium inaugural meeting report. Microbiome. 2016;4(1):24.","journal-title":"Microbiome"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-019-0148-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13015-019-0148-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-019-0148-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T23:10:25Z","timestamp":1590189025000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-019-0148-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,24]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["148"],"URL":"https:\/\/doi.org\/10.1186\/s13015-019-0148-5","relation":{"has-preprint":[{"id-type":"doi","id":"10.1101\/472399","asserted-by":"object"}]},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,24]]},"assertion":[{"value":"29 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"13"}}