How many runs can a string contain?

In 2000 Kolpakov and Kucherov showed that the maximum number p(n) of runs in any string is O(n), but their proof was nonconstructive and provided no specific constant of proportionality. At the same time, they presented experimental data to prompt the conjecture: <(n)<(n)