{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:46:17Z","timestamp":1725860777545},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411675"},{"type":"electronic","value":"9783319411682"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41168-2_4","type":"book-chapter","created":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T01:26:28Z","timestamp":1467595588000},"page":"39-52","source":"Crossref","is-referenced-by-count":0,"title":["Superstring Graph: A New Approach for Genome Assembly"],"prefix":"10.1007","author":[{"given":"Bastien","family":"Cazaux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gustavo","family":"Sacomoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Rivals","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"issue":"5","key":"4_CR1","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1089\/cmb.2012.0021","volume":"19","author":"A Bankevich","year":"2012","unstructured":"Bankevich, A., Nurk, S., Antipov, D., Gurevich, A.A., Dvorkin, M., Kulikov, A.S., Lesin, V.M., Nikolenko, S.I., Pham, S., Prjibelski, A.D., Pyshkin, A.V., Sirotkin, A.V., Vyahhi, N., Tesler, G., Alekseyev, M.A., Pevzner, P.A.: SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing. J. Comp. Biol. 19(5), 455\u2013477 (2012)","journal-title":"J. Comp. Biol."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Boucher, C., Bowe, A., Gagie, T., Puglisi, S.J., Sadakane, K.: Variable-order de bruijn graphs CoRR abs\/1411.2718 (2014)","DOI":"10.1109\/DCC.2015.70"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Cazaux, B., C\u00e1novas, R., Rivals, E.: Shortest DNA cyclic cover in compressed space. In: Data Compression Conference DCC, pp. 536\u2013545. IEEE Computer Society Press (2016)","DOI":"10.1109\/DCC.2016.79"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-319-07566-2_10","volume-title":"Combinatorial Pattern Matching","author":"B Cazaux","year":"2014","unstructured":"Cazaux, B., Lecroq, T., Rivals, E.: From indexing data structures to de bruijn graphs. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 89\u201399. Springer, Heidelberg (2014)"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Cazaux, B., Rivals, E.: A linear time algorithm for shortest cyclic cover of strings. J. Discrete Algorithms (2016). doi: 10.1016\/j.jda.2016.05.001","DOI":"10.1016\/j.jda.2016.05.001"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Cazaux, B., Rivals, E.: The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings. Discrete Appl. Math. (2015). doi: 10.1016\/j.dam.2015.06.003","DOI":"10.1016\/j.dam.2015.06.003"},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0022-0000(80)90004-5","volume":"20","author":"J Gallant","year":"1980","unstructured":"Gallant, J., Maier, D., Storer, J.A.: On finding minimal length superstrings. J. Comput. Syst. Sci. 20, 50\u201358 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"4_CR8","doi-asserted-by":"crossref","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)","journal-title":"Inf. Process. Lett."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/978-3-662-44753-6_22","volume-title":"Algorithms in Bioinformatics","author":"Y Lin","year":"2014","unstructured":"Lin, Y., Pevzner, P.A.: Manifold de bruijn graphs. In: Brown, D., Morgenstern, B. (eds.) WABI 2014. LNCS, vol. 8701, pp. 296\u2013310. Springer, Heidelberg (2014)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1007\/11841036_48","volume-title":"Algorithms \u2013 ESA 2006","author":"J Mestre","year":"2006","unstructured":"Mestre, J.: Greedy in approximation algorithms. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 528\u2013539. Springer, Heidelberg (2006)"},{"issue":"6","key":"4_CR11","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1093\/jhered\/esp086","volume":"100","author":"G. K. C. of Scientists","year":"2009","unstructured":"G. K. C. of Scientists: Genome 10K a proposal to obtain whole-genome sequence for 10 000 vertebrate species. J. Hered. 100(6), 659\u2013674 (2009)","journal-title":"J. Hered."},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/3-540-46784-X_7","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S Ott","year":"1999","unstructured":"Ott, S.: Lower bounds for approximating shortest superstrings over an alphabet of size 2. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 55\u201364. Springer, Heidelberg (1999)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 6044, pp. 426\u2013440. Springer, Heidelberg (2010)"},{"key":"4_CR14","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(88)90167-3","volume":"57","author":"J Tarhio","year":"1988","unstructured":"Tarhio, J., Ukkonen, E.: A greedy approximation algorithm for constructing shortest common superstrings. Theor. Comp. Sci. 57, 131\u2013145 (1988)","journal-title":"Theor. Comp. Sci."},{"issue":"7422","key":"4_CR15","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1038\/nature11632","volume":"491","author":"The 1000 Genomes Project Consortium","year":"2012","unstructured":"The 1000 Genomes Project Consortium: An integrated map of genetic variation from 1,092 human genomes. Nature 491(7422), 56\u201365 (2012)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41168-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T16:44:16Z","timestamp":1568133856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41168-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411675","9783319411682"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41168-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}