Published in

Oxford University Press (OUP), Bioinformatics, 5(25), p. 668-669

DOI: 10.1093/bioinformatics/btp006

Links

Tools

Export citation

Search in Google Scholar

Multiperm: Shuffling multiple sequence alignments while approximately preserving dinucleotide frequencies

Journal article published in 2009 by Parvez Anandam, Elfar Torarinsson, Walter L. Ruzzo ORCID
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

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. AVAILABILITY: The Multiperm GNU Cb++ source code is available at http://www.anandam.name/multiperm