Multiple whole-genome alignments without a reference organism.
Multiple sequence alignments have become one of the most commonly used resources in genomics research. Most algorithms for multiple alignment of whole genomes rely either on a reference genome, against which all of the other sequences are laid out, or require a one-to-one mapping between the nucleotides of the genomes, preventing the alignment of recently duplicated regions. Both approaches have drawbacks for whole-genome comparisons. In this paper we present a novel symmetric alignment algorithm. The resulting alignments not only represent all of the genomes equally well, but also include all relevant duplications that occurred since the divergence from the last common ancestor. Our algorithm, implemented as a part of the VISTA Genome Pipeline (VGP), was used to align seven vertebrate and six Drosophila genomes. The resulting whole-genome alignments demonstrate a higher sensitivity and specificity than the pairwise alignments previously available through the VGP and have higher exon alignment accuracy than comparable public whole-genome alignments. Of the multiple alignment methods tested, ours performed the best at aligning genes from multigene families-perhaps the most challenging test for whole-genome alignments. Our whole-genome multiple alignments are available through the VISTA Browser at http://genome.lbl.gov/vista/index.shtml.
Dubchak
Inna
I
Genome Sciences Division, Lawrence Berkeley National Laboratory, Berkeley, California 94720, USA.
Poliakov
Alexander
A
Kislyuk
Andrey
A
Brudno
Michael
M
D000465:Algorithms; D019295:Computational Biology; D030561:Databases, Nucleic Acid; D005091:Exons / Q000235:genetics; D016678:Genome; D005810:Multigene Family; D016415:Sequence Alignment / Q000379:methods* / Q000706:statistics & numerical data*; D017422:Sequence Analysis, DNA / Q000706:statistics & numerical data*; D012984:Software