BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:604@lincs.fr
DTSTART;TZID=Europe/Paris:20210203T110000
DTEND;TZID=Europe/Paris:20210203T120000
DTSTAMP:20210216T132945Z
URL:https://www.lincs.fr/events/edit-distances-string-alignments-and-dynam
 ic-programming/
SUMMARY:Edit distances\, string alignments and dynamic programming
DESCRIPTION:Edit distances quantify how dissimilar two strings are by
 counting the minimum number of edit operation (insertion\, deletion\, etc)
 to transform one string into the other. They are used in computer science
 (approximate string matching\, file comparison\, ...)\, in bioinformatic
 (nucleic acid sequence alignment...)\, etc. This presentation presents the
 main edit distances (Longest Common Subsequence\, Levenshtein\, Hamming\,
 ...)\, and shows how to compute them using dynamic programming.\n\nThis
 presentation was prepared in collaboration with Maxime Raynal (Nokia Bell
 Labs France).\n\nSlides.
CATEGORIES:Network Theory,Working Group,Youtube
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20201025T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR