View Single Post
Old 04-15-2017, 09:48 AM   #37
Junior Member
Location: Brasil

Join Date: Apr 2017
Posts: 2
Default A Fast Algorithm for th inexact Characteristic String Problem - Doubt

Hi Guys,


Has anyone read this article?

I have question about ring buffer of this article...

The page 11/12 the article explains for us that algorithm acess lines 14 and 15 of algorithm and posErr is with value k+1, but I was testing and the value is k and the algoritm Assumes negative values ​​for the ring buffer posErr....

Can someone who knows this problem help me understand how to work with this ring buffer, or am I analyzing it wrong?

lucasrocha is offline   Reply With Quote