A mini-greedy algorithm for faster structural RNA stem-loop search.
When a set of coregulated genes share a common structural RNA motif, e.g. a hairpin, most motif search approaches fail to locate the covarying but structurally conserved motif. There do exist methods that can locate structural RNA motifs, like FOLDALIGN, but the main problem with these methods is th...
Autors principals: | Gorodkin, J, Lyngso, R, Stormo, G |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
2001
|
Ítems similars
-
Pairwise local structural alignment of RNA sequences with sequence similarity less than 40%.
per: Havgaard, J, et al.
Publicat: (2005) -
The FOLDALIGN web server for pairwise structural RNA alignment and mutual motif search.
per: Havgaard, J, et al.
Publicat: (2005) -
Unravelling Greedy Algorithms
per: Bird, R
Publicat: (1992) -
Two Greedy Algorithms
per: Bird, R
Publicat: (1992) -
On the greedy algorithm for satisfiability
per: Koutsoupias, E, et al.
Publicat: (1992)