Skip to main content


Figure 1 | Algorithms for Molecular Biology

Figure 1

From: Fast local fragment chaining using sum-of-pair gap costs

Figure 1

Graphical representation of fragments and chaining connections. Graphical representation of fragments as blocks with their respective database and query positions. All valid chaining connections are depicted as edges including their distance on database x and query sequence y. Note that f1 and f3 can not be chained due to their overlap on the query sequence y.

Back to article page