Given an RNA sequence and two designated secondary structures A, B, we describe a new algorithm that computes a nearly optimal folding pathway from A to B. The algorithm, RNATABUPATH, employs a TABU semi-greedy heuristic, known to be an effective search strategy in combinatorial optimization. Folding pathways, sometimes called routes or trajectories, are computed by RNATABUPATH in a fraction of the time required by the BARRIERS program of Vienna RNA Package. We benchmark RNATABUPATH with other algorithms to compute low energy folding pathways between experimentally known structures of several conformational switches. The RNAPATHFINDER web server, source code for algorithms to compute and analyze pathways and supplementary data are available at http://bioinformatics.bc.edu/clotelab/RNApathfinder.
展开▼
