ASCII based Sequential Multiple Pattern Matching Algorithm for High Level Cloning

For high level of clones, the ongoing (present) research scenario for detecting clones is focusing on developing better algorithm. For this purpose, many algorithms have been proposed but still we require the methods that are more efficient and robust. Pattern matching is one of those favorable algorithms which is having that required potential in research of computer science. The structural clones of high level clones comprised lower level smaller clones with similar code fragments. In this repetitive occurrence of simple clones in a file may prompt higher file level clones. The proposed algorithm detects repetitive patterns in same file and clones at higher level of abstraction like file. In genetic area, there are a number of algorithms that are being used to identify DNA sequence. When compared with some of the existing algorithms the proposed algorithm for ASCII based sequential multiple pattern matching gives better performance. The present method increases overall performance and gradually decline the number of comparisons and character per comparison proportion by repudiating (avoid) unnecessary DNA comparisons.

@article{Singh2017,
  title     = {ASCII based Sequential Multiple Pattern Matching Algorithm for High Level Cloning},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {8},
  number    = {6},
  year      = {2017},
  publisher = {The Science and Information Organization},
  author    = {Manu Singh and Vidushi Sharma},
  doi       = {10.14569/IJACSA.2017.080635},
  url       = {https://doi.org/10.14569/IJACSA.2017.080635}
}