RISC-Based Simulation of Longest Common Subsequence Algorithm in MIPS64 Simulators

The longest common subsequence (LCS) is an essential technique in the sequence alignment. By deleting zero or more symbols, it determines one of the longest subsequences in a sequence. This paper described a simulation of the algorithm using the EduMIPS64 and MIPSers simulators where the latter implements the most recent developments of MIPS64 instruction sets. The method applied to solve the LCS in this study was the first known solution invented by Wagner and Fischer. The authors programmed the LCS on a RISC architecture and evaluated the results of the test cases by observing the number of clock cycles performed through the simulators. Results show that the MIPSers executed the least number of clock cycles compared to the EduMIPS64 simulator.