Thank you! I used to do private tutoring while I studied at university, so I guess I miss explaining this stuff :D Teaching is a good way of learning, nothing quite makes you understand a subject like having to break it down for someone else. Your videos have a nice easy-to-understand presentation and great visuals, I'd love to see your take on some more advanced topics! I'm sure you'll get there in time :)
Very nice tutorial! I was wondering: what dev environment do you use here in the video? It seem to be some kind of Jupyter Notebook with some nice cusomization... How did you customize?
@@BigPython I played with the styles a little bit, and figured, that you were using the grade3 style. However my understanding of the openstyles, that is has to applied to the browser itself. Is that correct? Do you mind sharing your style?
@@lammelmiklos3765 Yes, it's applied at the browser level. I've added my current CSS to the git repo, feel free to have a look :) github.com/tkarabela/bigpython/blob/master/jupyter-grade3-bigpython.css
In the Wagner-Fisher algorithm, when computing d[i, j] you take minimum of the neighbors d[i-1, j], d[i, j-1], d[i-1, j-1] with cost of the operation added to each. Usually all the costs (weights) are set to 1, except for the case of d[i-1, j-1] when a[i-1] == b[j-1] (which is a match, so it should not add to the distance).
