{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:42:18Z","timestamp":1725856938469},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319398167"},{"type":"electronic","value":"9783319398174"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-39817-4_15","type":"book-chapter","created":{"date-parts":[[2016,5,26]],"date-time":"2016-05-26T13:15:09Z","timestamp":1464268509000},"page":"145-157","source":"Crossref","is-referenced-by-count":3,"title":["Notes on the $$\\frac{6}{5}$$ -Approximation Algorithm for One-Sided Scaffold Filling"],"prefix":"10.1007","author":[{"given":"Jingjing","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,27]]},"reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"crossref","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 Appl. 13(1), 19\u201353 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 Breakpoint Distance for non-trivial genomes cannot be approximated. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 357\u2013368. Springer, Heidelberg (2009)"},{"unstructured":"Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. In: Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 667\u2013676 (2002)","key":"15_CR3"},{"issue":"2","key":"15_CR4","doi-asserted-by":"crossref","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. Comb. Optim. 15(2), 201\u2013221 (2008)","journal-title":"J. Comb. Optim."},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 4041, pp. 291\u2013302. Springer, Heidelberg (2006)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 3341, pp. 484\u2013495. Springer, Heidelberg (2004)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 6398, pp. 74\u201382. Springer, Heidelberg (2010)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-642-16181-0_8","volume-title":"Comparative Genomics","author":"H Jiang","year":"2010","unstructured":"Jiang, H., Zheng, C., Sankoff, D., Zhu, B.: Scaffold filling under the breakpoint distance. In: Tannier, E. (ed.) RECOMB-CG 2010. LNCS, vol. 6398, pp. 83\u201392. Springer, Heidelberg (2010)"},{"issue":"5","key":"15_CR9","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1145\/585265.585267","volume":"49","author":"DH Huson","year":"2002","unstructured":"Huson, D.H., Reinert, K., Myers, E.W.: The greedy path-merging algorithm for Contig scaffolding. J. ACM 49(5), 603\u2013615 (2002)","journal-title":"J. ACM"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 6661, pp. 55\u201364. Springer, Heidelberg (2011)"},{"issue":"4","key":"15_CR11","doi-asserted-by":"crossref","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. Biol. Bioinform. 9(4), 1220\u20131229 (2012)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"15_CR12","doi-asserted-by":"crossref","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 Bioinform. 11, 304 (2010)","journal-title":"BMC Bioinform."},{"issue":"11","key":"15_CR13","doi-asserted-by":"crossref","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 15(11), 909\u2013917 (1999)","journal-title":"Bioinformatics"},{"issue":"4","key":"15_CR14","first-page":"905","volume":"10","author":"N Liu","year":"2013","unstructured":"Liu, N., Jiang, H., Zhu, D., Zhu, B.: An improved approximation algorithm for scaffold filling to maximize the common adjacencies. IEEE\/ACM TCBB 10(4), 905\u2013913 (2013)","journal-title":"IEEE\/ACM TCBB"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/978-3-642-38236-9_22","volume-title":"Theory and Applications of Models of Computation","author":"N Liu","year":"2013","unstructured":"Liu, N., Zhu, D.: The algorithm for the two-sided scaffold filling problem. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 236\u2013247. Springer, Heidelberg (2013)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/978-3-319-21398-9_20","volume-title":"Computing and Combinatorics","author":"H Jiang","year":"2015","unstructured":"Jiang, H., Ma, J., Luan, J., Zhu, D.: Approximation and nonapproximability for the one-sided scaffold filling problem. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 251\u2013263. Springer, Heidelberg (2015)"},{"doi-asserted-by":"crossref","unstructured":"Caprara, A.: Sorting by reversals is difficult. In: Proceedings of RECOMB 1997, pp. 75\u201383 (1997)","key":"15_CR17","DOI":"10.1145\/267521.267531"},{"issue":"1\u20133","key":"15_CR18","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.tcs.2005.09.078","volume":"352","author":"D Zhu","year":"2006","unstructured":"Zhu, D., Wang, L.: On the complexity of unsigned translocation distance. Theor. Comput. Sci 352(1\u20133), 322\u2013328 (2006)","journal-title":"Theor. Comput. Sci"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39817-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T15:06:01Z","timestamp":1498316761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39817-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319398167","9783319398174"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39817-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}