This document discusses Longest Common Subsequence (LCS) and provides an example. It begins with an introduction that defines LCS as the longest sequence of characters common between two or more strings. It then discusses applications of LCS in bioinformatics, plagiarism detection, and version control systems. An example is provided comparing the strings 'ABCD' and 'ACDF' where the LCS is 'ACD'. The document concludes with a step-by-step simulation of finding the LCS between the strings 'R,G,B,G,A,R' and 'B,G,R,A,R', which is 'BGAR'.

1. Green University of Bangladesh
Longest Common Subsequence(LCS)
Submited By
Md. Murad Hossain (213002132)
Md Asaduzzaman (213002257)
Submited To
Jargis Ahmed
Lecturer & Program Coordinator
Dept. Of CSE
Green University of Bangladesh

2. Content
Introduction
What is LCS?
Applications of LCS
Pseudocode
Example & Simulation

3. Introduction
Longest Common Subsequence (LCS) is a concept that has applications in
various fields, from computer science to bioinformatics. LCS refers to the
longest sequence of characters that are common between two or more
strings. Also on LCS always prove that it can be solved any complex
problem at a time.

4. What is LCS?
LCS is a concept that is commonly used in computer science and other fields to
find similarities between different strings.
It refers to the longest sequence of characters that are common between two
or more strings. For example, if we have two strings 'ABCD' and 'ACDF', the LCS
between them would be 'ACD'.

6. Applications of LCS
01. In Bioinformatics.
02. In Plagiarism Detection. 03. In Version Control Systems.

7. PesuCode

8. Example & Simulation
Let us understand LCS with an example.
S1 = {R,G,B,G,A,R}
S2 = {B,G,R,A,R}
Among these subsequences, {B,G,A,R} is the longest common subsequence

9. Simulation
Step-1
j
i

10. Step-2:
j
i

11. Step-3:
j
i

12. Step-4:
j
i

13. Step-5:
j
i

14. Step-6:
j
i

15. Step-7:
Result: “BGAR”
j
i

16. THANK YOU