Back to Results
First PageMeta Content
Suffix array / Substring / Dynamic programming / Computing / Computer programming / Rope / Longest common substring problem / String / Binary trees / Arrays


Computing minimal and maximal suffixes of a substring revisited Maxim Babenko1 Pawel Gawrychowski2 Tomasz Kociumaka3 Tatiana Starikovskaya1 National Research University Higher School of Economics (HSE) Max-Planck-Institu
Add to Reading List

Document Date: 2014-06-18 11:22:46

Open Document

File Size: 1.010,99 KB

Share Result on Facebook
UPDATE