Skip to main content
. 2022 Aug 17;23(16):9249. doi: 10.3390/ijms23169249

Figure 2.

Figure 2

New search strategy to identify existing dual graphs. (A) As shown by two examples, we now include DNA chains that have strong interactions with RNA chains, and separate broken subchains. (B) The first round of the search algorithm groups all interacting subchains to find independent substructures and assigns corresponding dual graphs. (C) The second round refines large substructures with >9 helices using BGSU representative chains as filters.