Multiperm: shuffling multiple sequence alignments while approximately preserving dinucleotide frequencies.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 19136551.
- Also identified by DOI 10.1093/bioinformatics/btp006.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
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. The Multiperm GNU Cb++ source code is available at http://www.anandam.name/multiperm
Medical subject headings
- Algorithms
- Computational Biology
- Sequence Alignment
- Sequence Analysis, RNA