3. Common Subwords and Subsequences
The chapter focuses on the concepts of common subwords and subsequences, specifically the longest common subword problem. It introduces various methods for determining the length of the longest common subword between two sequences, including brute force and dynamic programming approaches, while also demonstrating how to recover the actual subword from these computations.
Enroll to start learning
You've not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
Sections
Navigate through the learning materials and practice exercises.
What we have learnt
- The longest common subword can be found within two given strings by identifying matching segments.
- Different algorithms, including brute force and dynamic programming, can be employed to compute the length of the longest common subword efficiently.
- The relationship between letters in sequences helps in structuring a solution to find common subwords inductively.
Key Concepts
- -- Longest Common Subword
- The longest segment that appears in the same order in two sequences.
- -- Brute Force Algorithm
- An exhaustive method that attempts all possible positions in two strings to find the longest common subword.
- -- Dynamic Programming
- An optimization approach used to solve complex problems by breaking them down into simpler subproblems and storing results to avoid repetitive calculations.
- -- Inductive Structure
- A method of solving problems where solutions to smaller instances help build up to the solution of larger instances.
Additional Learning Materials
Supplementary resources to enhance your learning experience.