{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:09:02Z","timestamp":1773277742731,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540343813","type":"print"},{"value":"9783540343820","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758525_105","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T15:03:32Z","timestamp":1147359812000},"page":"783-790","source":"Crossref","is-referenced-by-count":14,"title":["Genomes Containing Duplicates Are Hard to Compare"],"prefix":"10.1007","author":[{"given":"Cedric","family":"Chauve","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"105_CR1","unstructured":"Blin, G., Chauve, C., Fertin, G.: The breakpoint distance for signed sequences. In: 1st Int. Conference on Algorithms and Computational Methods for Biochemical and Evolutionary Networks, CompBioNets 2004. Texts in Algorithms, vol.\u00a03, pp. 3\u201316. KCL Publications (2004)"},{"key":"105_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11533719_5","volume-title":"Computing and Combinatorics","author":"G. Blin","year":"2005","unstructured":"Blin, G., Rizzi, R.: Conserved interval distance computation between non-trivial genomes. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 22\u201331. Springer, Heidelberg (2005)"},{"key":"105_CR3","doi-asserted-by":"crossref","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 Acad. Pub., Dordrecht (2000)","DOI":"10.1007\/978-94-011-4309-7_19"},{"issue":"4","key":"105_CR4","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TCBB.2005.48","volume":"2","author":"X. Chen","year":"2005","unstructured":"Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement. IEEE\/ACM Trans. on Comp. Biology and Bioinformatics\u00a02(4), 302\u2013315 (2005)","journal-title":"IEEE\/ACM Trans. on Comp. Biology and Bioinformatics"},{"key":"105_CR5","volume-title":"Computers and Intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: a guide to the theory of NP-completeness. W.H. Freeman, San Franciso (1979)"},{"issue":"11","key":"105_CR6","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"},{"issue":"6","key":"105_CR7","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1016\/S0959-437X(00)00253-7","volume":"11","author":"D. Sankoff","year":"2001","unstructured":"Sankoff, D.: Gene and genome duplication. Curr. Opin. Genet. Dev.\u00a011(6), 681\u2013684 (2001)","journal-title":"Curr. Opin. Genet. Dev."},{"key":"105_CR8","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/11554714_11","volume-title":"Comparative Genomics","author":"D. Sankoff","year":"2005","unstructured":"Sankoff, D., Haque, L.: Power boosts for cluster tests. In: McLysaght, A., Huson, D.H. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03678, pp. 121\u2013130. Springer, Heidelberg (2005)"},{"key":"105_CR9","unstructured":"Cam Thach, N.: Algorithms for calculating exemplar distances. Honours Year Project Report, National University of Singapore (2005)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758525_105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T18:58:14Z","timestamp":1553367494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758525_105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343813","9783540343820"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11758525_105","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}