Please introduce KMP failure function / failure table graph - search into finding best clip method
studentutu opened this issue · comments
Roman Fedorov commented
There is an optimal O(k+m) approach for finding best matches in strings, we could use the same exact approach for finding best suitable clip, by using what is called failure function / failure table graph to find the most suitable clip inside a search space.
Details on the failure table graph here, but we will need to construct it first ( in editor)
https://www.youtube.com/watch?v=cYLGDMgq86s