{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:08:34Z","timestamp":1763726914948,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15579-1_9","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"121-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Frequent Pattern Mining with Non-overlapping Inversions"],"prefix":"10.1007","author":[{"given":"Da-Jung","family":"Cho","sequence":"first","affiliation":[]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[]},{"given":"Hwee","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. ACM SIGMOD Record 22(2), 207\u2013216 (1993)","journal-title":"ACM SIGMOD Record"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-45030-3_6","volume-title":"Algorithms and Computation","author":"A Amir","year":"2013","unstructured":"Amir, A., Porat, B.: Pattern matching with non overlapping reversals - approximation and on-line algorithms. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 55\u201365. Springer, Heidelberg (2013)"},{"issue":"29","key":"9_CR3","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 483(29), 85\u201395 (2013)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.tcs.2004.02.040","volume":"325","author":"ZZ 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 325(3), 361\u2013372 (2004)","journal-title":"Theoretical Computer Science"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-08123-6_8","volume-title":"Unconventional Computation and Natural Computation","author":"D-J Cho","year":"2014","unstructured":"Cho, D.-J., Han, Y.-S., Kang, S.-D., Kim, H., Ko, S.-K., Salomaa, K.: Pseudo-inversion on formal languages. In: Ibarra, O.H., Kari, L., Kopecki, S. (eds.) UCNC 2014. LNCS, vol. 8553, pp. 93\u2013104. Springer, Heidelberg (2014)"},{"key":"9_CR6","unstructured":"Cho, D.J., Han, Y.S., Kim, H.: Alignment with non-overlapping inversions and translocations on two strings. Theoretical Computer Science (in press)"},{"key":"9_CR7","unstructured":"Harary, F.: Graph Theory. Addison-Wesley series in mathematics. Perseus Books (1994)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-319-11295-4_10","volume-title":"DNA Computing and Molecular Programming","author":"OH Ibarra","year":"2014","unstructured":"Ibarra, O.H.: On decidability and closure properties of language classes with respect to bio-operations. In: Murata, S., Kobayashi, S. (eds.) DNA 2014. LNCS, vol. 8727, pp. 148\u2013160. Springer, Heidelberg (2014)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Kruskal, Jr., J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7(1), 48\u201350 (1956)","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Kum, H.C., Pei, J., Wang, W., Duncan, D.: Approxmap: Approximate mining of consensus sequential patterns. In: Proceedings of the 2nd SIAM International Conference on Data Mining, pp. 311\u2013315 (2003)","DOI":"10.1137\/1.9781611972733.36"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s10115-012-0602-x","volume":"38","author":"VCC Liao","year":"2013","unstructured":"Liao, V.C.C., Chen, M.S.: DFSP: a Depth-First SPelling algorithm for sequential pattern mining of biological sequences. Knowledge and Information Systems 38(3), 623\u2013639 (2013)","journal-title":"Knowledge and Information Systems"},{"issue":"4","key":"9_CR12","first-page":"1","volume":"7","author":"VCC Liao","year":"2013","unstructured":"Liao, V.C.C., Chen, M.S.: Efficient mining gapped sequential patterns for motifs in biological sequences. BMC Systems Biology 7(4), 1\u201313 (2013)","journal-title":"BMC Systems Biology"},{"issue":"10","key":"9_CR13","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/S0168-9525(98)01555-8","volume":"14","author":"JR Lupski","year":"1998","unstructured":"Lupski, J.R.: Genomic disorders: structural features of the genome can lead to DNA rearrangements and human disease traits. Trends in Genetics 14(10), 417\u2013422 (1998)","journal-title":"Trends in Genetics"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/BFb0054337","volume-title":"LATIN\u201998: Theoretical Informatics","author":"M-F Sagot","year":"1998","unstructured":"Sagot, M.-F.: Spelling approximate repeated or common motifs using a suffix tree. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 374\u2013390. Springer, Heidelberg (1998)"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/BF02459633","volume":"54","author":"M Sch\u00f6niger","year":"1992","unstructured":"Sch\u00f6niger, M., Waterman, M.S.: A local algorithm for DNA sequence alignment with inversions. Bulletin of Mathematical Biology 54(4), 521\u2013536 (1992)","journal-title":"Bulletin of Mathematical Biology"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511808876"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11851561_18","volume-title":"Algorithms in Bioinformatics","author":"AF Vellozo","year":"2006","unstructured":"Vellozo, A.F., Alves, C.E.R., do Lago, A.P.: Alignment with non-overlapping inversions in $${O}(n^3)$$-time. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 186\u2013196. Springer, Heidelberg (2006)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Wang, K., Xu, Y., Yu, J.X.: Scalable sequential pattern mining for biological sequences. In: Proceedings of the 13th ACM International Conference on Information and Knowledge Management, pp. 178\u2013187 (2004)","DOI":"10.1145\/1031171.1031209"},{"key":"9_CR19","unstructured":"Wood, D.: Theory of Computation. Harper & Row (1986)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Zhu, F., Yan, X., Han, J., Yu, P.S.: Efficient discovery of frequent approximate sequential patterns. In: Proceedings of the 7th IEEE International Conference on Data Mining, pp. 751\u2013756 (2007)","DOI":"10.1109\/ICDM.2007.75"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T22:37:31Z","timestamp":1676932651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}