Figure 1.
Simplified overview of the bound-and-align strategy implemented in QuickEd. Each square represents a DP-tile (64 × 64 DP-elements). (1) A windowed algorithm computes s^. (2) A score-bounded alignment algorithm uses s^ continually to reduce the number of DP-tiles computed.

Simplified overview of the bound-and-align strategy implemented in QuickEd. Each square represents a DP-tile (64 × 64 DP-elements). (1) A windowed algorithm computes s^⁠. (2) A score-bounded alignment algorithm uses s^ continually to reduce the number of DP-tiles computed.

Close
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close

This PDF is available to Subscribers Only

View Article Abstract & Purchase Options

For full access to this pdf, sign in to an existing account, or purchase an annual subscription.

Close