Abstract

paper presents an efficient classification algorithm for categorizing evolutionary organisms using slicing techniques. Dynamic slicing excels in tracing out dependencies between executable statements. The nature of these dependencies aids in the determination of control statements in a program. Dynamic slicing technique imbibes the run time execution trace based on a slicing criterion. Dynamic slicing algorithms can trace both the backward and forward dependencies. The UML model is automatically generated from the source code to validate the forward and backward dynamic slicing algorithm. This paper shows the algorithmic implementation in NetBeans IDE 7.4. It provides a new platform for automated software engineering. The algorithm efficiently discovers the evolutionary relationship between organisms .Forward dynamic slicing algorithm helps in identifying the successors of the organisms and the backward dynamic slicing algorithm finds out the predecessors of the evolutionary organisms. Both the algorithms are based on dynamic slicing criterion at the run time execution trace. The integration of these phylogenetic algorithms deciphers the building complexity of the evolutionary organisms. It proves to have an advantageous classification encasement for jeopardized species.

Full Text
Published version (Free)

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 call