{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:07:45Z","timestamp":1742378865648,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540289326"},{"type":"electronic","value":"9783540318149"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11554714_3","type":"book-chapter","created":{"date-parts":[[2005,12,15]],"date-time":"2005-12-15T05:47:00Z","timestamp":1134625620000},"page":"21-34","source":"Crossref","is-referenced-by-count":19,"title":["Maximizing Synteny Blocks to Identify Ancestral Homologs"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Bourque","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasmine","family":"Yacef","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"El-Mabrouk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1093\/bioinformatics\/15.11.909","volume":"15","author":"D. Sankoff","year":"1999","unstructured":"Sankoff, D.: Genome rear. with gene fam. Bioinformatics 15, 909\u2013917 (1999)","journal-title":"Bioinformatics"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01188586","volume":"13","author":"J. Kececioglu","year":"1995","unstructured":"Kececioglu, J., Sankoff, D.: Exact and approx. algo. for sorting by reversals, with application to genome rear. Algorithmica\u00a013, 180\u2013210 (1995)","journal-title":"Algorithmica"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"48","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\u00a048, 1\u201327 (1999)","journal-title":"J. ACM"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1137\/S0097539798334207","volume":"29","author":"H. Kaplan","year":"2000","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: A faster and simpler algorithm for sorting signed permutations by reversals. SIAM Journal on Computing\u00a029, 880\u2013892 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45123-4_20","volume-title":"Combinatorial Pattern Matching","author":"N. El-Mabrouk","year":"2000","unstructured":"El-Mabrouk, N.: Genome rearrangement by reversals and insertions\/deletions of contiguous segments. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 222\u2013234. Springer, Heidelberg (2000)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/3-540-48194-X_9","volume-title":"Combinatorial Pattern Matching","author":"A. Bergeron","year":"2001","unstructured":"Bergeron, A.: A very elementary presentation of the Hannenhalli-Pevzner theory. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, p. 106. Springer, Heidelberg (2001)"},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V. Bafna","year":"1998","unstructured":"Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM Journal on Discrete Mathematics\u00a011(2), 224\u2013240 (1998)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Walter, M.E., Dias, Z., Meidanis, J.: Reversal and transposition distance of linear chromosomes. In: String Proc. Information Retrieval (SPIRE 1998) (1998)","DOI":"10.1109\/SPIRE.1998.712988"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-44888-8_12","volume-title":"Combinatorial Pattern Matching","author":"T. Hartman","year":"2003","unstructured":"Hartman, T.: A simpler 1.5-approximation algorithm for sorting by transpositions. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 156\u2013169. Springer, Heidelberg (2003)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proc. IEEE 36th Ann. Symp. Found. Comp. Sci., pp. 581\u2013592 (1995)","DOI":"10.1109\/SFCS.1995.492588"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/S0022-0000(02)00011-9","volume":"65","author":"G. Tesler","year":"2002","unstructured":"Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. J. Comp. System Sci.\u00a065(3), 587\u2013609 (2002)","journal-title":"J. Comp. System Sci."},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1142\/S0219720003000198","volume":"1","author":"M. Ozery-Flato","year":"2003","unstructured":"Ozery-Flato, M., Shamir, R.: Two notes on genome rearrangnements. J. of Bioinf. and Comput. Biol.\u00a01(1), 71\u201394 (2003)","journal-title":"J. of Bioinf. and Comput. Biol."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Burgetz, I.J., Shariff, S., Pang, A., Tillier, E.: Positional homology in bacterial genomes. manuscript (2005)","DOI":"10.1177\/117693430600200031"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-45071-8_9","volume-title":"Computing and Combinatorics","author":"A. Bergeron","year":"2003","unstructured":"Bergeron, A., Stoye, J.: On the similarity of sets of permutations and its app. to genome comparison. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 68\u201379. Springer, Heidelberg (2003)"},{"key":"3_CR15","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":"3_CR16","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-30219-3_3","volume-title":"Algorithms in Bioinformatics","author":"M. Figeac","year":"2004","unstructured":"Figeac, M., Varr\u00e9, J.S.: Sorting by reversals with common intervals. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 26\u201337. Springer, Heidelberg (2004)"},{"key":"3_CR17","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-32290-0_1","volume-title":"Comparative Genomics","author":"S. B\u00e9rard","year":"2005","unstructured":"B\u00e9rard, S., Bergeron, A., Chauve, C.: Conservation of combinatorial structures in evolution scenarios. In: Lagergren, J. (ed.) RECOMB-WS 2004. LNCS (LNBI), vol.\u00a03388, pp. 1\u201314. Springer, Heidelberg (2005)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-45078-8_4","volume-title":"Algorithms and Data Structures","author":"J. Tang","year":"2003","unstructured":"Tang, J., Moret, B.M.E.: Phylogenetic reconstruction from gene rearrangement data with unequal gene contents. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 37\u201346. Springer, Heidelberg (2003)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Chen, X., Zheng, J., Fu, Z., Nan, P., Zhing, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement. In: TCCB (2005) (accepted)","DOI":"10.1142\/9781860947322_0037"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Bryant, D.: The complexity of calculating exemplar distances. In: Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map alignment and the Evolution of Gene Families. Series in Computational Biology, vol.\u00a01. Kluwer Academic Publishers, Dordrecht (2000)","DOI":"10.1007\/978-94-011-4309-7_19"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Nguyen, C.T., Tay, Y.C., Zhang, L.: Divide-and-conquer approach for the exemplar breakpoint distance. Bioinformatics (2005)","DOI":"10.1093\/bioinformatics\/bti327"},{"key":"3_CR22","unstructured":"Blin, G., Chauve, C., Fertin, G.: The breakpoint distance for signed sequences. In: Texts in Algorithm, vol.\u00a03, pp. 3\u201316. KCL publications (2004)"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.tcs.2004.02.039","volume":"325","author":"M. Marron","year":"2004","unstructured":"Marron, M., Swenson, K.M., Moret, B.M.E.: Genomic distances under deletions and insertions. Theoretical Computer Science\u00a0325, 347\u2013360 (2004)","journal-title":"Theoretical Computer Science"},{"key":"3_CR24","unstructured":"Swenson, K.M., Marron, M., Earnest-DeYoung, J.V., Moret, B.M.E.: Approximating the true evolutionary distance between two genomes. In: 7th Workshop on Algorithm Engineering and Experiments (ALENEX 2005). SIAM Press, Philadelphia (2005)"},{"key":"3_CR25","doi-asserted-by":"crossref","first-page":"190i","DOI":"10.1093\/bioinformatics\/btg1025","volume":"19","author":"J.F. Lefebvre","year":"2003","unstructured":"Lefebvre, J.F., El-Mabrouk, N., Tillier, E., Sankoff, D.: Detection and validation of single gene inversions. Bioinformatics\u00a019, 190i\u2013196i (2003)","journal-title":"Bioinformatics"},{"issue":"13","key":"3_CR26","doi-asserted-by":"publisher","first-page":"7672","DOI":"10.1073\/pnas.1330369100","volume":"100","author":"P. Pevzner","year":"2003","unstructured":"Pevzner, P., Tesler, G.: Human and mouse genomic sequences reveal extensive breakpoint reuse in mamm. evol. PNAS, U.S.A.\u00a0100(13), 7672\u20137677 (2003)","journal-title":"PNAS, U.S.A."},{"key":"3_CR27","unstructured":"http:\/\/www.cs.unm.edu\/~moret\/GRAPPA"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11554714_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T14:35:33Z","timestamp":1736174133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11554714_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540289326","9783540318149"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11554714_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}