{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:58:26Z","timestamp":1743008306340,"version":"3.40.3"},"publisher-location":"London","reference-count":67,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781447152972"},{"type":"electronic","value":"9781447152989"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-1-4471-5298-9_13","type":"book-chapter","created":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T09:20:12Z","timestamp":1379409612000},"page":"287-307","source":"Crossref","is-referenced-by-count":13,"title":["The Potential of Family-Free Genome Comparison"],"prefix":"10.1007","author":[{"given":"Mar\u00edlia D. V.","family":"Braga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cedric","family":"Chauve","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Doerr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katharina","family":"Jahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annelyse","family":"Th\u00e9venin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Wittler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1089\/cmb.2008.0061","volume":"15","author":"S. Angibaud","year":"2008","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Th\u00e9venin, A., Vialette, S.: Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate genes. J. Comput. Biol. 15(8), 1093\u20131115 (2008)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.7155\/jgaa.00175","volume":"13","author":"S. Angibaud","year":"2009","unstructured":"Angibaud, S., Fertin, G., Rusu, I., Th\u00e9venin, 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."},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1038\/75556","volume":"25","author":"M. Ashburner","year":"2000","unstructured":"Ashburner, M., Ball, C.A., Blake, J.A., Botstein, D., Butler, H., Cherry, J.M., Davis, A.P., Dolinski, K., Dwight, S.S., Eppig, J.T., Harris, M.A., Hill, D.P., Issel-Tarver, L., Kasarskis, A., Lewis, S., Matese, J.C., Richardson, J.E., Ringwald, M., Rubin, G.M., Sherlock, G.: Gene ontology: tool for the unification of biology. the gene ontology consortium. Nat. Genet. 25(1), 25\u201329 (2000)","journal-title":"Nat. Genet."},{"issue":"7","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1089\/cmb.2006.13.1340","volume":"13","author":"A. Bergeron","year":"2006","unstructured":"Bergeron, A., Stoye, J.: On the similarity of sets of permutations and its applications to genome comparison. J. Comput. Biol. 13(7), 1340\u20131354 (2006)","journal-title":"J. Comput. Biol."},{"key":"13_CR5","series-title":"LNCS","first-page":"464","volume-title":"Proceedings of WABI 2002","author":"A. Bergeron","year":"2002","unstructured":"Bergeron, A., Corteel, S., Raffinot, M.: The algorithmic of gene teams. In: Proceedings of WABI 2002. LNCS, vol. 2452, pp. 464\u2013476 (2002)"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1089\/cmb.2006.13.567","volume":"13","author":"A. Bergeron","year":"2006","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: On sorting by translocations. J. Comput. Biol. 13(2), 567\u2013578 (2006)","journal-title":"J. Comput. Biol."},{"key":"13_CR7","series-title":"LNBI","first-page":"163","volume-title":"Proceedings of WABI 2006","author":"A. Bergeron","year":"2006","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Proceedings of WABI 2006. LNBI, vol. 4175, pp. 163\u2013173 (2006)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1109\/TCBB.2008.39","volume":"5","author":"M. Bernt","year":"2008","unstructured":"Bernt, M., Merkle, D., Middendorf, M.: Solving the preserving reversal median problem. IEEE\/ACM Trans. Comput. Biol. Bioinform. 5, 332\u2013347 (2008)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"13_CR9","series-title":"Texts in Algorithmics","first-page":"3","volume-title":"Proceedings of CompBioNets 2004","author":"G. Blin","year":"2004","unstructured":"Blin, G., Chauve, C., Fertin, G.: The breakpoint distance for signed sequences. In: Proceedings of CompBioNets 2004. Texts in Algorithmics, vol. 3, pp. 3\u201316 (2004)"},{"key":"13_CR10","first-page":"24","volume-title":"Proceedings of RECOMB-CG 2006","author":"G. Blin","year":"2006","unstructured":"Blin, G., Chateau, A., Chauve, C., Gingras, Y.: Inferring positional homologs with common intervals of sequences. In: Proceedings of RECOMB-CG 2006, pp. 24\u201338. Springer, Berlin (2006)"},{"issue":"4","key":"13_CR11","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 Trans. Comput. Biol. Bioinform. 4(4), 523\u2013534 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"8","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1089\/cmb.2009.0098","volume":"16","author":"S. B\u00f6cker","year":"2009","unstructured":"B\u00f6cker, S., Jahn, K., Mixtacki, J., Stoye, J.: Computation of median gene clusters. J. Comput. Biol. 16(8), 1085\u20131099 (2009)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"13_CR13","first-page":"26","volume":"12","author":"G. Bourque","year":"2002","unstructured":"Bourque, G., Pevzner, P.A.: Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Res. 12(1), 26\u201336 (2002)","journal-title":"Genome Res."},{"issue":"9","key":"13_CR14","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1089\/cmb.2011.0118","volume":"18","author":"M.D.V. Braga","year":"2011","unstructured":"Braga, M.D.V., Willing, E., Stoye, J.: Double cut and join with insertions and deletions. J.\u00a0Comput. Biol. 18(9), 1167\u20131184 (2011)","journal-title":"J.\u00a0Comput. Biol."},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/ijoc.15.1.93.15155","volume":"15","author":"A. Caprara","year":"2003","unstructured":"Caprara, A.: The reversal median problem. INFORMS J. Comput. 15(1), 93\u2013113 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"11","key":"13_CR16","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1000234","volume":"4","author":"C. Chauve","year":"2008","unstructured":"Chauve, C., Tannier, E.: A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genomes. PLoS Comput. Biol. 4(11), e1000234 (2008)","journal-title":"PLoS Comput. Biol."},{"key":"13_CR17","series-title":"Computational Biology","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5298-9","volume-title":"Models and Algorithms for Genome Evolution","author":"C. Chauve","year":"2013","unstructured":"Chauve, C., El-Mabrouk, N., Gu\u00e9guen, L., Semeria, M., Tannier, E.: Duplication, rearrangement and reconciliation: a follow-up 13 years later. In: Chauve, C. et al. (eds.) Models and Algorithms for Genome Evolution. Computational Biology, vol. 19. Springer, Berlin (2013). In\u00a0this volume"},{"issue":"15","key":"13_CR18","doi-asserted-by":"publisher","first-page":"1910","DOI":"10.1093\/bioinformatics\/btq315","volume":"26","author":"M. Csur\u00f6s","year":"2010","unstructured":"Csur\u00f6s, M.: Count: evolutionary analysis of phylogenetic profiles with parsimony and likelihood. Bioinformatics 26(15), 1910\u20131912 (2010)","journal-title":"Bioinformatics"},{"issue":"6","key":"13_CR19","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0011147","volume":"5","author":"A.E. Darling","year":"2010","unstructured":"Darling, A.E., Mau, B., Perna, N.T.: ProgressiveMauve: multiple genome alignment with gene gain, loss and rearrangement. PLoS ONE 5(6), e11147 (2010)","journal-title":"PLoS ONE"},{"issue":"5","key":"13_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1093\/bib\/bbr040","volume":"12","author":"C.N. Dewey","year":"2011","unstructured":"Dewey, C.N.: Positional orthology: putting genomic evolutionary relationships into context. Brief. Bioinform. 12(5), 401\u2013412 (2011)","journal-title":"Brief. Bioinform."},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.jda.2006.03.021","volume":"5","author":"G. Didier","year":"2007","unstructured":"Didier, G., Schmidt, T., Stoye, J., Tsur, D.: Character sets of strings. J. Discrete Algorithms 5(2), 330\u2013340 (2007)","journal-title":"J. Discrete Algorithms"},{"issue":"Suppl 19","key":"13_CR22","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-13-S19-S3","volume":"13","author":"D. Doerr","year":"2012","unstructured":"Doerr, D., Th\u00e9venin, A., Stoye, J.: Gene family assignment-free comparative genomics. BMC Bioinform. 13(Suppl 19), S3 (2012)","journal-title":"BMC Bioinform."},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1089\/10665270360688129","volume":"10","author":"D. Durand","year":"2003","unstructured":"Durand, D., Sankoff, D.: Tests for gene clustering. J. Comput. Biol. 10, 453\u2013482 (2003)","journal-title":"J. Comput. Biol."},{"key":"13_CR24","series-title":"LNCS","first-page":"1","volume-title":"Proceedings of WABI 2004","author":"J.V. Earnest-DeYoung","year":"2004","unstructured":"Earnest-DeYoung, J.V., Lerat, E., Moret, B.M.E.: Reversing gene erosion\u2014reconstructing ancestral bacterial genomes from gene-content and order data. In: Proceedings of WABI 2004. LNCS, vol. 3240, pp. 1\u201313 (2004)"},{"issue":"1","key":"13_CR25","first-page":"105","volume":"1","author":"N. El-Mabrouk","year":"2001","unstructured":"El-Mabrouk, N.: Sorting signed permutations by reversals and insertions\/deletions of contiguous segments. J. Discrete Algorithms 1(1), 105\u2013122 (2001)","journal-title":"J. Discrete Algorithms"},{"issue":"5","key":"13_CR26","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1109\/TCBB.2011.34","volume":"8","author":"P. Feij\u00e3o","year":"2011","unstructured":"Feij\u00e3o, P., Meidanis, J.: SCJ: a breakpoint-like distance that simplifies several rearrangement problems. IEEE\/ACM Trans. Comput. Biol. Bioinform. 8(5), 1318\u20131329 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"13_CR27","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262062824.001.0001","volume-title":"Combinatorics of Genome Rearrangements","author":"G. Fertin","year":"2009","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. MIT Press, Cambridge (2009)"},{"issue":"10","key":"13_CR28","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0013409","volume":"5","author":"C. Frech","year":"2010","unstructured":"Frech, C., Chen, N.: Genome-wide comparative gene family classification. PLoS ONE 5(10), e13409 (2010)","journal-title":"PLoS ONE"},{"issue":"9","key":"13_CR29","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1089\/cmb.2007.0048","volume":"14","author":"Z. Fu","year":"2007","unstructured":"Fu, Z., Chen, X., Vacic, V., Nan, P., Zhong, Y., Jiang, T.: MSOAR: a high-throughput ortholog assignment system based on genome rearrangement. J. Comput. Biol. 14(9), 1160\u20131175 (2007)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"13_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S. Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46(1), 1\u201327 (1999)","journal-title":"J. ACM"},{"issue":"6","key":"13_CR31","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1089\/cmb.2005.12.638","volume":"12","author":"X. He","year":"2005","unstructured":"He, X., Goldwasser, M.H.: Identifying conserved gene clusters in the presence of homology families. J. Comput. Biol. 12(6), 638\u2013656 (2005)","journal-title":"J. Comput. Biol."},{"key":"13_CR32","series-title":"LNCS","first-page":"252","volume-title":"Proceedings of WABI 2001","author":"S. Heber","year":"2001","unstructured":"Heber, S., Stoye, J.: Algorithms for finding gene clusters. In: Proceedings of WABI 2001. LNCS, vol. 2149, pp. 252\u2013263 (2001)"},{"issue":"2","key":"13_CR33","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00453-009-9332-1","volume":"60","author":"S. Heber","year":"2011","unstructured":"Heber, S., Mayr, R., Stoye, J.: Common intervals of multiple permutations. Algorithmica 60(2), 175\u2013206 (2011)","journal-title":"Algorithmica"},{"issue":"9","key":"13_CR34","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1089\/cmb.2011.0132","volume":"18","author":"K. Jahn","year":"2011","unstructured":"Jahn, K.: Efficient computation of approximate gene clusters based on reference occurrences. J. Comput. Biol. 18(9), 1255\u20131274 (2011)","journal-title":"J. Comput. Biol."},{"issue":"1\u20132","key":"13_CR35","first-page":"83","volume":"2","author":"H.W. Kuhn","year":"2006","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2(1\u20132), 83\u201397 (2006)","journal-title":"Nav. Res. Logist. Q."},{"issue":"9","key":"13_CR36","doi-asserted-by":"publisher","first-page":"2178","DOI":"10.1101\/gr.1224503","volume":"13","author":"L. Li","year":"2003","unstructured":"Li, L., Stoeckert, C.J., Roos, D.S.: OrthoMCL: identification of ortholog groups for eukaryotic genomes. Genome Res. 13(9), 2178\u20132189 (2003)","journal-title":"Genome Res."},{"issue":"8","key":"13_CR37","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1089\/cmb.2008.0069","volume":"15","author":"J. Ma","year":"2008","unstructured":"Ma, J., Ratan, A., Raney, B.J., Suh, B.B., Zhang, L., Miller, W., Haussler, D.: DUPCAR: reconstructing contiguous ancestral regions with duplications. J. Comput. Biol. 15(8), 1007\u20131027 (2008)","journal-title":"J. Comput. Biol."},{"issue":"Suppl 19","key":"13_CR38","volume":"13","author":"J. Manuch","year":"2012","unstructured":"Manuch, J., Patterson, M., Wittler, R., Chauve, C., Tannier, E.: Linearization of ancestral multichromosomal genomes. BMC Bioinform. 13(Suppl 19), S11 (2012)","journal-title":"BMC Bioinform."},{"key":"13_CR39","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2010-11-1-r6","volume":"11","author":"M.C. Milinkovitch","year":"2010","unstructured":"Milinkovitch, M.C., Helaers, R., Depiereux, E., Tzika, A.C., Gabaldon, T.: 2\u00d7 genomes\u2014depth does matter. Genome Biol. 11, R6 (2010)","journal-title":"Genome Biol."},{"issue":"Database issue","key":"13_CR40","doi-asserted-by":"publisher","first-page":"D196","DOI":"10.1093\/nar\/gkp931","volume":"38","author":"G. Ostlund","year":"2010","unstructured":"Ostlund, G., Schmitt, T., Forslund, K., K\u00f6stler, T., Messina, D.N., Roopra, S., Frings, O., Sonnhammer, E.L.L.: InParanoid 7: new algorithms and tools for eukaryotic orthology analysis. Nucleic Acids Res. 38(Database issue), D196\u2013D203 (2010)","journal-title":"Nucleic Acids Res."},{"key":"13_CR41","first-page":"5","volume":"71","author":"I. Pe\u2019er","year":"1998","unstructured":"Pe\u2019er, I., Shamir, R.: The median problems for breakpoints are NP-complete. Electron. Colloq. Comput. Complex. 71, 5 (1998)","journal-title":"Electron. Colloq. Comput. Complex."},{"issue":"Database issue","key":"13_CR42","doi-asserted-by":"publisher","first-page":"D284","DOI":"10.1093\/nar\/gkr1060","volume":"40","author":"S. Powell","year":"2012","unstructured":"Powell, S., Szklarczyk, D., Trachana, K., Roth, A., Kuhn, M., Muller, J., Arnold, R., Rattei,\u00a0T., Letunic, I., Doerks, T., Jensen, L.J., von Mering, C., Bork, P.: eggNOG v3.0: orthologous groups covering 1133 organisms at 41 different taxonomic ranges. Nucleic Acids Res. 40(Database issue), D284\u2013D289 (2012)","journal-title":"Nucleic Acids Res."},{"key":"13_CR43","series-title":"LNBI","first-page":"298","volume-title":"Proceedings of WABI 2006","author":"S. Rahmann","year":"2006","unstructured":"Rahmann, S., Klau, G.W.: Integer linear programs for discovering approximate gene clusters. In: Proceedings of WABI 2006. LNBI, vol. 4175, pp. 298\u2013309 (2006)"},{"key":"13_CR44","series-title":"LNCS","first-page":"121","volume-title":"Proceedings of CPM 1992","author":"D. Sankoff","year":"1992","unstructured":"Sankoff, D.: Edit distances for genome comparisons based on non-local operations. In: Proceedings of CPM 1992. LNCS, vol. 644, pp. 121\u2013135 (1992)"},{"issue":"11","key":"13_CR45","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"},{"key":"13_CR46","series-title":"LNCS","first-page":"251","volume-title":"Proceedings of COCOON 1997","author":"D. Sankoff","year":"1997","unstructured":"Sankoff, D., Blanchette, M.: The median problem for breakpoints in comparative genomics. In: Proceedings of COCOON 1997. LNCS, vol. 1276, pp. 251\u2013263 (1997)"},{"key":"13_CR47","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1089\/cmb.1998.5.555","volume":"5","author":"D. Sankoff","year":"1998","unstructured":"Sankoff, D., Blanchette, M.: Multiple genome rearrangement and breakpoint phylogeny. J.\u00a0Comput. Biol. 5, 555\u2013570 (1998)","journal-title":"J.\u00a0Comput. Biol."},{"key":"13_CR48","series-title":"Computational Biology Series","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-94-011-4309-7_46","volume-title":"Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the Evolution of Gene Families","author":"D. Sankoff","year":"2000","unstructured":"Sankoff, D., El-Mabrouk, N.: Duplication, rearrangement and reconciliation. In: Sankoff, D., Nadeau, J.H. (eds.) Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment and the Evolution of Gene Families. Computational Biology Series, vol. 1, pp. 537\u2013550. Kluwer Academic, Dordrecht (2000)"},{"key":"13_CR49","series-title":"Meth. Enzymol.","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/0076-6879(90)83028-8","volume-title":"Molecular Evolution: Computer Analysis of Protein and Nucleic Acid Sequences","author":"D. Sankoff","year":"1990","unstructured":"Sankoff, D., Cedergren, R., Abel, Y.: Genomic divergence through gene rearrangement. In: Doolittle, R.F. (ed.) Molecular Evolution: Computer Analysis of Protein and Nucleic Acid Sequences. Meth. Enzymol., vol. 183, Chap.\u00a026, pp. 428\u2013438. Academic Press, San Diego (1990)"},{"key":"13_CR50","series-title":"LNCS","first-page":"347","volume-title":"Proceedings of CPM 2004","author":"T. Schmidt","year":"2004","unstructured":"Schmidt, T., Stoye, J.: Quadratic time algorithms for finding common intervals in two and more sequences. In: Proceedings of CPM 2004. LNCS, vol. 3109, pp. 347\u2013358 (2004)"},{"issue":"6","key":"13_CR51","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0020892","volume":"6","author":"G. Shi","year":"2011","unstructured":"Shi, G., Peng, M.C., Jiang, T.: MultiMSOAR 2.0: an accurate tool to identify ortholog groups among multiple genomes. PLoS ONE 6(6), e20892 (2011)","journal-title":"PLoS ONE"},{"issue":"3","key":"13_CR52","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1109\/TCBB.2008.135","volume":"6","author":"J. Stoye","year":"2009","unstructured":"Stoye, J., Wittler, R.: A unified approach for reconstructing ancient gene clusters. IEEE\/ACM Trans. Comput. Biol. Bioinform. 6(3), 387\u2013400 (2009)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"13_CR53","first-page":"592","volume-title":"Proceedings of BIBE 2004","author":"J. Tang","year":"2004","unstructured":"Tang, J., Moret, B.M., Cui, L., Depamphilis, C.W.: Phylogenetic reconstruction from arbitrary gene-order data. In: Proceedings of BIBE 2004, pp. 592\u2013599. IEEE, New York (2004)"},{"key":"13_CR54","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1186\/1471-2105-10-120","volume":"10","author":"E. Tannier","year":"2009","unstructured":"Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinform. 10, 120 (2009)","journal-title":"BMC Bioinform."},{"key":"13_CR55","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1186\/1471-2105-4-41","volume":"4","author":"R.L. Tatusov","year":"2003","unstructured":"Tatusov, R.L., Fedorova, N.D., Jackson, J.D., Jacobs, A.R., Kiryutin, B., Koonin, E.V., Krylov,\u00a0D.M., Mazumder, R., Mekhedov, S.L., Nikolskaya, A.N., Rao, B.S., Smirnov, S., Sverdlov, A.V., Vasudevan, S., Wolf, Y.I., Yin, J.J., Natale, D.A.: The COG database: an updated version includes eukaryotes. BMC Bioinform. 4, 41 (2003)","journal-title":"BMC Bioinform."},{"issue":"2","key":"13_CR56","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/s004539910014","volume":"26","author":"T. Uno","year":"2000","unstructured":"Uno, T., Yagiura, M.: Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26(2), 290\u2013309 (2000)","journal-title":"Algorithmica"},{"issue":"13","key":"13_CR57","doi-asserted-by":"publisher","first-page":"i549","DOI":"10.1093\/bioinformatics\/btm193","volume":"23","author":"I. Wapinski","year":"2007","unstructured":"Wapinski, I., Pfeffer, A., Friedman, N., Regev, A.: Automatic genome-wide reconstruction of phylogenetic gene trees. Bioinformatics 23(13), i549\u2013i558 (2007)","journal-title":"Bioinformatics"},{"issue":"7158","key":"13_CR58","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1038\/nature06107","volume":"449","author":"I. Wapinski","year":"2007","unstructured":"Wapinski, I., Pfeffer, A., Friedman, N., Regev, A.: Natural history and evolutionary principles of gene duplication in fungi. Nature 449(7158), 54\u201361 (2007)","journal-title":"Nature"},{"issue":"Database issue","key":"13_CR59","doi-asserted-by":"publisher","first-page":"D283","DOI":"10.1093\/nar\/gkq930","volume":"39","author":"R.M. Waterhouse","year":"2011","unstructured":"Waterhouse, R.M., Zdobnov, E.M., Tegenfeldt, F., Li, J., Kriventseva, E.V.: OrthoDB: the hierarchical catalog of eukaryotic orthologs in 2011. Nucleic Acids Res. 39(Database issue), D283\u2013D288 (2011)","journal-title":"Nucleic Acids Res."},{"issue":"1","key":"13_CR60","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.J., Hall, T., Morgan, A.: The chromosome inversion problem. J.\u00a0Theor. Biol. 99(1), 1\u20137 (1982)","journal-title":"J.\u00a0Theor. Biol."},{"key":"13_CR61","series-title":"LNBI","first-page":"351","volume-title":"Proceedings of WABI 2011","author":"A.W. Xu","year":"2011","unstructured":"Xu, A.W., Moret, B.M.E.: GASTS: parsimony scoring under rearrangements. In: Proceedings of WABI 2011. LNBI, vol. 6833, pp. 351\u2013363 (2011)"},{"key":"13_CR62","series-title":"LNBI","first-page":"152","volume-title":"Proceedings of BSB 2008","author":"X. Xu","year":"2008","unstructured":"Xu, X., Sankoff, D.: Tests for gene clusters satisfying the generalized adjacency criterion. In:\u00a0Proceedings of BSB 2008. LNBI, vol. 5167, pp. 152\u2013160 (2008)"},{"issue":"16","key":"13_CR63","doi-asserted-by":"publisher","first-page":"3340","DOI":"10.1093\/bioinformatics\/bti535","volume":"21","author":"S. Yancopoulos","year":"2005","unstructured":"Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16), 3340\u20133346 (2005)","journal-title":"Bioinformatics"},{"key":"13_CR64","series-title":"LNBI","first-page":"13","volume-title":"Proceedings of RECOMB-CG 2009","author":"Z. Yang","year":"2009","unstructured":"Yang, Z., Sankoff, D.: Natural parameter values for generalized gene adjacency. In: Proceedings of RECOMB-CG 2009. LNBI, vol. 5817, pp. 13\u201323 (2009)"},{"key":"13_CR65","first-page":"117","volume-title":"Proceedings of ISB 2011","author":"M. Zhang","year":"2011","unstructured":"Zhang, M., Leong, H.W.: Identifying positional homologs as bidirectional best hits of sequence and gene context similarity. In: Proceedings of ISB 2011, pp. 117\u2013122. IEEE, New York (2011)"},{"key":"13_CR66","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-02017-9_10","volume-title":"Proc. of Theory and Applications of Models of Computation","author":"B. Zhu","year":"2009","unstructured":"Zhu, B.: Approximability and fixed-parameter tractability for the exemplar genomic distance problems. In: Proc. of Theory and Applications of Models of Computation. LNCS, vol. 5532, pp. 71\u201380 (2009)"},{"issue":"2","key":"13_CR67","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/TCBB.2008.121","volume":"6","author":"Q. Zhu","year":"2009","unstructured":"Zhu, Q., Adam, Z., Choi, V., Sankoff, D.: Generalized gene adjacencies, graph bandwidth, and clusters in yeast evolution. IEEE\/ACM Trans. Comput. Biol. Bioinform. 6(2), 213\u2013220 (2009)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."}],"container-title":["Computational Biology","Models and Algorithms for Genome Evolution"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-5298-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T01:57:27Z","timestamp":1676339847000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-5298-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9781447152972","9781447152989"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-5298-9_13","relation":{},"ISSN":["1568-2684"],"issn-type":[{"type":"print","value":"1568-2684"}],"subject":[],"published":{"date-parts":[[2013]]}}}