Scribd Logo
Upload

Welcome to Scribd!

  • WINSEM2022-23 BCSE204L TH VL2022230502882 Reference Material I 06-02-2023 2. String Matching KMP

    Uploaded by

    Samir Shah
    5 views21 pages
    The Knuth-Morris-Pratt (KMP) string matching algorithm finds occurrences of a "word" W within a main "text string" T. It has optimal O(m+n) runtime and never needs to move backwards in T, making it efficient for large files. However, it is less effective when the alphabet size increases and there are more chances of mismatch.

    Original Description:

    Original Title

    WINSEM2022-23_BCSE204L_TH_VL2022230502882_Reference_Material_I_06-02-2023_2._String_Matching_KMP

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The Knuth-Morris-Pratt (KMP) string matching algorithm finds occurrences of a "word" W within a main "text string" T. It has optimal O(m+n) runtime and never needs to move backwards in T, making it efficient for large files. However, it is less effective when the alphabet size increases and there are more chances of mismatch.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views21 pages

    WINSEM2022-23 BCSE204L TH VL2022230502882 Reference Material I 06-02-2023 2. String Matching KMP

    Uploaded by

    Samir Shah
    The Knuth-Morris-Pratt (KMP) string matching algorithm finds occurrences of a "word" W within a main "text string" T. It has optimal O(m+n) runtime and never needs to move backwards in T, making it efficient for large files. However, it is less effective when the alphabet size increases and there are more chances of mismatch.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 21

    String Matching Algorithm

    Knuth Morris and Pratt algorithm

    1
    KMP- Knuth Morris and Pratt algorithm
    KMP algorithm
    Advantages:
    • The running time of the KMP algorithm is optimal (O(m + n)), which is very
    fast.
    • The algorithm never needs to move backwards in the input text T. It makes
    the algorithm good for processing very large files

    Disadvantages:
    • Doesn’t work so well as the size of the alphabets increases
    • By which more chances of mismatch occurs.

    You might also like