Abstract
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.
Highlights
A software system is constantly changing, and consistent maintenance is required to help it adapt to the new changes
This paper investigates the applicability of a new technique of pattern matching approach called ASCII based Pattern Matching algorithm, for detection of high level clone in source code
The DNA Sequence data has been taken from the Multiple Skip Multiple Pattern Matching algorithm Multiple Skip Multiple Pattern Matching Algorithm (MSMPMA) [9] for testing the proposed algorithm
Summary
A software system is constantly changing, and consistent maintenance is required to help it adapt to the new changes. This paper investigates the applicability of a new technique of pattern matching approach called ASCII based Pattern Matching algorithm, for detection of high level clone in source code. High Level Clones are classified [4] in structural clone, concept clone, behavioural clone [5] and domain model clone This classification depicts that structural clones are formed by similar fragments of code at low level. This approach avoids lengthy comparisons in string sequence and reduces the effort for each character comparison at each attempt.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Advanced Computer Science and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
