Summary: Assessing the statistical significance of structured RNA predicted from multiple sequence alignments relies on the existence of a good null model. We present here a random shuffling algorithm, Multiperm, that preserves not only the gap and local conservation structure in alignments of arbitrarily many sequences, but also the approximate dinucleotide frequencies. No shuffling algorithm that simultaneously preserves these three characteristics of a multiple (beyond pairwise) alignment has been available to date. As one benchmark, we show that it produces shuffled exonic sequences having folding free energy closer to native sequences than shuffled alignments that do not preserve dinucleotide frequencies.
Availability: The Multiperm GNU Cb++ source code is available at http://www.anandam.name/multiperm
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1093/bioinformatics/btp006 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!