A greedy approach for computing longest common subsequences

Authors

  • Afroza Begum Department of Computer Science and Engineering, International Islamic University Chittagong, Chittagong, Bangladesh.

Keywords:

Algorithms, alphabet, longest common subsequences, greedy algorithm

Abstract

This paper presents an algorithm for computing Longest Common Subsequences for two sequences. Given two strings XX and YY of length mm and nn, we present a greedy algorithm, which requires O(nlogs)O(nlogs) preprocessing time, where s is distinct symbols appearing in string YY and O(m)O(m) time to determines Longest Common Subsequences.

Downloads

Download data is not yet available.

Downloads

Published

2008-12-31

Issue

Vol. 4 No. 1 (2008): Journal of Prime Research in Mathematics

Section

Regular

How to Cite

A greedy approach for computing longest common subsequences. (2008). Journal of Prime Research in Mathematics, 4(1), 165 – 170. https://jprm.sms.edu.pk/index.php/jprm/article/view/45