作者: Kuruva Lakshmanna , , Neelu Khare ,
DOI: 10.22266/IJIES2016.1231.17
关键词: Process (computing) 、 Word error rate 、 DNA sequencing 、 Regular expression 、 Sequence 、 Data mining 、 Scalability 、 Prefix 、 Bitmap 、 Computer science
摘要: DNA Sequence mining helps in discovering the patterns which can occur frequently, structures of data sets. Frequent pattern is a central strategy for affiliation guideline discovery, but existing calculations experience ill effects low effectiveness or poor error rate on grounds that natural groupings vary from general successions with more attributes. In our last work, we proposed Prefix Span Group Search Optimization (PSGSO) to optimize mined results method. We propose new method called Mining using (FDSMO) combines Biological based Bitmap (FBSB) and Hybrid Firefly (HFGSO) this paper. The FDSMO process includes three stages: (i) applying (ii) calculate length, width regular expression (iii) optimization HFGSO. exploratory demonstrate performs better than methods, both terms running time scalability.