Title

RISC-based simulation of longest common subsequence algorithm in MIPS64 simulator

College

College of Computer Studies

Department/Unit

Computer Technology

Document Type

Conference Proceeding

Source Title

IEEE Region 10 Annual International Conference, Proceedings/TENCON

Volume

2018-October

First Page

811

Last Page

814

Publication Date

2-22-2019

Abstract

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. © 2018 IEEE.

html

Digitial Object Identifier (DOI)

10.1109/TENCON.2018.8650369

Disciplines

Computer Sciences

Keywords

Reduced instruction set computers

Upload File

wf_yes

This document is currently not available here.

Share

COinS