{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:53Z","timestamp":1759638473439},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45995-2_10","type":"book-chapter","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T22:33:34Z","timestamp":1180478014000},"page":"52-63","source":"Crossref","is-referenced-by-count":8,"title":["An Algorithm That Builds a Set of Strings Given Its Overlap Graph"],"prefix":"10.1007","author":[{"given":"Mar\u00edlia D. V.","family":"Braga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00e3o","family":"Meidanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"10_CR1","unstructured":"M. D. V. Braga. Grafos de Seq\u00fc\u00eancias de DNA. Master\u2019s thesis, Instituto de Computa\u00e7\u00e3o, UNICAMP, Campinas, SP, November 2000. In Portuguese at \n                    http:\/\/www.ic.unicamp.br\n                    \n                  \/~meidanis\/research\/fa.html."},{"key":"10_CR2","volume-title":"Graph Theory","author":"R. Diestel","year":"1997","unstructured":"R. Diestel. Graph Theory. Springer-Verlag New York, Inc, 1997."},{"key":"10_CR3","unstructured":"C. E. Ferreira, C. C. de Souza, and Y. Wakabayashi. Rearrangement of DNA fragments: a branch-and-cut algorithm. Discrete Applied Mathematics, 2001. To appear."},{"issue":"4","key":"10_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(92)90176-V","volume":"41","author":"D. Gusfield","year":"1992","unstructured":"D. Gusfield, G. M. Landau, and B. Schieber. An efficient algorithm for the all pairs suffix-prefix problem. Information Processing Letters, 41(4):181\u2013185, March 1992.","journal-title":"Information Processing Letters"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1137\/S0097539796299266","volume":"28","author":"A. Schrijver","year":"1998","unstructured":"A. Schrijver. Bipartite edge coloring in O(\u0394m) time. SIAM Journal on Computing, 28(3):841\u2013846, 1998.","journal-title":"SIAM Journal on Computing"},{"key":"10_CR6","unstructured":"J. C. Setubal and J. Meidanis. Introduction to Computational Molecular Biology. PWS Publishing Company, 1997."}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T19:56:01Z","timestamp":1550346961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}