Computing folding pathways between RNA secondary structures

Explore this paper's citation graph

Summary

A new algorithm is described that computes a nearly optimal folding pathway from A to B using a tabu semi-greedy heuristic, known to be an effective search strategy in combinatorial optimization.

Type
article
Published
2009-12-30
Cited by
40
References
34
Access
Open access

Keywords

Consciousness, Linguistics, Psychology, Ecocriticism, Aesthetics

References

Cited by

Related papers