DefinePK

DefinePK hosts the largest index of Pakistani journals, research articles, news headlines, and videos. It also offers chapter-level book search.

Select Collection

A greedy approach for computing longest common subsequences

Article Information

Get PDF View Article
Login to Add in Library

Title: A greedy approach for computing longest common subsequences

Authors: Afroza Begum

Journal: Journal of Prime Research in Mathematics

HEC Recognition History
Category From To
Y 2023-07-01 2024-09-30
Y 2022-07-01 2023-06-30
Y 2021-07-01 2022-06-30
Y 2020-07-01 2021-06-30

Publisher: Abdus Salam School of Mathematical Sciences, GC University

Country: Pakistan

Year: 2008

Volume: 1

Issue: 1

Language: English

Categories
Computer Science (14978) String Matching (2) Algorithms (766) Dynamic Programming (3) Computational Biology (251)

Abstract

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

Paper summary is not available for this article yet.

Loading PDF...

Loading Statistics...