{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:18Z","timestamp":1759638258926,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319947754"},{"type":"electronic","value":"9783319947761"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94776-1_39","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T01:48:06Z","timestamp":1530236886000},"page":"467-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bipartite Graphs of Small Readability"],"prefix":"10.1007","author":[{"given":"Rayan","family":"Chikhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladan","family":"Jovi\u010di\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Kratsch","sequence":"additional","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"}]},{"given":"Nithin","family":"Varma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"issue":"1","key":"39_CR1","doi-asserted-by":"publisher","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."},{"key":"39_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: Goos, G., Hartmanis, J., van Leeuwen, J., Ku\u010dera, L. (eds.) WG 2002. LNCS, vol. 2573, pp. 13\u201324. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36379-3_2"},{"issue":"1","key":"39_CR3","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":"39_CR4","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, pp. 52\u201363. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Chikhi, R., Jovicic, V., Kratsch, S., Medvedev, P., Milanic, M., Raskhodnikova, S., Varma, N.: Bipartite graphs of small readability. CoRR (2018). http:\/\/arxiv.org\/abs\/1805.04765","key":"39_CR5","DOI":"10.1007\/978-3-319-94776-1_39"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.dam.2015.12.009","volume":"205","author":"R Chikhi","year":"2016","unstructured":"Chikhi, R., Medvedev, P., Milani\u010d, M., Raskhodnikova, S.: On the readability of overlap digraphs. Discrete Appl. Math. 205, 35\u201344 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"39_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discrete Math."},{"issue":"1","key":"39_CR8","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1006\/jagm.2000.1149","volume":"39","author":"J D\u00edaz","year":"2001","unstructured":"D\u00edaz, J., Penrose, M.D., Petit, J., Serna, M.J.: Approximating layout problems on random geometric graphs. J. Algorithms 39(1), 78\u2013116 (2001)","journal-title":"J. Algorithms"},{"issue":"1","key":"39_CR9","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."},{"key":"39_CR10","volume-title":"An Introduction to the Theory of Numbers","author":"GH Hardy","year":"1979","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edn. The Clarendon Press, Oxford University Press, New York (1979)","edition":"5"},{"issue":"2","key":"39_CR11","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":"4","key":"39_CR12","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676\u2013686 (1982)","journal-title":"SIAM J. Comput."},{"unstructured":"Jovi\u010di\u0107, V.: Readability of digraphs and bipartite graphs (2016), final project paper. University of Primorska, Faculty of Mathematics, Natural Sciences and Information Technologies, Koper, Slovenia (2016). https:\/\/arxiv.org\/abs\/1612.07113","key":"39_CR13"},{"key":"39_CR14","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.dam.2016.10.014","volume":"234","author":"M Kasprzak","year":"2016","unstructured":"Kasprzak, M.: Classification of de Bruijn-based labeled digraphs. Discrete Appl. Math. 234, 86\u201392 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"39_CR15","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":"39_CR16","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."},{"issue":"6","key":"39_CR17","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"},{"doi-asserted-by":"crossref","unstructured":"Myers, E.W.: The fragment assembly string graph. In: ECCB\/JBI, p. 85 (2005)","key":"39_CR18","DOI":"10.1093\/bioinformatics\/bti1114"},{"issue":"3","key":"39_CR19","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":"39_CR20","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."},{"key":"39_CR21","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1101\/gr.126953.111","volume":"22","author":"JT Simpson","year":"2011","unstructured":"Simpson, J.T., Durbin, R.: Efficient de novo assembly of large genomes using compressed data structures. Genome Res. 22, 549\u2013556 (2011)","journal-title":"Genome Res."},{"unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences (2016). https:\/\/oeis.org","key":"39_CR22"},{"issue":"1","key":"39_CR23","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. Theoret. Comput. Sci. 57(1), 131\u2013145 (1988)","journal-title":"Theoret. Comput. Sci."},{"key":"39_CR24","volume-title":"Introduction to Graph Theory","author":"DB West","year":"1996","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall Inc., Upper Saddle River (1996)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94776-1_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:36:12Z","timestamp":1710347772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94776-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319947754","9783319947761"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94776-1_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qing Dao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2018.sdu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}