We propose memory efficient algorithms to solve the same problem. We reduce the space complexity to O(n3) for simple pseudoknot and O(mn2 + n3) for embedded ...
In this paper, we consider the problem of structural alignment of a target RNA sequence of length n and a query RNA sequence of length m with known ...
In this paper, we consider the problem of structural alignment of a target RNA sequence of length n and a query RNA sequence of length m with known secondary ...
In this paper, we consider the problem of structural alignment of a target RNA sequence of length n and a query RNA sequence of length m with known ...
In this paper, we consider the problem of structural alignment of a target RNA sequence of length n and a query RNA sequence of length m with known secondary ...
Memory Efficient Algorithms for Structural Alignment of RNAs with ...
dl.acm.org › doi › TCBB.2011.66
Jan 1, 2012 · In this paper, we consider the problem of structural alignment of a target RNA sequence of length n and a query RNA sequence of length m ...
Abstract—In this paper, we consider the problem of structural alignment of a target RNA sequence of length n and a query RNA.
A memory efficient algorithm for structural alignment of RNAs with embedded simple pseudoknots. Citation. Wong, K, Chiu, Y, Lam, T et al. 2008, 'A memory ...
In this paper, we consider the problem of structural alignment of a target RNA sequence of length n and a query RNA sequence of length m with known ...
RNASAlign, which can automatically identify the pseudoknot type of a secondary structure and perform structural alignment of a folded RNA with every region of ...