Skip to main content
Figure 2 | BMC Bioinformatics

Figure 2

From: Fast online and index-based algorithms for approximate search of RNA sequence-structure patterns

Figure 2

DP tables for the sequence-structure alignment computation of RSSPQ=(AAGUUUC,..(...)) and window substring T = ACCCUCUU when scanning a sequence S with algorithm ScanAlign . Only the entries in red have to be computed for each window shift, whereas the entries in green are reused. Entries in yellow boxes are on a possible minimizing path for alignments with up to d = 1 indels. The following operation costs were used: ωd = ωm = 1, ωb = ωa = 2, and ωr = 3.

Back to article page