Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    LCS, ENGR 62, Stanford

    Uploaded by

    suudsfiin
    The document discusses the longest common subsequence problem. It contains two input strings and a table showing the length of the longest common subsequence between prefixes of the two strings. The table starts with zeros and increases the count by 1 when the characters at the current position in both strings match.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as XLS, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    LCS, ENGR 62, Stanford

    Uploaded by

    suudsfiin
    13 views1 page
    The document discusses the longest common subsequence problem. It contains two input strings and a table showing the length of the longest common subsequence between prefixes of the two strings. The table starts with zeros and increases the count by 1 when the characters at the current position in both strings match.

    Original Description:

    , ENGR 62, Stanford

    Original Title

    Lcs, ENGR 62, Stanford

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    XLS, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses the longest common subsequence problem. It contains two input strings and a table showing the length of the longest common subsequence between prefixes of the two strings. The table starts with zeros and increases the count by 1 when the characters at the current position in both strings match.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as XLS, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xls, pdf, or txt
    13 views1 page

    LCS, ENGR 62, Stanford

    Uploaded by

    suudsfiin
    The document discusses the longest common subsequence problem. It contains two input strings and a table showing the length of the longest common subsequence between prefixes of the two strings. The table starts with zeros and increases the count by 1 when the characters at the current position in both strings match.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as XLS, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xls, pdf, or txt
    of 1

    Longest common subsequence

    String 1 String 2 T A C A T G 0 0 0 0 0 0 0

    A 0 0 1 1 1 1 1

    C 0 0 1 2 2 2 2

    T 0 1 1 2 2 3 3

    T 0 1 1 2 2 3 3

    G 0 1 1 2 2 3 4

    String 1 String 2 T A C A T G

    T T T AC AC ACT ACT

    T T T AC AC ACT ACT

    G T T AC AC ACT ACTG

    A A A A A

    A AC AC AC AC

    You might also like