8 search results - page 2 / 2 » Strings with Maximally Many Distinct Subsequences and Substr... |
LATIN
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
IJFCS
2006
13 years 4 months ago
2006
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
PAMI
2007
13 years 4 months ago
2007
—The choice of a color model is of great importance for many computer vision algorithms (e.g., feature detection, object recognition, and tracking) as the chosen color model indu...