{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:26:52Z","timestamp":1743121612733,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382352"},{"type":"electronic","value":"9783642382369"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38236-9_22","type":"book-chapter","created":{"date-parts":[[2013,4,15]],"date-time":"2013-04-15T02:38:02Z","timestamp":1365993482000},"page":"236-247","source":"Crossref","is-referenced-by-count":3,"title":["The Algorithm for the Two-Sided Scaffold Filling Problem"],"prefix":"10.1007","author":[{"given":"Nan","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daming","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.7155\/jgaa.00175","volume":"13","author":"S. Angibaud","year":"2009","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Thevenin, A., Vialette, S.: On the approximability of comparing genomes with duplicates. J. Graph Algorithms and Applications\u00a013(1), 19\u201353 (2009)","journal-title":"J. Graph Algorithms and Applications"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-642-00202-1_31","volume-title":"WALCOM: Algorithms and Computation","author":"G. Blin","year":"2009","unstructured":"Blin, G., Fertin, G., Sikora, F., Vialette, S.: The exemplar\n                        breakpoint\n                        distance for non-trivial genomes cannot be approximated. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol.\u00a05431, pp. 357\u2013368. Springer, Heidelberg (2009)"},{"key":"22_CR3","unstructured":"Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. In: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA 2002), pp. 667\u2013676 (2002)"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10878-007-9077-1","volume":"15","author":"Z. Chen","year":"2008","unstructured":"Chen, Z., Fowler, R., Fu, B., Zhu, B.: On the inapproximability of the exemplar conserved interval distance problem of genomes. J. Combinatorial Optimization\u00a015(2), 201\u2013221 (2008)","journal-title":"J. Combinatorial Optimization"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/11775096_27","volume-title":"Algorithmic Aspects in Information and Management","author":"Z. Chen","year":"2006","unstructured":"Chen, Z., Fu, B., Zhu, B.: The approximability of the exemplar breakpoint distance problem. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol.\u00a04041, pp. 291\u2013302. Springer, Heidelberg (2006)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-30551-4_43","volume-title":"Algorithms and Computation","author":"A. Goldstein","year":"2004","unstructured":"Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partition problem: Hardness and approximations. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 484\u2013495. Springer, Heidelberg (2004); also in: The Electronic Journal of Combinatorics 12 (2005), paper R50"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-16181-0_7","volume-title":"Comparative Genomics","author":"M. Jiang","year":"2010","unstructured":"Jiang, M.: The zero exemplar distance problem. In: Tannier, E. (ed.) RECOMB-CG 2010. LNCS, vol.\u00a06398, pp. 74\u201382. Springer, Heidelberg (2010)"},{"issue":"4","key":"22_CR8","doi-asserted-by":"publisher","first-page":"1220","DOI":"10.1109\/TCBB.2012.57","volume":"9","author":"H. Jiang","year":"2012","unstructured":"Jiang, H., Zheng, C., Sankoff, D., Zhu, B.: Scaffold Filling under the Breakpoint and Related Distances. IEEE\/ACM Trans. Comput. Biology Bioinform.\u00a09(4), 1220\u20131229 (2012)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-21458-5_7","volume-title":"Combinatorial Pattern Matching","author":"H. Jiang","year":"2011","unstructured":"Jiang, H., Zhong, F., Zhu, B.: Filling scaffolds with gene repetitions: maximizing the number of adjacencies. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 55\u201364. Springer, Heidelberg (2011)"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1186\/1471-2105-11-304","volume":"11","author":"A. Mu\u00f1oz","year":"2010","unstructured":"Mu\u00f1oz, A., Zheng, C., Zhu, Q., Albert, V., Rounsley, S., Sankoff, D.: Scaffold filling, contig fusion and gene order comparison. BMC Bioinformatics\u00a011, 304 (2010)","journal-title":"BMC Bioinformatics"},{"issue":"11","key":"22_CR11","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1093\/bioinformatics\/15.11.909","volume":"15","author":"D. Sankoff","year":"1999","unstructured":"Sankoff, D.: Genome rearrangement with gene families. Bioinformatics\u00a015(11), 909\u2013917 (1999)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38236-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T16:09:42Z","timestamp":1676304582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38236-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382352","9783642382369"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38236-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}