Sciweavers

IR
2008
13 years 11 months ago
Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance
We develop efficient dynamic programming algorithms for pattern matching with general gaps and character classes. We consider patterns of the form p0g(a0, b0)p1g(a1, b1) . . . pm-1...
Kimmo Fredriksson, Szymon Grabowski
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
14 years 5 months ago
A reconfigurable architecture for scanning biosequence databases
—Unknown protein sequences are often compared to a set of known sequences (a database scan) to detect functional similarities. Even though efficient dynamic programming algorithm...
Timothy F. Oliver, Bertil Schmidt, Douglas L. Mask...