{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:36:39Z","timestamp":1764977799431,"version":"3.46.0"},"reference-count":39,"publisher":"Walter de Gruyter GmbH","issue":"3","license":[{"start":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T00:00:00Z","timestamp":1489622400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7,26]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>DNA sequence mining is essential in the study of the structure and function of the DNA sequence. A few exploration works have been published in the literature concerning sequence mining in information mining task. Similarly, in our past paper, an effective sequence mining was performed on a DNA database utilizing constraint measures and group search optimization (GSO). In that study, GSO calculation was utilized to optimize the sequence extraction process from a given DNA database. However, it is apparent that, occasionally, such an arbitrary seeking system does not accompany the optimal solution in the given time. To overcome the problem, we proposed in this work multiple constraints with hybrid firefly and GSO (HFGSO) algorithm. The complete DNA sequence mining process comprised the following three modules: (i) applying prefix span algorithm; (ii) calculating the length, width, and regular expression (RE) constraints; and (iii) optimal mining via HFGSO. First, we apply the concept of prefix span, which detects the frequent DNA sequence pattern using a prefix tree. Based on this prefix tree, length, width, and RE constraints are applied to handle restrictions. Finally, we adopt the HFGSO algorithm for the completeness of the mining result. The experimentation is carried out on the standard DNA sequence dataset, and the evaluation with DNA sequence dataset and the results show that our approach is better than the existing approach.<\/jats:p>","DOI":"10.1515\/jisys-2016-0111","type":"journal-article","created":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T11:33:04Z","timestamp":1489663984000},"page":"349-362","source":"Crossref","is-referenced-by-count":23,"title":["Mining DNA Sequence Patterns with Constraints Using Hybridization of Firefly and Group Search Optimization"],"prefix":"10.1515","volume":"27","author":[{"given":"Kuruva","family":"Lakshmanna","sequence":"first","affiliation":[{"name":"VIT University , Vellore, Tamil Nadu 632014 , India"}]},{"given":"Neelu","family":"Khare","sequence":"additional","affiliation":[{"name":"VIT University , Vellore, Tamil Nadu 632014 , India"}]}],"member":"374","published-online":{"date-parts":[[2017,3,16]]},"reference":[{"unstructured":"R. Agrawal and R. Srikant, Fast algorithms for mining association rules, in: Proc. of the 20th Int\u2019l Conference on Very Large Databases, Santiago, Chile, September 1994, expanded version available as IBM Research Report RJ9839, June 1994.","key":"2025120523310290271_j_jisys-2016-0111_ref_001_w2aab3b7b6b1b6b1ab1b6b1Aa"},{"doi-asserted-by":"crossref","unstructured":"R. Agrawal and R. Srikant, Mining sequential patterns, In: Proceedings of the 11th International Conference on Data Engineering, pp. 3\u201314, Taiwan, 1995.","key":"2025120523310290271_j_jisys-2016-0111_ref_002_w2aab3b7b6b1b6b1ab1b6b2Aa","DOI":"10.1109\/ICDE.1995.380415"},{"doi-asserted-by":"crossref","unstructured":"G. Aloysius and D. Binu, An approach to products placement in supermarkets using Prefix Span algorithm, J. King Saud Univ. Comput. Inform. Sci.25 (2013), 77\u201387.","key":"2025120523310290271_j_jisys-2016-0111_ref_003_w2aab3b7b6b1b6b1ab1b6b3Aa","DOI":"10.1016\/j.jksuci.2012.07.001"},{"unstructured":"R. B. A. Bakar, J. Watada and W. Pedrycz, A DNA computing approach to data clustering based on mutual distance order, In: Proceedings 9th Czech-Japan Seminar, pp. 139\u2013145, 2006.","key":"2025120523310290271_j_jisys-2016-0111_ref_004_w2aab3b7b6b1b6b1ab1b6b4Aa"},{"unstructured":"W. Banzaf, P. Nordin, R. Keller and F. Francone, Genetic Programming \u2013 An Introduction, Morgan Kaufmann, San Francisco, CA, 1997.","key":"2025120523310290271_j_jisys-2016-0111_ref_005_w2aab3b7b6b1b6b1ab1b6b5Aa"},{"doi-asserted-by":"crossref","unstructured":"L. Chen and W. Liu, Frequent patterns mining in multiple biological sequences, Comput. Biol. Med.43 (2013), 1444\u20131452.10.1016\/j.compbiomed.2013.07.009","key":"2025120523310290271_j_jisys-2016-0111_ref_006_w2aab3b7b6b1b6b1ab1b6b6Aa","DOI":"10.1016\/j.compbiomed.2013.07.009"},{"unstructured":"C. Eugene, Bayesian network without tears, AI Mag.12 (1991), 50\u201363.","key":"2025120523310290271_j_jisys-2016-0111_ref_007_w2aab3b7b6b1b6b1ab1b6b7Aa"},{"doi-asserted-by":"crossref","unstructured":"S. He, Q. H. Wu and J. R. Saunders, A group search optimizer for neural network training, Lect. Notes Comput. Sci.3982 (2006), 934\u2013943.10.1007\/11751595_98","key":"2025120523310290271_j_jisys-2016-0111_ref_008_w2aab3b7b6b1b6b1ab1b6b8Aa","DOI":"10.1007\/11751595_98"},{"doi-asserted-by":"crossref","unstructured":"S. Hou and X. Zhang, Alarms association rules based on sequential pattern mining algorithm, In: Proceedings of the 5th International Conference on Fuzzy Systems and Knowledge Discovery, Shandong, 2, 556\u2013560, 2008.","key":"2025120523310290271_j_jisys-2016-0111_ref_009_w2aab3b7b6b1b6b1ab1b6b9Aa","DOI":"10.1109\/FSKD.2008.11"},{"doi-asserted-by":"crossref","unstructured":"Z. Z. Htike and S. L. Win, Recognition of promoters in DNA sequences using weightily averaged one-dependence estimators, Proc. Comput. Sci.23 (2013), 60\u201367.10.1016\/j.procs.2013.10.009","key":"2025120523310290271_j_jisys-2016-0111_ref_010_w2aab3b7b6b1b6b1ab1b6c10Aa","DOI":"10.1016\/j.procs.2013.10.009"},{"doi-asserted-by":"crossref","unstructured":"K. Julisch, Data Mining for Intrusion Detection \u2013 A Critical Review, Application of Data Mining in Computer Security, Kluwer Academic Publisher, Boston, MA, 2002.","key":"2025120523310290271_j_jisys-2016-0111_ref_011_w2aab3b7b6b1b6b1ab1b6c11Aa","DOI":"10.1007\/978-1-4615-0953-0_2"},{"unstructured":"D. R. Kawade and K. S. Oza, Exploration of DNA sequences using pattern mining, Int. J. Emerg. Technol. Comput. Appl. Sci.2 (2013), 144\u2013148.","key":"2025120523310290271_j_jisys-2016-0111_ref_012_w2aab3b7b6b1b6b1ab1b6c12Aa"},{"unstructured":"D. R. Kawade and K. S. Oza, Frequent sequential pattern mining with weighted regular expression and length constraint, Int. J. Sci. Res.4 (2015), 3\u20137.","key":"2025120523310290271_j_jisys-2016-0111_ref_013_w2aab3b7b6b1b6b1ab1b6c13Aa"},{"doi-asserted-by":"crossref","unstructured":"K. Lakshmanna and N. Khare, Constraint-based measures for DNA sequence mining using group search optimization algorithm, IJIES9 (2016), 91\u2013100.10.22266\/ijies2016.0930.09","key":"2025120523310290271_j_jisys-2016-0111_ref_014_w2aab3b7b6b1b6b1ab1b6c14Aa","DOI":"10.22266\/ijies2016.0930.09"},{"doi-asserted-by":"crossref","unstructured":"K. Lakshmanna and N. Khare, FDSMO: frequent DNA sequence mining using FBSB and optimization, IJIES9 (2016), 157\u2013166.10.22266\/ijies2016.1231.17","key":"2025120523310290271_j_jisys-2016-0111_ref_015_w2aab3b7b6b1b6b1ab1b6c15Aa","DOI":"10.22266\/ijies2016.1231.17"},{"unstructured":"K. Lakshmanna, K. Rajesh, G. Thippa Reddy, G. Nagaraja and D. V. Subramanian, An enhanced algorithm for frequent pattern mining from biological sequences. Int. J. Pharm. Technol. 8 (2016), 12776\u201312784.","key":"2025120523310290271_j_jisys-2016-0111_ref_016_w2aab3b7b6b1b6b1ab1b6c16Aa"},{"doi-asserted-by":"crossref","unstructured":"K. C. Lin, I. E. Liao, T. P. Chang and S. F. Lin, A frequent itemset mining algorithm based on the principle of inclusion-exclusion and transaction mapping, J. Inform. Sci.276 (2014), 278\u2013289.10.1016\/j.ins.2014.02.060","key":"2025120523310290271_j_jisys-2016-0111_ref_017_w2aab3b7b6b1b6b1ab1b6c17Aa","DOI":"10.1016\/j.ins.2014.02.060"},{"doi-asserted-by":"crossref","unstructured":"J. C.W. Lin, W. Gan, T. P. Hong and V. S. Tseng, Efficient algorithms for mining up-to-date high-utility patterns, J. Adv. Eng. Inform.29 (2015), 648\u2013661.10.1016\/j.aei.2015.06.002","key":"2025120523310290271_j_jisys-2016-0111_ref_018_w2aab3b7b6b1b6b1ab1b6c18Aa","DOI":"10.1016\/j.aei.2015.06.002"},{"unstructured":"X. Lu, Y. Lin, X. Li, Y. Yi, L. Cai and H. Wang, Gene cluster algorithm based on most similarity tree, In: Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region, 2005.","key":"2025120523310290271_j_jisys-2016-0111_ref_019_w2aab3b7b6b1b6b1ab1b6c19Aa"},{"unstructured":"B. Mallick, D. Garg and P. S. Grover, Constraint-based sequential pattern mining: a pattern growth algorithm incorporating compactness, length and monetary, Int. Arab J. Inform. Technol.11 (2014), 33\u201342.","key":"2025120523310290271_j_jisys-2016-0111_ref_020_w2aab3b7b6b1b6b1ab1b6c20Aa"},{"doi-asserted-by":"crossref","unstructured":"F. Masseglia, Poncelet and M. Teisseire, Efficient mining of sequential patterns with time constraints: reducing the combinations, Expert Syst. Appl.36 (2009), 2677\u20132690.10.1016\/j.eswa.2008.01.021","key":"2025120523310290271_j_jisys-2016-0111_ref_021_w2aab3b7b6b1b6b1ab1b6c21Aa","DOI":"10.1016\/j.eswa.2008.01.021"},{"unstructured":"S. Mitra and T. Acharya, Data Mining: Multimedia, Soft Computing, and Bioinformatics, John Wiley & Sons, New York, 2003.","key":"2025120523310290271_j_jisys-2016-0111_ref_022_w2aab3b7b6b1b6b1ab1b6c22Aa"},{"doi-asserted-by":"crossref","unstructured":"A. Nakamura, I. Takigawa, H. Tosaka, M. Kudo and H. Mamitsuka, Mining approximate patterns with frequent locally optimal occurrences, J. Discr. Appl. Math.200 (2016), 123\u2013152.10.1016\/j.dam.2015.07.002","key":"2025120523310290271_j_jisys-2016-0111_ref_023_w2aab3b7b6b1b6b1ab1b6c23Aa","DOI":"10.1016\/j.dam.2015.07.002"},{"doi-asserted-by":"crossref","unstructured":"H. A. Park, T. Kim, M. Li, H. S. Shon, J. S. Park and K. H. Ryu, Application of gap-constraints given sequential frequent pattern mining for protein function prediction, Sci. Direct6 (2015), 12\u2013120.","key":"2025120523310290271_j_jisys-2016-0111_ref_024_w2aab3b7b6b1b6b1ab1b6c24Aa","DOI":"10.1016\/j.phrp.2015.01.006"},{"unstructured":"J. Parmar and S. Garg, Modified web access pattern (mWAP) approach for sequential pattern mining, J. Comput. Sci.6 (2007), 46\u201354.","key":"2025120523310290271_j_jisys-2016-0111_ref_025_w2aab3b7b6b1b6b1ab1b6c25Aa"},{"unstructured":"J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal and M. Hsu, Prefixspan: mining sequential patterns by prefix-projected growth, In: Proceedings of the 17th International Conference on Data Engineering, pp. 215\u2013224, IEEE Computer Society, Washington, DC, 2001.","key":"2025120523310290271_j_jisys-2016-0111_ref_026_w2aab3b7b6b1b6b1ab1b6c26Aa"},{"doi-asserted-by":"crossref","unstructured":"T. Slimani and A. Lazzez, Efficient analysis of pattern and association rule mining approaches, Int. J. Inform. Technol. Comput. Sci. (IJITCS)6 (2014), 70\u201381.10.5815\/ijitcs.2014.03.09","key":"2025120523310290271_j_jisys-2016-0111_ref_027_w2aab3b7b6b1b6b1ab1b6c27Aa","DOI":"10.5815\/ijitcs.2014.03.09"},{"unstructured":"G. G. Wang and S. D. Z. Cui, Monarch butterfly optimization, Neural Comput. Appl. (2015), 1\u201320.","key":"2025120523310290271_j_jisys-2016-0111_ref_028_w2aab3b7b6b1b6b1ab1b6c28Aa"},{"doi-asserted-by":"crossref","unstructured":"G. G. Wang, A. H. Gandomi and A. H. Alavi, Stud krill herd algorithm, J. Neuro Comput.128 (2014), 223\u2013370.","key":"2025120523310290271_j_jisys-2016-0111_ref_029_w2aab3b7b6b1b6b1ab1b6c29Aa","DOI":"10.1016\/j.neucom.2013.08.031"},{"doi-asserted-by":"crossref","unstructured":"G. G. Wang, L. Guo, H. Duan and H. Wang, A new improved firefly algorithm for global numerical optimization, J. Comput. Theor. Nano.11 (2014), 477\u2013485.10.1166\/jctn.2014.3383","key":"2025120523310290271_j_jisys-2016-0111_ref_030_w2aab3b7b6b1b6b1ab1b6c30Aa","DOI":"10.1166\/jctn.2014.3383"},{"doi-asserted-by":"crossref","unstructured":"G. G. Wang, L. Guo, A. H. Gandomi and H. Wang, Chaotic krill herd algorithm, Inf. Sci.274 (2015), 17\u201334.","key":"2025120523310290271_j_jisys-2016-0111_ref_031_w2aab3b7b6b1b6b1ab1b6c31Aa","DOI":"10.1016\/j.ins.2014.02.123"},{"doi-asserted-by":"crossref","unstructured":"G. G. Wang, S. Deb and L. D. S. Coelho, Earthworm optimization algorithm: a bio-inspired metaheuristic algorithm for global optimization problems, Int. J. Bio-Inspired Comput. (2015).","key":"2025120523310290271_j_jisys-2016-0111_ref_032_w2aab3b7b6b1b6b1ab1b6c32Aa","DOI":"10.1007\/s12293-016-0212-3"},{"doi-asserted-by":"crossref","unstructured":"G. G. Wang, S. Deb, A. H. Gandomi, Z. Zhang and A. H. Alavi, Chaotic cuckoo search, Soft Comput.20 (2015), 3349\u20133362.","key":"2025120523310290271_j_jisys-2016-0111_ref_033_w2aab3b7b6b1b6b1ab1b6c33Aa","DOI":"10.1007\/s00500-015-1726-1"},{"doi-asserted-by":"crossref","unstructured":"G. G. Wang, A. H. Gandomi, X. S. Yang and A. H. Alavi, A new hybrid method based on krill herd and cuckoo search for global optimization tasks, Int. J. Bio-Inspired Comput.8 (2016), 286\u2013299.10.1504\/IJBIC.2016.079569","key":"2025120523310290271_j_jisys-2016-0111_ref_034_w2aab3b7b6b1b6b1ab1b6c34Aa","DOI":"10.1504\/IJBIC.2016.079569"},{"doi-asserted-by":"crossref","unstructured":"X. Wu, X. Zhu, Y. He and A. N. Arslan, PMBC: pattern mining from biological sequences with wildcard constraints, Comput. Biol. Med.43 (2013), 481\u2013492.10.1016\/j.compbiomed.2013.02.006","key":"2025120523310290271_j_jisys-2016-0111_ref_035_w2aab3b7b6b1b6b1ab1b6c35Aa","DOI":"10.1016\/j.compbiomed.2013.02.006"},{"unstructured":"E. Yafi, A. A. Hegami, A. Afsar and B. Ranjit, YAMI: incremental mining of interesting association patterns, Int. Arab J. Inform. Technol.9 (2012), 504\u2013510.","key":"2025120523310290271_j_jisys-2016-0111_ref_036_w2aab3b7b6b1b6b1ab1b6c36Aa"},{"doi-asserted-by":"crossref","unstructured":"X. S. Yang and X. He, Firefly algorithm: recent advances and applications, Int. J. Swarm Intell.1 (2013), 36\u201350.10.1504\/IJSI.2013.055801","key":"2025120523310290271_j_jisys-2016-0111_ref_037_w2aab3b7b6b1b6b1ab1b6c37Aa","DOI":"10.1504\/IJSI.2013.055801"},{"doi-asserted-by":"crossref","unstructured":"U. Yun, WIS: weighted interesting sequential pattern mining with a similar level of support and\/or weight, ETRI J.29 (2007), 336\u2013352.10.4218\/etrij.07.0106.0067","key":"2025120523310290271_j_jisys-2016-0111_ref_038_w2aab3b7b6b1b6b1ab1b6c38Aa","DOI":"10.4218\/etrij.07.0106.0067"},{"doi-asserted-by":"crossref","unstructured":"U. Yun and K. H. Ryu, Discovering important sequential patterns with length-decreasing weighted support constraints, Int. J. Inform. Technol. Decis. Making9 (2010), 575\u2013599.10.1142\/S0219622010003968","key":"2025120523310290271_j_jisys-2016-0111_ref_039_w2aab3b7b6b1b6b1ab1b6c39Aa","DOI":"10.1142\/S0219622010003968"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/jisys.2018.27.issue-3\/jisys-2016-0111\/jisys-2016-0111.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0111\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0111\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:32:29Z","timestamp":1764977549000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2016-0111\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,16]]},"references-count":39,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2017,3,16]]},"published-print":{"date-parts":[[2018,7,26]]}},"alternative-id":["10.1515\/jisys-2016-0111"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2016-0111","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"type":"electronic","value":"2191-026X"},{"type":"print","value":"0334-1860"}],"subject":[],"published":{"date-parts":[[2017,3,16]]}}}