{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:32:14Z","timestamp":1725795134243},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080154"},{"type":"electronic","value":"9783319080161"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08016-1_13","type":"book-chapter","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T04:18:07Z","timestamp":1401423487000},"page":"141-150","source":"Crossref","is-referenced-by-count":1,"title":["Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time"],"prefix":"10.1007","author":[{"given":"Hwee","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2012.06.009","volume":"483","author":"D. Cantone","year":"2013","unstructured":"Cantone, D., Cristofaro, S., Faro, S.: Efficient string-matching allowing for non-overlapping inversions. Theoretical Computer Science\u00a0483, 85\u201395 (2013)","journal-title":"Theoretical Computer Science"},{"key":"13_CR2","unstructured":"Cantone, D., Faro, S., Giaquinta, E.: Approximate string matching allowing for inversions and translocations. In: Proceedings of the Prague Stringology Conference 2010, pp. 37\u201351 (2010)"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.tcs.2004.02.040","volume":"325","author":"Z.-Z. Chen","year":"2004","unstructured":"Chen, Z.-Z., Gao, Y., Lin, G., Niewiadomski, R., Wang, Y., Wu, J.: A space-efficient algorithm for sequence alignment with inversions and reversals. Theoretical Computer Science\u00a0325(3), 361\u2013372 (2004)","journal-title":"Theoretical Computer Science"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-04657-0_25","volume-title":"Algorithms and Computation","author":"D.-J. Cho","year":"2014","unstructured":"Cho, D.-J., Han, Y.-S., Kim, H.: Alignment with non-overlapping inversions on two strings. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol.\u00a08344, pp. 261\u2013272. Springer, Heidelberg (2014)"},{"issue":"11","key":"13_CR5","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1016\/j.ipl.2011.02.015","volume":"111","author":"S. Grabowski","year":"2011","unstructured":"Grabowski, S., Faro, S., Giaquinta, E.: String matching with inversions and translocations in linear average time (most of the time). Information Processing Letters\u00a0111(11), 516\u2013520 (2011)","journal-title":"Information Processing Letters"},{"key":"13_CR6","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.D. Kececioglu","year":"1993","unstructured":"Kececioglu, J.D., Sankoff, D.: Exact and approximation algorithms for the inversion distance between two chromosomes. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1993. LNCS, vol.\u00a0684, pp. 87\u2013105. Springer, Heidelberg (1993)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-10631-6_9","volume-title":"Algorithms and Computation","author":"S.C. Li","year":"2009","unstructured":"Li, S.C., Ng, Y.K.: On protein structure alignment under distance constraint. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 65\u201376. Springer, Heidelberg (2009)"},{"issue":"12","key":"13_CR8","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1038\/sj.ejhg.5200895","volume":"10","author":"C.M. Ogilvie","year":"2009","unstructured":"Ogilvie, C.M., Scriven, P.N.: Meiotic outcomes in reciprocal translocation carriers ascertained in 3-day human embryos. European Journal of Human Genetics\u00a010(12), 801\u2013806 (2009)","journal-title":"European Journal of Human Genetics"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1126\/science.78.2034.585","volume":"78","author":"T.S. Painter","year":"1933","unstructured":"Painter, T.S.: A New Method for the Study of Chromosome Rearrangements and the Plotting of Chromosome Maps. Science\u00a078, 585\u2013586 (1933)","journal-title":"Science"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-642-25591-5_68","volume-title":"Algorithms and Computation","author":"Y. Sakai","year":"2011","unstructured":"Sakai, Y.: A new algorithm for the characteristic string problem under loose similarity criteria. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol.\u00a07074, pp. 663\u2013672. Springer, Heidelberg (2011)"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/BF02459633","volume":"54","author":"M. Schniger","year":"1992","unstructured":"Schniger, M., Waterman, M.S.: A local algorithm for DNA sequence alignment with inversions. Bulletin of Mathematical Biology\u00a054(4), 521\u2013536 (1992)","journal-title":"Bulletin of Mathematical Biology"},{"key":"13_CR12","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11851561_18","volume-title":"Algorithms in Bioinformatics","author":"A.F. Vellozo","year":"2006","unstructured":"Vellozo, A.F., Alves, C.E.R., do Lago, A.P.: Alignment with non-overlapping inversions in O(n\n                  3)-time. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol.\u00a04175, pp. 186\u2013196. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08016-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:08:31Z","timestamp":1558912111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08016-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080154","9783319080161"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08016-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}