{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:32Z","timestamp":1759638092589},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734369"},{"type":"electronic","value":"9783540734376"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-73437-6_14","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T17:36:44Z","timestamp":1187026604000},"page":"119-130","source":"Crossref","is-referenced-by-count":19,"title":["Non-breaking Similarity of Genomes with Gene Repetitions"],"prefix":"10.1007","author":[{"given":"Zhixiang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Bin","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Boting","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Zhiyu","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","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 Acad. Pub. Boston, MA (2000)"},{"key":"14_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":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/11809678_27","volume-title":"Computing and Combinatorics","author":"Z. Chen","year":"2006","unstructured":"Chen, Z., Fu, B., Fowler, R., Zhu, B.: Lower bounds on the application of the exemplar conserved interval distance problem of genomes. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol.\u00a04112, pp. 245\u2013254. Springer, Heidelberg (2006)"},{"key":"14_CR4","unstructured":"Chen, Z., Fu, B., Fowler, R., Zhu, B.: On the inapproximability of the exemplar conserved interval distance problem of genomes. J. Combinatorial Optimization (to appear)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Chauve, C., Fertin, G., Rizzi, R., Vialette, S.: Genomes containing duplicates are hard to compare. In: Proc. 2nd Intl. Workshop on Bioinformatics Research and Applications (IWBRA 2006), LNCS 3992, pp. 783\u2013790 (2006)","DOI":"10.1007\/11758525_105"},{"key":"14_CR6","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":"14_CR7","doi-asserted-by":"crossref","unstructured":"Chen, J., Huang, X., Kanj, I., Xia, G.: Linear FPT reductions and computational lower bounds. In: Proc. 36th ACM Symp. on Theory Comput. (STOC 2004), pp. 212\u2013221 (2004)","DOI":"10.1145\/1007352.1007391"},{"key":"14_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e4stad","year":"1999","unstructured":"H\u00e4stad, J.: Clique is hard to approximate within n\n                  1\u2009\u2212\u2009\u03b5\n                  . Acta. Mathematica,\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Mathematica,"},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S. Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM,\u00a046(1), 1\u201327 (1999)","journal-title":"J. ACM,"},{"volume-title":"Mathematics of Evolution and Phylogeny","year":"2004","key":"14_CR11","unstructured":"Gascuel, O. (ed.): Mathematics of Evolution and Phylogeny. Oxford University Press, Oxford, UK (2004)"},{"issue":"10","key":"14_CR12","doi-asserted-by":"publisher","first-page":"2171","DOI":"10.1093\/bioinformatics\/bti327","volume":"21","author":"C.T. Nguyen","year":"2005","unstructured":"Nguyen, C.T., Tay, Y.C., Zhang, L.: Divide-and-conquer approach for the exemplar breakpoint distance. Bioinformatics\u00a021(10), 2171\u20132176 (2005)","journal-title":"Bioinformatics"},{"issue":"11","key":"14_CR13","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1093\/bioinformatics\/15.11.909","volume":"16","author":"D. Sankoff","year":"1999","unstructured":"Sankoff, D.: Genome rearrangement with gene families. Bioinformatics\u00a016(11), 909\u2013917 (1999)","journal-title":"Bioinformatics"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Sturtevant, A., Dobzhansky, T.: Inversions in the third chromosome of wild races of drosophila pseudoobscura, and their use in the study of the history of the species. In: Proc. Nat. Acad. Sci. USA, vol. 22 pp. 448\u2013450 (1936)","DOI":"10.1073\/pnas.22.7.448"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-5193(82)90384-8","volume":"99","author":"G. Watterson","year":"1982","unstructured":"Watterson, G., Ewens, W., Hall, T., Morgan, A.: The chromosome inversion problem. J. Theoretical Biology\u00a099, 1\u20137 (1982)","journal-title":"J. Theoretical Biology"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73437-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T01:00:54Z","timestamp":1558486854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73437-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540734369","9783540734376"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73437-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}