Format

Send to

Choose Destination
Bioinformatics. 2009 Mar 1;25(5):668-9. doi: 10.1093/bioinformatics/btp006. Epub 2009 Jan 9.

Multiperm: shuffling multiple sequence alignments while approximately preserving dinucleotide frequencies.

Author information

1
Department of Computer Science and Engineering, University of Washington, Seattle, WA 98195-2350, USA. anandam@u.washington.edu

Abstract

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

PMID:
19136551
DOI:
10.1093/bioinformatics/btp006
[Indexed for MEDLINE]

Supplemental Content

Full text links

Icon for Silverchair Information Systems
Loading ...
Support Center