you are given a string X of length n and another string Y of length m ≤n. Say, the indexes p1, p2, p3, p4 and q1, q2, q3, q4 form two sub-sequences, i.e., 0 ≤ p1 < p2 < p3 < p4 < n and 0 ≤q1 < q2 < q3 < q4 < n; then, they are non-overlapping if p4 < q1. The task is to count the maximum number of non-overlapping sub-sequences of X that are the same as Y . Thus, if X = GAXTYAWBGTAUGBTABGRGTAXB and Y = GTAB, then the answer is 3 as shown by the red fonts. We cannot select the underlined GTAB as it overlaps with a red GTAB (i.e., among overlapping sub-sequences, you can select only one of them). Describe an O(m + n) time algorithm to obtain the count. Write a pseudo-code.
you are given a string X of length n and another string Y of length m ≤n. Say, the indexes p1, p2, p3, p4 and q1, q2, q3, q4 form two sub-sequences, i.e., 0 ≤ p1 < p2 < p3 < p4 < n and 0 ≤q1 < q2 < q3 < q4 < n; then, they are non-overlapping if p4 < q1. The task is to count the maximum number of non-overlapping sub-sequences of X that are the same as Y . Thus, if X = GAXTYAWBGTAUGBTABGRGTAXB and Y = GTAB, then the answer is 3 as shown by the red fonts. We cannot select the underlined GTAB as it overlaps with a red GTAB (i.e., among overlapping sub-sequences, you can select only one of them). Describe an O(m + n) time algorithm to obtain the count. Write a pseudo-code.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Computer Science
you are given a string X of length n and another string Y of length m ≤n. Say,
the indexes p1, p2, p3, p4 and q1, q2, q3, q4 form two sub-sequences, i.e., 0 ≤ p1 < p2 < p3 < p4 < n
and 0 ≤q1 < q2 < q3 < q4 < n; then, they are non-overlapping if p4 < q1.
The task is to count the maximum number of non-overlapping sub-sequences of X that are the
same as Y . Thus, if X = GAXTYAWBGTAUGBTABGRGTAXB and Y = GTAB, then the answer is
3 as shown by the red fonts. We cannot select the underlined GTAB as it overlaps with a red GTAB
(i.e., among overlapping sub-sequences, you can select only one of them).
Describe an O(m + n) time
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY