Skip to content

CE205 Data Structures

Week-11

String Data Structures

Download PDF,DOCX, SLIDE, PPTX


Outline

  • Strings -Longest common subsequence problem
    • Longest increasing subsequence
    • Hunt–Szymanski algorithm (Hunt Macllory)
    • Levenshtein distance
    • Wagner–Fischer algorithm
  • String Alignment
    • Needleman Wunsch
    • Smith Waterman
    • Hunt Macllory
  • String Tokenizer
  • String Comparison

Strings


Longest common subsequence problem


Longest common subsequence problem

Longest increasing subsequence

Longest common subsequence problem

Hunt–Szymanski algorithm (Hunt Macllory)

Longest common subsequence problem

Levenshtein distance

Longest common subsequence problem

Wagner–Fischer algorithm

String Alignment


String Alignment

Needleman Wunsch

String Alignment

Smith Waterman

String Alignment

Hunt Macllory

String Tokenizer


String Comparison


\[ End-Of-Week-11 \]