{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:07:47Z","timestamp":1725538067010},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034084"},{"type":"electronic","value":"9783642034091"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03409-1_11","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:05:18Z","timestamp":1252937118000},"page":"109-120","source":"Crossref","is-referenced-by-count":0,"title":["The Longest Haplotype Reconstruction Problem Revisited"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Dondi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-Coding. Journal of the ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"Journal of the ACM"},{"issue":"1-2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-Completeness Results for Cubic Graphs. Theoretical Computer Science\u00a0237(1-2), 123\u2013134 (2000)","journal-title":"Theoretical Computer Science"},{"key":"11_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/BF02945456","volume":"18","author":"P. Bonizzoni","year":"2003","unstructured":"Bonizzoni, P., Della Vedova, G., Dondi, R., Li, J.: The Haplotyping Problem: an Overview of Computational Models and Solutions. Journal of Computer and Science Technology\u00a018, 675\u2013688 (2003)","journal-title":"Journal of Computer and Science Technology"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s00453-007-0029-z","volume":"49","author":"R. Cilibrasi","year":"2007","unstructured":"Cilibrasi, R., van Iersel, L., Kelk, S., Tromp, J.: The Complexity of the Single Individual SNP Haplotyping Problem. Algorithmica\u00a049(1), 13\u201336 (2007)","journal-title":"Algorithmica"},{"key":"11_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1287\/ijoc.1040.0073","volume":"16","author":"H.J. Greenberg","year":"2004","unstructured":"Greenberg, H.J., Hart, W.E., Lancia, G.: Opportunities for Combinatorial Optimization in Computational Biology. INFORMS Journal on Computing\u00a016(3), 211\u2013231 (2004)","journal-title":"INFORMS Journal on Computing"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0166-218X(96)00062-5","volume":"71","author":"J. Hein","year":"1996","unstructured":"Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of Comparing Evolutionary Trees. Discrete Applied Mathematics\u00a071, 153\u2013169 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/S009753979223842X","volume":"24","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Li, M.: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences. SIAM J. Comput.\u00a024, 1122\u20131139 (1995)","journal-title":"SIAM J. Comput."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/S009753979223842X","volume":"24","author":"D. Karger","year":"1995","unstructured":"Karger, D., Motwani, R., Ramkumar, G.D.S.: On Approximating the Longest Path in a Graph. SIAM J. Comput.\u00a024, 1122\u20131139 (1995)","journal-title":"SIAM J. Comput."},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/3-540-44676-1_15","volume-title":"Algorithms - ESA 2001","author":"G. Lancia","year":"2001","unstructured":"Lancia, G., Bafna, V., Istrail, S., Lippert, R., Schwartz, R.: SNPs Problems, Complexity and Algorithms. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 182\u2013193. Springer, Heidelberg (2001)"},{"key":"11_CR12","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/800133.804350","volume-title":"Tenth Annual ACM Symposium on Theory of Computing (STOC)","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: The Complexity of Satisfiability Problems. In: Tenth Annual ACM Symposium on Theory of Computing (STOC), pp. 216\u2013226. ACM Press, New York (1978)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03409-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T19:20:58Z","timestamp":1552159258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03409-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034084","9783642034091"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03409-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}