{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:50:41Z","timestamp":1743090641755,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319199283"},{"type":"electronic","value":"9783319199290"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-19929-0_11","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T13:09:49Z","timestamp":1434373789000},"page":"124-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Readability of Overlap Digraphs"],"prefix":"10.1007","author":[{"given":"Rayan","family":"Chikhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Medvedev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Milani\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sofya","family":"Raskhodnikova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"issue":"Suppl 5","key":"11_CR1","doi-asserted-by":"crossref","first-page":"S18","DOI":"10.1186\/1471-2105-14-S5-S18","volume":"14","author":"G Bresler","year":"2013","unstructured":"Bresler, G., Bresler, M., Tse, D.: Optimal assembly for high throughput shotgun sequencing. BMC Bioinform. 14(Suppl 5), S18 (2013)","journal-title":"BMC Bioinform."},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-36379-3_2","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J B\u0142a\u017cewicz","year":"2002","unstructured":"B\u0142a\u017cewicz, J., Formanowicz, P., Kasprzak, M., Schuurman, P., Woeginger, G.J.: DNA sequencing, eulerian graphs, and the exact perfect matching problem. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 13\u201324. Springer, Heidelberg (2002)"},{"issue":"1","key":"11_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0012-365X(01)00133-9","volume":"245","author":"J B\u0142a\u017cewicz","year":"2002","unstructured":"B\u0142a\u017cewicz, J., Formanowicz, P., Kasprzak, M., Kobler, D.: On the recognition of de Bruijn graphs and their induced subgraphs. Discrete Math. 245(1), 81\u201392 (2002)","journal-title":"Discrete Math."},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(99)00109-2","volume":"98","author":"J Blazewicz","year":"1999","unstructured":"Blazewicz, J., Hertz, A., Kobler, D., de Werra, D.: On some properties of DNA graphs. Discrete Appl. Math. 98(1), 1\u201319 (1999)","journal-title":"Discrete Appl. Math."},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-45995-2_10","volume-title":"LATIN 2002: Theoretical Informatics","author":"MDV Braga","year":"2002","unstructured":"Braga, M.D.V., Meidanis, J.: An algorithm that builds a set of strings given its overlap graph. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, p. 52. Springer, Heidelberg (2002)"},{"key":"11_CR6","series-title":"Graduate Texts in Mathematics.","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics., vol. 244. Springer, New York (2008)"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10878-013-9663-3","volume":"28","author":"TP Gevezes","year":"2014","unstructured":"Gevezes, T.P., Pitsoulis, L.S.: Recognition of overlap graphs. J. Comb. Optim. 28(1), 25\u201337 (2014)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1089\/cmb.1995.2.291","volume":"2","author":"RM Idury","year":"1995","unstructured":"Idury, R.M., Waterman, M.S.: A new algorithm for DNA sequence assembly. J. Comput. Biol. 2(2), 291\u2013306 (1995)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10910-006-9099-4","volume":"42","author":"X Li","year":"2007","unstructured":"Li, X., Zhang, H.: Characterizations for some types of DNA graphs. J. Math. Chem. 42(1), 65\u201379 (2007)","journal-title":"J. Math. Chem."},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/s10910-009-9530-8","volume":"47","author":"X Li","year":"2010","unstructured":"Li, X., Zhang, H.: Embedding on alphabet overlap digraphs. J. Math. Chem. 47(1), 62\u201371 (2010)","journal-title":"J. Math. Chem."},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-74126-8_27","volume-title":"Algorithms in Bioinformatics","author":"P Medvedev","year":"2007","unstructured":"Medvedev, P., Georgiou, K., Myers, G., Brudno, M.: Computability of models for sequence assembly. In: Giancarlo, R., Hannenhalli, S. (eds.) WABI 2007. LNCS (LNBI), vol. 4645, pp. 289\u2013301. Springer, Heidelberg (2007)"},{"issue":"6","key":"11_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ygeno.2010.03.001","volume":"95","author":"JR Miller","year":"2010","unstructured":"Miller, J.R., Koren, S., Sutton, G.: Assembly algorithms for next-generation sequencing data. Genomics 95(6), 315\u2013327 (2010)","journal-title":"Genomics"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Myers, E.W.: The fragment assembly string graph. In: ECCB\/JBI, pp. 85 (2005)","DOI":"10.1093\/bioinformatics\/bti1114"},{"issue":"7","key":"11_CR14","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1089\/cmb.2009.0005","volume":"16","author":"N Nagarajan","year":"2009","unstructured":"Nagarajan, N., Pop, M.: Parametric complexity of sequence assembly: theory and applications to next generation sequencing. J. Comput. Biol. 16(7), 897\u2013908 (2009)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1038\/nrg3367","volume":"14","author":"N Nagarajan","year":"2013","unstructured":"Nagarajan, N., Pop, M.: Sequence assembly demystified. Nat. Rev. Genet. 14(3), 157\u2013167 (2013)","journal-title":"Nat. Rev. Genet."},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0166-218X(02)00287-1","volume":"127","author":"R Pendavingh","year":"2003","unstructured":"Pendavingh, R., Schuurman, P., Woeginger, G.J.: Recognizing DNA graphs is difficult. Discrete Appl. Math. 127(1), 85\u201394 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"11_CR17","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1137\/S0097539796324661","volume":"29","author":"Z Sweedyk","year":"2000","unstructured":"Sweedyk, Z.: A 2\n$$\\frac{1}{2}$$\n-approximation algorithm for shortest superstring. SIAM J. Comput. 29(3), 954\u2013986 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","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. Comput. Sci. 57(1), 131\u2013145 (1988)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19929-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T16:19:29Z","timestamp":1674836369000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19929-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199283","9783319199290"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19929-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}