{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T03:00:33Z","timestamp":1725764433963},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038438"},{"type":"electronic","value":"9783319038445"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03844-5_45","type":"book-chapter","created":{"date-parts":[[2013,12,15]],"date-time":"2013-12-15T21:56:24Z","timestamp":1387144584000},"page":"444-452","source":"Crossref","is-referenced-by-count":0,"title":["Multidimensional Longest Increasing Subsequences and Its Variants Discovery Using DNA Operations"],"prefix":"10.1007","author":[{"given":"Balaraja","family":"Lavanya","sequence":"first","affiliation":[]},{"given":"Annamalai","family":"Murugan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"45_CR1","first-page":"239","volume":"3","author":"A. Murugan","year":"2010","unstructured":"Murugan, A., Lavanya, B.: A DNA algorithmic approach to solve GCS problem. Journal of Computational Intelligence in Bioinformatics\u00a03(2), 239\u2013247 (2010)","journal-title":"Journal of Computational Intelligence in Bioinformatics"},{"issue":"2","key":"45_CR2","first-page":"199","volume":"7","author":"A. Murugan","year":"2011","unstructured":"Murugan, A., Lavanya, B., Shyamala, K.: A novel programming approach for DNA computing. International Journal of Computational Intelligence Research\u00a07(2), 199\u2013209 (2011)","journal-title":"International Journal of Computational Intelligence Research"},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1093\/nar\/27.11.2369","volume":"27","author":"A.L. Delcher","year":"1999","unstructured":"Delcher, A.L., Kasif, S., Feischmann, R.D., Peterson, J., White, O., Salzberg, S.L.: Alignment of whole genomes. Nucleic Acids Research\u00a027, 2369\u20132376 (1999)","journal-title":"Nucleic Acids Research"},{"issue":"5","key":"45_CR4","first-page":"45","volume":"29","author":"B. Lavanya","year":"2011","unstructured":"Lavanya, B., Murugan, A.: A DNA based approach to find closed repetitive gapped subsequence from a sequence database. International Journal of Computer Applications\u00a029(5), 45\u201349 (2011)","journal-title":"International Journal of Computer Applications"},{"issue":"2","key":"45_CR5","first-page":"1169","volume":"5","author":"B. Lavanya","year":"2013","unstructured":"Lavanya, B., Murugan, A.: Discovery of longest increasing subsequences and its variants using DNA operations. International Journal of Engineering and Technology\u00a05(2), 1169\u20131177 (2013)","journal-title":"International Journal of Engineering and Technology"},{"issue":"2","key":"45_CR6","first-page":"1153","volume":"5","author":"B. Lavanya","year":"2013","unstructured":"Lavanya, B., Murugan, A.: Multidimensional longest common subsequence discovery from large databases using DNA operations. International Journal of Engineering and Technology\u00a05(2), 1153\u20131160 (2013)","journal-title":"International Journal of Engineering and Technology"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.4153\/CJM-1961-015-3","volume":"13","author":"C. Schensted","year":"1961","unstructured":"Schensted, C.: Longest increasing and decreasing subsequences. Can. J. Math\u00a013, 179\u2013191 (1961)","journal-title":"Can. J. Math"},{"key":"45_CR8","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.ic.2010.04.003","volume":"208","author":"M. Crochemore","year":"2010","unstructured":"Crochemore, M., Porat, E.: Fast computation of longest increasing subsequences and application. Information and Computation\u00a0208, 1054\u20131059 (2010)","journal-title":"Information and Computation"},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"709","DOI":"10.2140\/pjm.1970.34.709","volume":"34","author":"D.E. Knuth","year":"1970","unstructured":"Knuth, D.E.: Permutations,matricesand generalized young tableaux. Pacific. J. Math\u00a034, 709\u2013727 (1970)","journal-title":"Pacific. J. Math"},{"issue":"5","key":"45_CR10","doi-asserted-by":"publisher","first-page":"730","DOI":"10.7763\/IJCTE.2010.V2.233","volume":"2","author":"M. Esmaieli","year":"2010","unstructured":"Esmaieli, M., Tarafdar, M.: Sequential pattern mining from multidimensional sequence data in parallel. International Journal of Computer Theory and Engineering\u00a02(5), 730\u2013733 (2010)","journal-title":"International Journal of Computer Theory and Engineering"},{"key":"45_CR11","first-page":"13","volume":"11","author":"Hirosawa","year":"1995","unstructured":"Hirosawa, et al.: Comprehensive study on iterative algorithms of multiple sequence alignment. Computational Applications in Biosciences\u00a011, 13\u201318 (1995)","journal-title":"Computational Applications in Biosciences"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"745","DOI":"10.2307\/2371609","volume":"60","author":"G. B. Robinson De","year":"1938","unstructured":"De B. Robinson, G.: On representation of symmetric group. Am. J. Math\u00a060, 745\u2013760 (1938)","journal-title":"Am. J. Math"},{"issue":"1","key":"45_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","volume":"11","author":"M.L. Fredman","year":"1975","unstructured":"Fredman, M.L.: On computing the length of longest increasing subsequences. Discrete Mathematics\u00a011(1), 29\u201335 (1975)","journal-title":"Discrete Mathematics"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1089\/cmb.1994.1.337","volume":"1","author":"L. Wang","year":"1994","unstructured":"Wang, L., Jiang, T.: On the complexity of multiple sequence alignment. Journal of Computational Biology\u00a01, 337\u2013348 (1994)","journal-title":"Journal of Computational Biology"},{"key":"45_CR15","unstructured":"Tompa, M.: An exact method for finding short motifs in sequences with application to ribisome binding site problem. In: Proc. Seventh Int\u2019l. Conf. Intelligent Systems for Molecular Biology, pp. 262\u2013271 (1999)"},{"issue":"1-2","key":"45_CR16","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(00)00124-1","volume":"76","author":"S. Bespamyatnikh","year":"2000","unstructured":"Bespamyatnikh, S., Segal, M.: Enumerating longest increasing subsequences and patience sorting. Information Processing Letters\u00a076(1-2), 7\u201311 (2000)","journal-title":"Information Processing Letters"},{"issue":"5","key":"45_CR17","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"J.W. Hunt","year":"1977","unstructured":"Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest common subsequences. Communications of ACM\u00a020(5), 350\u2013353 (1977)","journal-title":"Communications of ACM"}],"container-title":["Lecture Notes in Computer Science","Mining Intelligence and Knowledge Exploration"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03844-5_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T09:25:52Z","timestamp":1558776352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03844-5_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038438","9783319038445"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03844-5_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}