{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:41:43Z","timestamp":1725799303805},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662447529"},{"type":"electronic","value":"9783662447536"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44753-6_23","type":"book-chapter","created":{"date-parts":[[2014,8,15]],"date-time":"2014-08-15T12:08:34Z","timestamp":1408104514000},"page":"311-325","source":"Crossref","is-referenced-by-count":5,"title":["Constructing String Graphs in External Memory"],"prefix":"10.1007","author":[{"given":"Paola","family":"Bonizzoni","sequence":"first","affiliation":[]},{"given":"Gianluca","family":"Della Vedova","sequence":"additional","affiliation":[]},{"given":"Yuri","family":"Pirola","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Previtali","sequence":"additional","affiliation":[]},{"given":"Raffaella","family":"Rizzi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"23_CR1","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1089\/cmb.2012.0021","volume":"19","author":"A. Bankevich","year":"2012","unstructured":"Bankevich, A., Nurk, S., Antipov, D., et al.: SPAdes: A new genome assembly algorithm and its applications to single-cell sequencing. J. Comput. Biol.\u00a019(5), 455\u2013477 (2012)","journal-title":"J. Comput. Biol."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.tcs.2012.02.002","volume":"483","author":"M. Bauer","year":"2013","unstructured":"Bauer, M., Cox, A., Rosone, G.: Lightweight algorithms for constructing and inverting the BWT of string collections. Theor. Comput. Sci.\u00a0483, 134\u2013148 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-33122-0_26","volume-title":"Algorithms in Bioinformatics","author":"M.J. Bauer","year":"2012","unstructured":"Bauer, M.J., Cox, A.J., Rosone, G., Sciortino, M.: Lightweight LCP construction for next-generation sequencing datasets. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol.\u00a07534, pp. 326\u2013337. Springer, Heidelberg (2012)"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1089\/cmb.2013.0112","volume":"16","author":"S. Beretta","year":"2014","unstructured":"Beretta, S., Bonizzoni, P., Della Vedova, G., Pirola, Y., Rizzi, R.: Modeling alternative splicing variants from RNA-Seq data with isoform graphs. J. Comput. Biol.\u00a016(1), 16\u201340 (2014)","journal-title":"J. Comput. Biol."},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-33122-0_17","volume-title":"Algorithms in Bioinformatics","author":"A.J. Cox","year":"2012","unstructured":"Cox, A.J., Jakobi, T., Rosone, G., Schulz-Trieglaff, O.B.: Comparing DNA sequence collections by direct comparison of compressed text indexes. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS, vol.\u00a07534, pp. 214\u2013224. Springer, Heidelberg (2012)"},{"issue":"3","key":"23_CR6","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\u00a063(3), 707\u2013730 (2012)","journal-title":"Algorithmica"},{"issue":"4","key":"23_CR7","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\u00a052(4), 552\u2013581 (2005)","journal-title":"J. ACM"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Lam, T., Li, R., Tam, A., Wong, S., Wu, E., Yiu, S.: High throughput short read alignment via bi-directional BWT. In: BIBM 2009, pp. 31\u201336 (2009)","DOI":"10.1109\/BIBM.2009.42"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1093\/bioinformatics\/bti1114","volume":"21","author":"E. Myers","year":"2005","unstructured":"Myers, E.: The fragment assembly string graph. Bioinformatics\u00a021, ii79\u2013ii85 (2005)","journal-title":"Bioinformatics"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-12683-3_28","volume-title":"Research in Computational Molecular Biology","author":"Y. Peng","year":"2010","unstructured":"Peng, Y., Leung, H.C.M., Yiu, S.M., Chin, F.Y.L.: IDBA \u2013 A practical iterative de bruijn graph de novo assembler. In: Berger, B. (ed.) RECOMB 2010. LNCS, vol.\u00a06044, pp. 426\u2013440. Springer, Heidelberg (2010)"},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1101\/gr.131383.111","volume":"22","author":"S.L. Salzberg","year":"2012","unstructured":"Salzberg, S.L., et al.: GAGE: A critical evaluation of genome assemblies and assembly algorithms. Genome Res.\u00a022(3), 557\u2013567 (2012)","journal-title":"Genome Res."},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BFb0027775","volume-title":"Concurrency and Parallelism, Programming, Networking, and Security","author":"F. Shi","year":"1996","unstructured":"Shi, F.: Suffix arrays for multiple strings: A method for on-line multiple string searches. In: Jaffar, J., Yap, R.H.C. (eds.) ASIAN 1996. LNCS, vol.\u00a01179, pp. 11\u201322. Springer, Heidelberg (1996)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Simpson, J., Durbin, R.: Efficient construction of an assembly string graph using the FM-index. Bioinformatics\u00a026(12), i367\u2013i373 (2010)","DOI":"10.1093\/bioinformatics\/btq217"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1101\/gr.126953.111","volume":"22","author":"J. Simpson","year":"2012","unstructured":"Simpson, J., Durbin, R.: Efficient de novo assembly of large genomes using compressed data structures. Genome Res.\u00a022, 549\u2013556 (2012)","journal-title":"Genome Res."},{"issue":"6","key":"23_CR15","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1101\/gr.089532.108","volume":"19","author":"J. Simpson","year":"2009","unstructured":"Simpson, J., Wong, K., Jackman, S., et al.: ABySS: a parallel assembler for short read sequence data. Genome Res.\u00a019(6), 1117\u20131123 (2009)","journal-title":"Genome Res."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44753-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T12:51:54Z","timestamp":1717246314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44753-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447529","9783662447536"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44753-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}