{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:19Z","timestamp":1725566299981},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230250"},{"type":"electronic","value":"9783540301400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_12","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:31:13Z","timestamp":1284859873000},"page":"110-121","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithm for Computing DNA Walks"],"prefix":"10.1007","author":[{"given":"Ankur","family":"Bhargava","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Rao","family":"Kosaraju","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","first-page":"399","volume-title":"Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000)","author":"\u00c9. Czabarka","year":"2000","unstructured":"Czabarka, \u00c9., Konjevod, G., Marathe, M.V., Percus, A.G., Torney, D.C.: Algorithms for optimizing production DNA sequencing. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), January 9-11, pp. 399\u2013408. ACM Press, New York (2000)"},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1101\/gr.8.3.195","volume":"8","author":"D. Gordon","year":"1998","unstructured":"Gordon, D., Abajian, C., Green, P.: Consed: A graphical tool for sequence finishing. Genome Research\u00a08, 195\u2013202 (1998)","journal-title":"Genome Research"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1101\/gr.171401","volume":"4","author":"D. Gordon","year":"2001","unstructured":"Gordon, D., Desmarais, C., Green, P.: Automated finishing with autofinish. Genome Research\u00a04, 614\u2013625 (2001)","journal-title":"Genome Research"},{"key":"12_CR4","first-page":"885","volume-title":"Proceedings of the 13th Annual ACMSIAM Symposium On Discrete Algorithms (SODA 2002)","author":"D. Hart","year":"2002","unstructured":"Hart, D.: An optimal (expected time) algorithm for minimizing lab costs in DNA sequencing. In: Proceedings of the 13th Annual ACMSIAM Symposium On Discrete Algorithms (SODA 2002), January 6-8, pp. 885\u2013893. ACM Press, New York (2002)"},{"key":"12_CR5","unstructured":"Human genome project, U.S. department of energy. Human Genome News, 9(3) (July 1998)"},{"key":"12_CR6","unstructured":"Percus, A.G., Torney, D.C.: Greedy algorithms for optimized DNA sequencing. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), N.Y., January 17-19, pp. 955\u2013956. ACM-SIAM (1999)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:52:05Z","timestamp":1620013925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}