{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:50:39Z","timestamp":1742395839535},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212598"},{"type":"electronic","value":"9783642212604"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21260-4_29","type":"book-chapter","created":{"date-parts":[[2011,4,29]],"date-time":"2011-04-29T00:26:59Z","timestamp":1304036819000},"page":"297-305","source":"Crossref","is-referenced-by-count":7,"title":["A Polynomial Algebra Method for Computing Exemplar Breakpoint Distance"],"prefix":"10.1007","author":[{"given":"Bin","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louxin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-74960-8_2","volume-title":"Comparative Genomics","author":"S. Angibaud","year":"2007","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Th\u00e9venin, A., Vialette, S.: A pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes. In: Tesler, G., Durand, D. (eds.) RECMOB-CG 2007. LNCS (LNBI), vol.\u00a04751, pp. 16\u201329. Springer, Heidelberg (2007)"},{"key":"29_CR2","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Th\u00e9venin, A., Vialette, S.: On the ap-proximability of comparing genomes with duplicates. J. Graph Algor. Appli. (accepted)"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1109\/TCBB.2007.1069","volume":"4","author":"G. Blin","year":"2007","unstructured":"Blin, G., Chauve, C., Fertin, G., Rizzi, R., Vialette, S.: Comparing genomes with duplications: A computational complexity point of view. IEEE\/ACM IEEE Trans. Comput. Biol. Bioinform.\u00a04, 523\u2013534 (2007)","journal-title":"IEEE\/ACM IEEE Trans. Comput. Biol. Bioinform."},{"key":"29_CR4","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 breakpoint 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":"29_CR5","unstructured":"Bryant, D.: The complexity of calculating exemplar distance. 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 (2000)"},{"key":"29_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.: Approximations for 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":"29_CR7","unstructured":"Chen, Z., Fu, B.: Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials, Electronic Colloquium on Computational Complexity (ECCC-TR10-124)"},{"key":"29_CR8","unstructured":"Chen, Z., Fu, B.: The Complexity of Testing Monomials in Multivariate Polynomials, Electronic Colloquium on Computational Complexity (ECCC-TR10-114)"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1126\/science.1086132","volume":"301","author":"E.E. Eichler","year":"2003","unstructured":"Eichler, E.E., Sankoff, D.: Structural dynamics of eukaryotic chromosome evolution. Science\u00a0301, 793\u2013797 (2003)","journal-title":"Science"},{"key":"29_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. Assoc. Comput. Mach.\u00a046, 1\u201327 (1999)","journal-title":"J. Assoc. Comput. Mach."},{"key":"29_CR11","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)"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70575-8_47","volume-title":"Automata, Languages and Programming","author":"I. Koutis","year":"2008","unstructured":"Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 575\u2013586. Springer, Heidelberg (2008)"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1073\/pnas.81.3.814","volume":"81","author":"J.H. Nadeau","year":"1984","unstructured":"Nadeau, J.H., Taylor, B.A.: Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Natl. Acad. Sci. USA\u00a081, 814\u2013818 (1984)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"29_CR14","unstructured":"Nguyen, C.T.: Algorithms for calculating exemplar distances. Honors Thesis, Department of Computer Science, National University of Singapore (2005)"},{"key":"29_CR15","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.X.: Divide-and-conquer approach for the examplar breakpoint problem. Bioinformatics\u00a021, 2171\u20132176 (2005)","journal-title":"Bioinformatics"},{"key":"29_CR16","first-page":"461","volume":"47","author":"D. Sankoff","year":"1989","unstructured":"Sankoff, D.: Mechanisms of genome evolution: models and inference. Bull. Int. Stat. Institut.\u00a047, 461\u2013475 (1989)","journal-title":"Bull. Int. Stat. Institut."},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1093\/bioinformatics\/15.11.909","volume":"15","author":"D. Sankoff","year":"2009","unstructured":"Sankoff, D.: Genome rearrangement with gene families. Bioinformatics\u00a015, 909\u2013917 (2009)","journal-title":"Bioinformatics"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ipl.2008.11.004","volume":"109","author":"R. Williams","year":"2009","unstructured":"Williams, R.: Finding paths of length k in o\n                        *(2\n                  k\n                ) time. Information Processing Letters\u00a0109, 315\u2013318 (2009)","journal-title":"Information Processing Letters"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-5193(82)90384-8","volume":"99","author":"G.A. Watterson","year":"1982","unstructured":"Watterson, G.A., Ewens, W.J., Hall, T.E., Morgan, A.: The chromosome inversion problem. J. Theor. Biol.\u00a099, 1\u20137 (1982)","journal-title":"J. Theor. Biol."}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21260-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:42:57Z","timestamp":1558575777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21260-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212598","9783642212604"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21260-4_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}