{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:57:28Z","timestamp":1725771448964},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319049205"},{"type":"electronic","value":"9783319049212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04921-2_10","type":"book-chapter","created":{"date-parts":[[2014,2,5]],"date-time":"2014-02-05T08:52:25Z","timestamp":1391590345000},"page":"126-137","source":"Crossref","is-referenced-by-count":1,"title":["Covering Pairs in Directed Acyclic Graphs"],"prefix":"10.1007","author":[{"given":"Niko","family":"Beerenwinkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Beretta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Bonizzoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Dondi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Pirola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"10","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1093\/bioinformatics\/btt127","volume":"29","author":"E. Bao","year":"2013","unstructured":"Bao, E., Jiang, T., Girke, T.: BRANCH: Boosting RNA-Seq assemblies with partial or related genomic sequences. Bioinformatics\u00a029(10), 1250\u20131259 (2013)","journal-title":"Bioinformatics"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/a6010001","volume":"6","author":"P. Bonizzoni","year":"2013","unstructured":"Bonizzoni, P., Dondi, R., Pirola, Y.: Maximum disjoint paths on edge-colored graphs: Approximability and tractability. Algorithms\u00a06(1), 1\u201311 (2013)","journal-title":"Algorithms"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M.: Parameterized complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"1&2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R. Downey","year":"1995","unstructured":"Downey, R., Fellows, M.: Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science\u00a0141(1&2), 109\u2013131 (1995)","journal-title":"Theoretical Computer Science"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Eriksson, N., Pachter, L., Mitsuya, Y., Rhee, S., Wang, C., Gharizadeh, B., Ronaghi, M., Shafer, R., Beerenwinkel, N.: Viral population estimation using pyrosequencing. PLoS Computational Biology 4(5), e1000074 (2008)","DOI":"10.1371\/journal.pcbi.1000074"},{"key":"10_CR6","first-page":"701","volume":"7","author":"D.R. Fulkerson","year":"1956","unstructured":"Fulkerson, D.R.: Note on Dilworth\u2019s decomposition theorem for partially ordered sets. Proc.\u00a0American Mathematical Society\u00a07, 701\u2013702 (1956)","journal-title":"Proc.\u00a0American Mathematical Society"},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1109\/TSE.1976.233819","volume":"2","author":"H. Gabow","year":"1976","unstructured":"Gabow, H., Maheshwari, S., Osterweil, L.: On two problems in the generation of program test paths. IEEE Trans.on Software Engineering\u00a02(3), 227\u2013231 (1976)","journal-title":"IEEE Trans.on Software Engineering"},{"key":"10_CR8","unstructured":"Garey, M., Johnson, D.: Computer and intractability: A guide to the theory of NP-completeness. W. H. Freeman (1979)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Univ. Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"5","key":"10_CR10","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1109\/TSE.1979.234213","volume":"5","author":"S. Ntafos","year":"1979","unstructured":"Ntafos, S., Hakimi, S.: On path cover problems in digraphs and applications to program testing. IEEE Trans.\u00a0on Software Engineering\u00a05(5), 520\u2013529 (1979)","journal-title":"IEEE Trans.\u00a0on Software Engineering"},{"issue":"5","key":"10_CR11","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1038\/nbt.1621","volume":"28","author":"C. Trapnell","year":"2010","unstructured":"Trapnell, C., Williams, B., Pertea, G., Mortazavi, A., Kwan, G., van Baren, M., Salzberg, S., Wold, B., Pachter, L.: Transcript assembly and quantification by RNA-Seq reveals unannotated transcripts and isoform switching during cell differentiation. Nature Biotechnology\u00a028(5), 516\u2013520 (2010)","journal-title":"Nature Biotechnology"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.disopt.2012.01.002","volume":"9","author":"B.Y. Wu","year":"2012","unstructured":"Wu, B.Y.: On the maximum disjoint paths problem on edge-colored graphs. Discrete Optimization\u00a09(1), 50\u201357 (2012)","journal-title":"Discrete Optimization"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04921-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T01:59:58Z","timestamp":1558835998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04921-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319049205","9783319049212"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04921-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}