Algorithms: longest common subsequence (dynamic programming example)

Publicado el: 02 enero 2021
en el canal de: Frank Stajano Explains

950

This video is part of Professor Frank Stajano's lecture course on Algorithms at the University of Cambridge.

This video contains a third example of dynamic programming in action. Today's problem is to find the longest common subsequence between two strings.

If you find my lectures useful, give the videos a thumbs up. Subscribe and hit the notification bell for more of the same and to encourage me to publish more videos for budding computer scientists. Leave your comments below.

Course web page:
https://www.cl.cam.ac.uk/teaching/cur...

Course handout:
https://www.cl.cam.ac.uk/teaching/202...

My home page:
https://www.cl.cam.ac.uk/~fms27/

En esta página del sitio puede ver el video en línea Algorithms: longest common subsequence (dynamic programming example) de Duración hora minuto segunda en buena calidad , que subió el usuario Frank Stajano Explains 02 enero 2021, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 950 veces y le gustó 70 a los espectadores. Disfruta viendo!

54,509