{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T18:15:49Z","timestamp":1762020949371,"version":"build-2065373602"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s12652-020-02013-y","type":"journal-article","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T14:02:19Z","timestamp":1588341739000},"page":"485-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An efficient algorithm for identifying (\u2113, d) motif from huge DNA datasets"],"prefix":"10.1007","volume":"12","author":[{"given":"M. Mohamed Divan","family":"Masood","sequence":"first","affiliation":[]},{"given":"A. R.","family":"Arunarani","sequence":"additional","affiliation":[]},{"given":"D.","family":"Manjula","sequence":"additional","affiliation":[]},{"given":"Vijayan","family":"Sugumaran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,1]]},"reference":[{"issue":"1","key":"2013_CR1","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"MI Abouelhoda","year":"2004","unstructured":"Abouelhoda MI, Kurtz S, Ohlebusch E (2004) Replacing suffix trees with enhanced suffix arrays. J Discret Algorithms 2(1):53\u201386","journal-title":"J Discret Algorithms"},{"issue":"2","key":"2013_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s13205-012-0074-4","volume":"3","author":"F Adzitey","year":"2013","unstructured":"Adzitey F, Huda N, Ali GRR (2013) Molecular techniques for detecting and typing of bacteria, advantages and application to foodborne pathogens isolated from ducks. 3 Biotech 3(2):97\u2013107","journal-title":"3 Biotech"},{"issue":"4","key":"2013_CR3","doi-asserted-by":"publisher","first-page":"40","DOI":"10.4018\/IJIIT.2019100103","volume":"15","author":"IT Afolabi","year":"2019","unstructured":"Afolabi IT, Makinde OS, Oladipupo O (2019) Semantic web mining for content-based online shopping recommender systems. Int J Intell Inf Technol 15(4):40\u201351","journal-title":"Int J Intell Inf Technol"},{"issue":"2","key":"2013_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.4018\/IJIIT.2020040101","volume":"16","author":"S Bagui","year":"2020","unstructured":"Bagui S, Devulapalli K, John S (2020) MapReduce implementation of a multinomial and mixed naive bayes classifier. Int J Intell Inf Technol 16(2):37\u201346","journal-title":"Int J Intell Inf Technol"},{"key":"2013_CR5","first-page":"28","volume":"2","author":"TL Bailey","year":"1994","unstructured":"Bailey TL, Elkan C (1994) Fitting a mixture model by expectation maximization to discover motifs in biopolymers. PubMed 2:28\u201336","journal-title":"PubMed"},{"issue":"12","key":"2013_CR6","doi-asserted-by":"publisher","first-page":"1653","DOI":"10.1093\/bioinformatics\/btr261","volume":"27","author":"TL Bailey","year":"2011","unstructured":"Bailey TL (2011) DREME: motif discovery in transcription factor ChIP-seq data. Bioinformatics 27(12):1653\u20131659","journal-title":"Bioinformatics"},{"issue":"3","key":"2013_CR7","doi-asserted-by":"publisher","first-page":"24","DOI":"10.4018\/IJIIT.2019070102","volume":"15","author":"S Balasubramanian","year":"2019","unstructured":"Balasubramanian S, Geetha TV (2019) A new dynamic neighbourhood-based semantic dissimilarity measure for ontology. Int J Intell Inf Technol 15(3):24\u201341","journal-title":"Int J Intell Inf Technol"},{"issue":"4","key":"2013_CR8","doi-asserted-by":"publisher","first-page":"805","DOI":"10.3390\/a6040805","volume":"6","author":"S Bandopadhyay","year":"2013","unstructured":"Bandopadhyay S, Sahni S, Rajasekaran S (2013) PMS6MC: a multicore algorithm for motif discovery. Algorithms 6(4):805\u2013823","journal-title":"Algorithms"},{"issue":"1","key":"2013_CR9","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1186\/1471-2105-7-488","volume":"7","author":"S Brohee","year":"2006","unstructured":"Brohee S, Helden JV (2006) Evaluation of clustering algorithms for protein-protein interaction networks. BMC Bioinform 7(1):488\u2013506","journal-title":"BMC Bioinform"},{"issue":"23","key":"2013_CR10","doi-asserted-by":"publisher","first-page":"3221","DOI":"10.1093\/bioinformatics\/btr552","volume":"27","author":"C Cheng","year":"2011","unstructured":"Cheng C, Min R, Gerstein M (2011) TIP: a probabilistic method for identifying transcription factor target genes from ChIP-seq binding profiles. Bioinformatics 27(23):3221\u20133227","journal-title":"Bioinformatics"},{"key":"2013_CR11","doi-asserted-by":"crossref","unstructured":"Chiu B, Keogh E, Lonardi S (2003) Probabilistic discovery of time series motifs. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, 493\u2013498.","DOI":"10.1145\/956750.956808"},{"issue":"1","key":"2013_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) Mapreduce: simplified data processing on large clusters. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"2013_CR13","unstructured":"Dongen SV (2000) Graph clustering by flow simulation. Ph.D. dissertation, University of Utrecht, Utrecht, The Netherlands"},{"issue":"10","key":"2013_CR14","doi-asserted-by":"publisher","first-page":"e967","DOI":"10.1371\/journal.pone.0000967","volume":"2","author":"RJ Edwards","year":"2007","unstructured":"Edwards RJ, Davey NE, Shields DC (2007) SLiMFinder: a probabilistic method for identifying over-represented, convergently evolved, short linear motifs in proteins. PLoS ONE 2(10):e967","journal-title":"PLoS ONE"},{"issue":"3","key":"2013_CR15","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0304-3975(03)00320-7","volume":"306","author":"PA Evans","year":"2003","unstructured":"Evans PA, Smith AD, Wareham HT (2003) On the complexity of finding common approximate substring. Theor Comput Sci 306(3):407\u2013430","journal-title":"Theor Comput Sci"},{"issue":"3","key":"2013_CR16","doi-asserted-by":"publisher","first-page":"38","DOI":"10.4018\/IJIIT.2018070103","volume":"14","author":"K Fatehi","year":"2018","unstructured":"Fatehi K, Rezvani M, Fateh M, Pajoohan MR (2018) Subspace clustering for high-dimensional data using cluster structure similarity. Int J Intell Inf Technol 14(3):38\u201355","journal-title":"Int J Intell Inf Technol"},{"key":"2013_CR17","doi-asserted-by":"crossref","unstructured":"Fischer J, M\u00e4kinen V, V\u00e4lim\u00e4ki N (2008) Space efficient string mining under frequency constraints. In: Data mining 2008 ICDM'08 eighth IEEE international conference on IEEE, pp 193\u2013202","DOI":"10.1109\/ICDM.2008.32"},{"issue":"9","key":"2013_CR18","doi-asserted-by":"publisher","first-page":"2997","DOI":"10.1093\/nar\/10.9.2997","volume":"10","author":"DS Gary","year":"1982","unstructured":"Gary DS, Thomas DS, Larry G, Andrzej E (1982) Use of the \u2018Perceptron\u2019 algorithm to distinguish translational initiation sites in E. coli. Nucleic Acids Res 10(9):2997\u20133011","journal-title":"Nucleic Acids Res"},{"issue":"1","key":"2013_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.4018\/IJIIT.2020010102","volume":"16","author":"KS Gayathri","year":"2020","unstructured":"Gayathri KS, Easwarakumar KS, Elias S (2020) Fuzzy ontology based activity recognition for assistive health care using smart home. Int J Intell Inf Technol 16(1):17\u201331","journal-title":"Int J Intell Inf Technol"},{"issue":"5","key":"2013_CR20","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1006\/jmbi.2000.3519","volume":"296","author":"JD Hughes","year":"2000","unstructured":"Hughes JD, Estep PW, Tavazoie S, Church GM (2000) Computational identification of cis-regulatory elements associated with groups of functionally related genes in Saccharomyces cerevisiae. J Mol Biol 296(5):1205\u20131214","journal-title":"J Mol Biol"},{"issue":"2","key":"2013_CR21","first-page":"126","volume":"2","author":"M Karin","year":"1990","unstructured":"Karin M (1990) Too many transcription factors: positive and negative interactions. New Biol 2(2):126\u2013131","journal-title":"New Biol"},{"issue":"1","key":"2013_CR22","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1002\/prot.340070105","volume":"7","author":"CE Lawrence","year":"1990","unstructured":"Lawrence CE, Andrew AR (1990) An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins Struct Funct Bioinform 7(1):41\u201351","journal-title":"Proteins Struct Funct Bioinform"},{"issue":"5131","key":"2013_CR23","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1126\/science.8211139","volume":"262","author":"CE Lawrence","year":"1993","unstructured":"Lawrence CE, Altschul SF, Boguski M, Liu JS, Neuwald AF, Wootton JC (1993) Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Science 262(5131):208\u2013214","journal-title":"Science"},{"issue":"7","key":"2013_CR24","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1093\/bioinformatics\/17.7.622","volume":"17","author":"R Liu","year":"2001","unstructured":"Liu R, Blackwell TW, States DJ (2001) Conformational model for binding site recognition by the E. coli MetJ transcription factor\u2019. Bioinformatics 17(7):622\u2013633","journal-title":"Bioinformatics"},{"issue":"3","key":"2013_CR25","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1038\/mt.2016.10","volume":"24","author":"ML Maeder","year":"2016","unstructured":"Maeder ML, Gersbach CA (2016) Genome-editing technologies for gene and cell therapy. Mol Ther 24(3):430\u2013446","journal-title":"Mol Ther"},{"key":"2013_CR26","unstructured":"Manber U, Myers G (1990) Suffix arrays: a new method for online string searches. Proceedings of the first annual ACM-SIAM symposium on discrete algorithms, 319\u2013327"},{"key":"2013_CR27","first-page":"269","volume":"8","author":"PA Pevzner","year":"2000","unstructured":"Pevzner PA, Sze SH (2000) Combinatorial approaches to finding subtle signals in DNA sequences. Proc ISMB 8:269\u2013278","journal-title":"Proc ISMB"},{"issue":"12","key":"2013_CR28","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1093\/bioinformatics\/btu093","volume":"30","author":"D Quang","year":"2014","unstructured":"Quang D, Xie X (2014) EXTREME: an online EM algorithm for motif discovery. Bioinformatics 30(12):1667\u20131673","journal-title":"Bioinformatics"},{"issue":"5","key":"2013_CR29","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1093\/dnares\/dsp014","volume":"16","author":"AA Sharov","year":"2009","unstructured":"Sharov AA, Ko MSH (2009) Exhaustive search for overrepresented DNA sequence motifs with CisFinder. DNA Res 16(5):261\u2013273","journal-title":"DNA Res"},{"issue":"1","key":"2013_CR30","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1186\/1471-2105-7-486","volume":"7","author":"K Shida","year":"2006","unstructured":"Shida K (2006) GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima. BMC Bioinform 7(1):486\u2013503","journal-title":"BMC Bioinform"},{"issue":"14","key":"2013_CR31","doi-asserted-by":"publisher","first-page":"e454","DOI":"10.1093\/bioinformatics\/btl227","volume":"22","author":"S Sinha","year":"2006","unstructured":"Sinha S (2006) On counting position weight matrix matches in a sequence, with application to discriminative motif finding. Bioinformatics 22(14):e454\u2013e463","journal-title":"Bioinformatics"},{"issue":"2","key":"2013_CR32","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1002\/path.2638","volume":"220","author":"RJ Taft","year":"2010","unstructured":"Taft RJ, Pang KC, Mercer TR, Dinger M, Mattick JS (2010) Non-coding RNAs: regulators of disease. J Pathol 220(2):126\u2013139","journal-title":"J Pathol"},{"issue":"12","key":"2013_CR33","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1093\/bioinformatics\/17.12.1113","volume":"17","author":"G Thijs","year":"2001","unstructured":"Thijs G, Lescot M, Marchal K, Rombauts S, Moor B, Rouze P, Moreau Y (2001) A higher-order background model improves the detection of promoter regulatory elements by Gibbs sampling. Bioinformatics 17(12):1113\u20131122","journal-title":"Bioinformatics"},{"issue":"2","key":"2013_CR34","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S1672-0229(07)60023-0","volume":"5","author":"W Wei","year":"2007","unstructured":"Wei W, Yu XD (2007) Comparative analysis of regulatory motif discovery tools for transcription factor binding sites. Genom Proteom Bioinform 5(2):131\u2013142","journal-title":"Genom Proteom Bioinform"},{"issue":"10","key":"2013_CR35","doi-asserted-by":"publisher","first-page":"e48442","DOI":"10.1371\/journal.pone.0048442","volume":"7","author":"Q Yu","year":"2012","unstructured":"Yu Q, Huo H, Zhang Y, Guo H (2012) PairMotif: a new pattern-driven algorithm for planted (l, d) DNA motif search. PLoS ONE 7(10):e48442","journal-title":"PLoS ONE"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-020-02013-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12652-020-02013-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-020-02013-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T13:04:50Z","timestamp":1620047090000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12652-020-02013-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,1]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["2013"],"URL":"https:\/\/doi.org\/10.1007\/s12652-020-02013-y","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"type":"print","value":"1868-5137"},{"type":"electronic","value":"1868-5145"}],"subject":[],"published":{"date-parts":[[2020,5,1]]},"assertion":[{"value":"2 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}