Multiperm: shuffling multiple sequence alignments while approximately preserving dinucleotide frequencies
Author(s) -
Parvez Anandam,
Elfar Torarinsson,
Walter L. Ruzzo
Publication year - 2009
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btp006
Subject(s) - shuffling , pairwise comparison , multiple sequence alignment , source code , sequence (biology) , benchmark (surveying) , computer science , sequence alignment , algorithm , computational biology , biology , genetics , artificial intelligence , peptide sequence , geodesy , gene , programming language , geography , operating system
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom