摘要 |
To determine optimal alignment of two molecules, an alignment space of two strings representing element sequences of the molecules is conceived as a grid of cells, where each cell represents alignments between substrings of the two strings. The cells are tested against conditions that are framed, in the context of the (wh)-density global alignment problem. Two such conditions do not require an examination of the actual characters of the strings, and are hence computed with relative speed. A third condition, which involves examination of the characters in the string further prunes the cells that are to be considered.
|