Screening Synteny Blocks in Pairwise Genome Comparisons through Integer Programming

Authors

Haibao Tang, University of California - BerkeleyFollow
Eric Lyons, University of ArizonaFollow
Brent S. Pedersen, University of California - BerkeleyFollow
James C. Schnable, University of Nebraska-LincolnFollow
Andrew H. Paterson, University of Georgia
Michael Freeling, University of California - BerkeleyFollow

ORCID IDs

James C. Schnable

Document Type

Article

Date of this Version

4-11-2011

Citation

BMC Bioinformatics (2011) 12: 102. DOI: 10.1186/1471-2105-12-102. http://www.biomedcentral.com/1471-2105/12/102.

Comments

Copyright 2011, the authors. Open access, Creative Commons Attribution license.

Abstract

Background:

It is difficult to accurately interpret chromosomal correspondences such as true orthology and paralogy due to significant divergence of genomes from a common ancestor. Analyses are particularly problematic among lineages that have repeatedly experienced whole genome duplication (WGD) events. To compare multiple “subgenomes” derived from genome duplications, we need to relax the traditional requirements of “one-to-one” syntenic matchings of genomic regions in order to reflect “one-to-many” or more generally “many-to-many” matchings. However this relaxation may result in the identification of synteny blocks that are derived from ancient shared WGDs that are not of interest. For many downstream analyses, we need to eliminate weak, low scoring alignments from pairwise genome comparisons. Our goal is to objectively select subset of synteny blocks whose total scores are maximized while respecting the duplication history of the genomes in comparison. We call this “quota-based” screening of synteny blocks in order to appropriately fill a quota of syntenic relationships within one genome or between two genomes having WGD events.

Results:

We have formulated the synteny block screening as an optimization problem known as “Binary Integer Programming” (BIP), which is solved using existing linear programming solvers. The computer program QUOTAALIGN performs this task by creating a clear objective function that maximizes the compatible set of synteny blocks under given constraints on overlaps and depths (corresponding to the duplication history in respective genomes). Such a procedure is useful for any pairwise synteny alignments, but is most useful in lineages affected by multiple WGDs, like plants or fish lineages. For example, there should be a 1:2 ploidy relationship between genome A and B if genome B had an independent WGD subsequent to the divergence of the two genomes. We show through simulations and real examples using plant genomes in the rosid superorder that the quota-based screening can eliminate ambiguous synteny blocks and focus on specific genomic evolutionary events, like the divergence of lineages (in cross-species comparisons) and the most recent WGD (in self comparisons).

Conclusions:

The QUOTA-ALIGN algorithm screens a set of synteny blocks to retain only those compatible with a user specified ploidy relationship between two genomes. These blocks, in turn, may be used for additional downstream analyses such as identifying true orthologous regions in interspecific comparisons. There are two major contributions of QUOTA-ALIGN: 1) reducing the block screening task to a BIP problem, which is novel; 2) providing an efficient software pipeline starting from all-against-all BLAST to the screened synteny blocks with dot plot visualizations. Python codes and full documentations are publicly available http://github.com/tanghaibao/ quota-alignment. QUOTA-ALIGN program is also integrated as a major component in SynMap http:// genomevolution.com/CoGe/SynMap.pl, offering easier access to thousands of genomes for non-programmers.