The prefix table of a string is one of the most fundamental data structures of algorithms on
strings: it determines the longest factor at each position of the string that matches a prefix of
the string. It can be computed in time linear with respect to the size of the string, and hence it
can be used efficiently for locating patterns or for regularity searching in strings. A weighted
string is a string in which a set of letters may occur at each position with respective
occurrence probabilities. Weighted strings, also known as position weight matrices, naturally …

The prefix table of a string is one of the most fundamental data structures of algorithms on
strings: it determines the longest factor at each position of the string that matches a prefix of
the string. It can be computed in time linear with respect to the size of the string, and hence it
can be used efficiently for locating patterns or for regularity searching in strings. A weighted
string is a string in which a set of letters may occur at each position with respective
occurrence probabilities. Weighted strings, also known as position weight matrices or …