{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:21:33Z","timestamp":1743096093275,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319949673"},{"type":"electronic","value":"9783319949680"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94968-0_27","type":"book-chapter","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T14:13:51Z","timestamp":1531404831000},"page":"275-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Approaching the One-Sided Exemplar Adjacency Number Problem"],"prefix":"10.1007","author":[{"given":"Letu","family":"Qingge","sequence":"first","affiliation":[]},{"given":"Killian","family":"Smith","sequence":"additional","affiliation":[]},{"given":"Sean","family":"Jungst","sequence":"additional","affiliation":[]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,13]]},"reference":[{"issue":"4","key":"27_CR1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1089\/cmb.2007.A001","volume":"14","author":"S Angibaud","year":"2007","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Vialette, S.: A pseudo-boolean framework for computing rearrangement distances between genomes with duplicates. J. Comput. Biol. 14(4), 379\u2013393 (2007)","journal-title":"J. Comput. Biol."},{"key":"27_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 ExemplarBreakpointDistance for non-trivial genomes cannot be approximated. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 357\u2013368. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-00202-1_31"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-94-011-4309-7_19","volume-title":"Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families","author":"D Bryant","year":"2000","unstructured":"Bryant, D.: The complexity of calculating exemplar distances. In: Sankoff, D., Nadeau, J. (eds.) Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, pp. 207\u2013212. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"27_CR4","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. 4041, pp. 291\u2013302. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11775096_27"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-73437-6_14","volume-title":"Combinatorial Pattern Matching","author":"Z Chen","year":"2007","unstructured":"Chen, Z., et al.: Non-breaking similarity of genomes with gene repetitions. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 119\u2013130. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-73437-6_14"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2014.07.011","volume":"550","author":"Z Chen","year":"2014","unstructured":"Chen, Z., Fu, B., Goebel, R., Lin, G., Tong, W., Xu, J., Yang, B., Zhao, Z., Zhu, B.: On the approximability of the exemplar adjacency number problem of genomes with gene repetitions. Theor. Comput. Sci. 550, 59\u201365 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput. 1, 180\u2013187 (1972)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"27_CR8","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1089\/cmb.2011.0097","volume":"18","author":"M Jiang","year":"2011","unstructured":"Jiang, M.: The zero exemplar distance problem. J. Comput. Biol. 18(9), 1077\u20131086 (2011)","journal-title":"J. Comput. Biol."},{"issue":"10","key":"27_CR9","doi-asserted-by":"publisher","first-page":"2171","DOI":"10.1093\/bioinformatics\/bti327","volume":"21","author":"CT Nguyen","year":"2005","unstructured":"Nguyen, C.T., Tay, Y.C., Zhang, L.: Divide-and-conquer approach for the exemplar breakpoint distance. Bioinformatics 21(10), 2171\u20132176 (2005)","journal-title":"Bioinformatics"},{"issue":"11","key":"27_CR10","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 15(11), 909\u2013917 (1999)","journal-title":"Bioinformatics"},{"issue":"5","key":"27_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1089\/cmb.2015.0193","volume":"23","author":"M Shao","year":"2016","unstructured":"Shao, M., Moret, B.: A fast and exact algorithm for the exemplar breakpoint distance. J. Comput. Biol. 23(5), 337\u2013346 (2016)","journal-title":"J. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94968-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T15:10:13Z","timestamp":1573744213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94968-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319949673","9783319949680"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94968-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISBRA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Bioinformatics Research and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isbra2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/alan.cs.gsu.edu\/isbra18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}