{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T20:47:21Z","timestamp":1784062041932,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540741251","type":"print"},{"value":"9783540741268","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74126-8_27","type":"book-chapter","created":{"date-parts":[[2007,8,23]],"date-time":"2007-08-23T15:37:50Z","timestamp":1187883470000},"page":"289-301","source":"Crossref","is-referenced-by-count":90,"title":["Computability of Models for Sequence Assembly"],"prefix":"10.1007","author":[{"given":"Paul","family":"Medvedev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Konstantinos","family":"Georgiou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gene","family":"Myers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Brudno","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Edmonds, J.: An introduction to matching. Notes of engineering summer conference, University of Michigan, Ann Arbor (1967)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.L.: Matching, Euler tours, and the Chinese postman. Mathemetical Programming\u00a05, 88\u2013124 (1973)","journal-title":"Mathemetical Programming"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: STOC, pp. 448\u2013456 (1983)","DOI":"10.1145\/800061.808776"},{"issue":"1","key":"27_CR4","doi-asserted-by":"publisher","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.\u00a020(1), 50\u201358 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"1\/2","key":"27_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01188580","volume":"13","author":"J.D. Kececioglu","year":"1995","unstructured":"Kececioglu, J.D., Myers, E.W.: Combinatiorial algorithms for DNA sequence assembly. Algorithmica\u00a013(1\/2), 7\u201351 (1995)","journal-title":"Algorithmica"},{"issue":"1\/2","key":"27_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01188586","volume":"13","author":"J.D. Kececioglu","year":"1995","unstructured":"Kececioglu, J.D., Sankoff, D.: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica\u00a013(1\/2), 180\u2013210 (1995)","journal-title":"Algorithmica"},{"key":"27_CR8","unstructured":"Kececioglu, J.D.: Exact and approximation algorithms for DNA sequence reconstruction. PhD thesis, Tucson, AZ, USA (1992)"},{"issue":"2","key":"27_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1089\/cmb.1995.2.275","volume":"2","author":"E.W. Myers","year":"1995","unstructured":"Myers, E.W.: Toward simplifying and accurately formulating fragment assembly. Journal of Computational Biology\u00a02(2), 275\u2013290 (1995)","journal-title":"Journal of Computational Biology"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Myers, E.W.: The fragment assembly string graph. In: ECCB\/JBI, p. 85 (2005)","DOI":"10.1093\/bioinformatics\/bti1114"},{"issue":"1","key":"27_CR11","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/07391102.1989.10507752","volume":"7","author":"P.A. Pevzner","year":"1989","unstructured":"Pevzner, P.A.: 1-Tuple DNA sequencing: computer analysis. J. Biomol. Struct. Dyn.\u00a07(1), 63\u201373 (1989)","journal-title":"J. Biomol. Struct. Dyn."},{"issue":"17","key":"27_CR12","doi-asserted-by":"crossref","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"P. A. Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An Eulerian path approach to DNA fragment assembly. In: Proceedings of the National Academy of Sciences, vol.\u00a098, pp. 9748\u20139753 (2001)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Pevzner, P.A., Tang, H., Tesler, G.: De novo repeat classification and fragment assembly. In: RECOMB, pp. 213\u2013222 (2004)","DOI":"10.1145\/974614.974643"},{"key":"27_CR14","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization, vol.\u00a0A. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74126-8_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:11:34Z","timestamp":1619518294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74126-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741251","9783540741268"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74126-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}