8 citations · 8 across the 1 of their papers we have counts for
1 paper
David R. Musser, Gor V. Nishanov
A string matching -- and more generally, sequence matching -- algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of comp…