{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:19:23Z","timestamp":1743085163764,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245824"},{"type":"electronic","value":"9783642245831"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24583-1_15","type":"book-chapter","created":{"date-parts":[[2011,9,30]],"date-time":"2011-09-30T13:08:23Z","timestamp":1317388103000},"page":"144-155","source":"Crossref","is-referenced-by-count":0,"title":["Fast Computation of a String Duplication History under No-Breakpoint-Reuse"],"prefix":"10.1007","author":[{"given":"Bro\u0148a","family":"Brejov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Vina\u0159","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Alstrup, S., Brodal, G.S., Rauhe, T.: Pattern matching in dynamic texts. In: Symposium on Discrete Algorithms (SODA), pp. 819\u2013828 (2000)"},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ic.2009.12.001","volume":"208","author":"H.-Y. Ann","year":"2010","unstructured":"Ann, H.-Y., Yang, C.-B., Peng, Y.-H., Liaw, B.-C.: Efficient algorithms for the block edit problems. Information and Computation\u00a0208(3), 221\u2013229 (2010)","journal-title":"Information and Computation"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1186810.1186812","volume":"3","author":"G. Cormode","year":"2007","unstructured":"Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. ACM Transactions on Algorithms\u00a03(1), 1\u201319 (2007)","journal-title":"ACM Transactions on Algorithms"},{"issue":"3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1093\/oxfordjournals.molbev.a004081","volume":"19","author":"O. Elemento","year":"2002","unstructured":"Elemento, O., Gascuel, O., Lefranc, M.-P.: Reconstructing the duplication history of tandemly repeated genes. Molecular Biology and Evolution\u00a019(3), 278\u2013278 (2002)","journal-title":"Molecular Biology and Evolution"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-24597-1_16","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"F. Erg\u00fcn","year":"2003","unstructured":"Erg\u00fcn, F., Muthukrishnan, S.M., \u015eahinalp, S.C.: Comparing sequences with segment rearrangements. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 183\u2013194. Springer, Heidelberg (2003)"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/1748-7188-5-11","volume":"5","author":"C.L. Kahn","year":"2010","unstructured":"Kahn, C.L., Mozes, S., Raphael, B.J.: Efficient algorithms for analyzing segmental duplications with deletions and inversions in genomes. Algorithms for Molecular Biology\u00a05(1), 11 (2010)","journal-title":"Algorithms for Molecular Biology"},{"issue":"6","key":"15_CR7","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J. K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. Journal of the ACM\u00a053(6), 918\u2013936 (2006)","journal-title":"Journal of the ACM"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T. Kasai","year":"2001","unstructured":"Kasai, T., Lee, G.H., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1089\/cmb.2007.A007","volume":"14","author":"M. Lajoie","year":"2007","unstructured":"Lajoie, M., Bertrand, D., El-Mabrouk, N., Gascuel, O.: Duplication and inversion history of a tandemly repeated genes family. Journal of Computational Biology\u00a014(4), 462\u2013468 (2007)","journal-title":"Journal of Computational Biology"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(96)00268-X","volume":"181","author":"D.P. Lopresti","year":"1997","unstructured":"Lopresti, D.P., Tomkins, A.: Block edit models for approximate string matching. Theoretical Computer Science\u00a0181(1), 159\u2013179 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"38","key":"15_CR11","doi-asserted-by":"publisher","first-page":"14254","DOI":"10.1073\/pnas.0805217105","volume":"105","author":"J. Ma","year":"2008","unstructured":"Ma, J., Ratan, A., Raney, B.J., Suh, B.B., Miller, W., Haussler, D.: The infinite sites model of genome evolution. Proceeding of the National Academy of Sciences USA\u00a0105(38), 14254\u201314261 (2008)","journal-title":"Proceeding of the National Academy of Sciences USA"},{"issue":"2","key":"15_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01840386","volume":"5","author":"K. Mehlhorn","year":"1990","unstructured":"Mehlhorn, K., N\u00e4her, S.: Dynamic fractional cascading. Algorithmica\u00a05(2), 215\u2013241 (1990)","journal-title":"Algorithmica"},{"issue":"3","key":"15_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. Proceeding of the National Academy of Sciences USA\u00a081(3), 814\u2013818 (1984)","journal-title":"Proceeding of the National Academy of Sciences USA"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-540-39984-1_29","volume-title":"String Processing and Information Retrieval","author":"D. Shapira","year":"2003","unstructured":"Shapira, D., Storer, J.A.: Large edit distance with multiple block operations. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 369\u2013377. Springer, Heidelberg (2003)"},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.jda.2005.01.010","volume":"5","author":"D. Shapira","year":"2007","unstructured":"Shapira, D., Storer, J.A.: Edit distance with move operations. Journal of Discrete Algorithms\u00a05(2), 380\u2013392 (2007)","journal-title":"Journal of Discrete Algorithms"},{"issue":"9","key":"15_CR16","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1089\/cmb.2010.0094","volume":"17","author":"G. Song","year":"2010","unstructured":"Song, G., Zhang, L., Vinar, T., Miller, W.: CAGE: Combinatorial Analysis of Gene-cluster Evolution. Journal of Computational Biology\u00a017(9), 1227\u20131232 (2010)","journal-title":"Journal of Computational Biology"},{"issue":"9","key":"15_CR17","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1089\/cmb.2010.0090","volume":"17","author":"T. Vinar","year":"2010","unstructured":"Vinar, T., Brejova, B., Song, G., Siepel, A.: Reconstructing histories of complex gene clusters on a phylogeny. Journal of Computational Biology\u00a017(9), 1267\u20131269 (2010)","journal-title":"Journal of Computational Biology"},{"issue":"8","key":"15_CR18","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1089\/cmb.2009.0040","volume":"16","author":"Y. Zhang","year":"2009","unstructured":"Zhang, Y., Song, G., Vinar, T., Green, E.D., Siepel, A., Miller, W.: Evolutionary history reconstruction for mammalian complex gene clusters. Journal of Computational Biology\u00a016(8), 1051\u20131060 (2009)","journal-title":"Journal of Computational Biology"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24583-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T14:18:24Z","timestamp":1578493104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24583-1_15"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245824","9783642245831"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24583-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}