The problem parameters
A particular DP problem is posed by a specific input sequence x.
A sequence of what? Just anything. Letters from an alphabet, nucleotides, amino acids, mass peak values, dreams, excuses... Any kinds of objects that our scoring function can deal with! Normally, we think of them as "letters" from an underlying "alphabet".
A note on finiteness
All candidates considered must correspond to the input, in the sense that the "letters" of x re-occur in the original order at the leaves of a candidate tree for x.
Check this out ...
background image
university bielefeld AG PI BiBiServ
ambient picture