Skip to content

S1L11 - Optimal choice Levensthein #42

Open
Open
S1L11 - Optimal choice Levensthein#42
Labels
S1L11Semester 1, Lecture 11 related issuematerialIssue is about the course content
@BuzzYbis

Description

@BuzzYbis
BuzzYbis
opened on May 2, 2025

S1L11 - Optimal choice Levensthein

In section 11.1.1, we state that when two letters are equal, the optimal choice is always $D[i-1,j-1]$. Therefore no minimum calculation to do.

The goal of this issue is adding the proof that this choice is indeed optimal.

Metadata

Metadata

Assignees

No one assigned

    Labels

    S1L11Semester 1, Lecture 11 related issuematerialIssue is about the course content

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions