{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:35Z","timestamp":1725544055584},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354550"},{"type":"electronic","value":"9783540354611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780441_14","type":"book-chapter","created":{"date-parts":[[2006,6,30]],"date-time":"2006-06-30T15:02:51Z","timestamp":1151679771000},"page":"141-152","source":"Crossref","is-referenced-by-count":1,"title":["On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem"],"prefix":"10.1007","author":[{"given":"Firas","family":"Swidan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Ziv-Ukelson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron Y.","family":"Pinter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Swidan, F., Rocha, E.P.C., Shmoish, M., Pinter, R.: An integrative method for accurate comparative genome mapping (submitted, 2005)","DOI":"10.1371\/journal.pcbi.0020075.eor"},{"issue":"6","key":"14_CR2","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1101\/gr.3378705","volume":"15","author":"W. Qian","year":"2005","unstructured":"Qian, W., Jia, Y., Ren, S.X., He, Y.Q., Feng, J.X., Lu, L.F., Sun, Q., Ying, G., et al.: Comparative and functional genomic analyses of the pathogenicity of phytopathogen Xanthomonas campestris pv. campestris. Genome Res.\u00a015(6), 757\u2013767 (2005)","journal-title":"campestris. Genome Res."},{"key":"14_CR3","unstructured":"Achaz, G., Boyer, F., Rocha, E.P.C., Viari, A., Coissac, E.: Extracting approximate repeats from large DNA sequences (2004)"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1128\/MMBR.58.3.401-465.1994","volume":"58","author":"S.C. Kowalczykowski","year":"1994","unstructured":"Kowalczykowski, S.C., Dixon, D.A., Eggleston, A.K., Lauder, S.D., Rehrauer, W.M.: Biochemistry of homologous recombination in Escherichia coli. Microbiol. Rev.\u00a058, 401\u2013465 (1994)","journal-title":"Microbiol. Rev."},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BFb0029799","volume-title":"Combinatorial Pattern Matching","author":"J. Kececioglu","year":"1993","unstructured":"Kececioglu, J., Sankoff, D.: Exact and approximation algorithms for the inversion distance between two permutations. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol.\u00a0684, pp. 87\u2013105. Springer, Heidelberg (1993)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Faster and simpler algorithm for sorting signed permutations by reversals. In: Proc. 8th Ann. Symp. on Discrete Algorithms, pp. 344\u2013351 (1997)","DOI":"10.1145\/267521.267544"},{"key":"14_CR7","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\u00a046, 1\u201327 (1999)","journal-title":"J. ACM"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-27801-6_29","volume-title":"Combinatorial Pattern Matching","author":"A. Bergeron","year":"2004","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: Reversal distance without hurdles and fortresses. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 388\u2013399. Springer, Heidelberg (2004)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-27801-6_1","volume-title":"Combinatorial Pattern Matching","author":"E. Tannier","year":"2004","unstructured":"Tannier, E., Sagot, M.F.: Sorting by reversals in subquadratic time. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 1\u201313. Springer, Heidelberg (2004)"},{"key":"14_CR10","unstructured":"Bender, M., Ge, D., He, S., Hu, H., Pinter, R., Skiena, S., Swidan, F.: Improved bounds on sorting with length-weighted reversals. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 912\u2013921 (2004)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-27801-6_3","volume-title":"Combinatorial Pattern Matching","author":"F. Swidan","year":"2004","unstructured":"Swidan, F., Bender, M.A., Ge, D., He, S., Hu, H., Pinter, R.Y.: Sorting by length-weighted reversals: Dealing with signs and circularity. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 32\u201346. Springer, Heidelberg (2004)"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.dam.2004.04.010","volume":"146","author":"A. Bergeron","year":"2005","unstructured":"Bergeron, A.: A very elementary presentation of the hannenhalli-pevzner theory. Discrete Applied Mathematics\u00a0146(2), 134\u2013145 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR13","first-page":"84","volume-title":"Proc 3th Ann. Int. Conf. on Computational Molecular Biology","author":"A. Caprara","year":"1999","unstructured":"Caprara, A.: Formulations and hardness of multiple sorting by reversals. In: Proc 3th Ann. Int. Conf. on Computational Molecular Biology, pp. 84\u201393. ACM Press, New York (1999)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Moret, B., Wang, L., Warnow, T., Wyman, S.: New approaches for reconstructing phylogenies from gene order data. In: Proc. 9th Int. Conf. Intell. Syst. Mol. Biol., pp. 165\u2013173 (2001)","DOI":"10.1093\/bioinformatics\/17.suppl_1.S165"},{"issue":"1","key":"14_CR15","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.\u00a012(1), 26\u201336 (2002)","journal-title":"Genome Res."},{"key":"14_CR16","unstructured":"Gonnet, G.H.: Handbook of Algorithms and Data Structures. International Computer Science Services (1983)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780441_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:10Z","timestamp":1605643630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780441_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354550","9783540354611"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11780441_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}