Reconstruction of Ancestral Genomes in Presence of Gene Gain and Loss

被引:51
作者
Avdeyev, Pavel [1 ,2 ]
Jiang, Shuai [3 ]
Aganezov, Sergey [1 ,2 ,4 ]
Hu, Fei [3 ]
Alekseyev, Max A. [1 ,2 ]
机构
[1] George Washington Univ, Computat Biol Inst, Washington, DC USA
[2] George Washington Univ, Dept Math, Washington, DC 20052 USA
[3] Univ S Carolina, Dept Comp Sci & Engn, Columbia, SC 29208 USA
[4] ITMO Univ, Dept Higher Math, St Petersburg, Russia
基金
美国国家科学基金会;
关键词
ancestral genome; chromosome evolution; genome rearrangement; gene order; DCJ; indel; MULTI-BREAK REARRANGEMENTS; INSERTIONS; DUPLICATIONS; INVERSION; REGIONS; ORDERS;
D O I
10.1089/cmb.2015.0160
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Since most dramatic genomic changes are caused by genome rearrangements as well as gene duplications and gain/loss events, it becomes crucial to understand their mechanisms and reconstruct ancestral genomes of the given genomes. This problem was shown to be NP-complete even in the "simplest" case of three genomes, thus calling for heuristic rather than exact algorithmic solutions. At the same time, a larger number of input genomes may actually simplify the problem in practice as it was earlier illustrated with MGRA, a state-of-the-art software tool for reconstruction of ancestral genomes of multiple genomes. One of the key obstacles for MGRA and other similar tools is presence of breakpoint reuses when the same breakpoint region is broken by several different genome rearrangements in the course of evolution. Furthermore, such tools are often limited to genomes composed of the same genes with each gene present in a single copy in every genome. This limitation makes these tools inapplicable for many biological datasets and degrades the resolution of ancestral reconstructions in diverse datasets. We address these deficiencies by extending the MGRA algorithm to genomes with unequal gene contents. The developed next-generation tool MGRA2 can handle gene gain/loss events and shares the ability of MGRA to reconstruct ancestral genomes uniquely in the case of limited breakpoint reuse. Furthermore, MGRA2 employs a number of novel heuristics to cope with higher breakpoint reuse and process datasets inaccessible for MGRA. In practical experiments, MGRA2 shows superior performance for simulated and real genomes as compared to other ancestral genome reconstruction tools.
引用
收藏
页码:150 / 164
页数:15
相关论文
共 25 条
[1]   Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes [J].
Alekseyev, Max A. .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2008, 15 (08) :1117-1131
[2]   Multi-break rearrangements and chromosomal evolution [J].
Alekseyev, Max A. ;
Pevzner, Pavel A. .
THEORETICAL COMPUTER SCIENCE, 2008, 395 (2-3) :193-202
[3]   Comparative genomics reveals birth and death of fragile regions in mammalian evolution [J].
Alekseyev, Max A. ;
Pevzner, Pavel A. .
GENOME BIOLOGY, 2010, 11 (11)
[4]   Breakpoint graphs and ancestral genome reconstructions [J].
Alekseyev, Max A. ;
Pevzner, Pavel A. .
GENOME RESEARCH, 2009, 19 (05) :943-957
[5]   Emulating Insertion and Deletion Events in Genome Rearrangement Analysis [J].
Arndt, William ;
Tang, Jijun .
2011 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM 2011), 2011, :105-108
[6]   Sorting by reversals, block interchanges, tandem duplications, and deletions [J].
Bader, Martin .
BMC BIOINFORMATICS, 2009, 10
[7]   Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes [J].
Berard, Severine ;
Chateau, Annie ;
Chauve, Cedric ;
Paul, Christophe ;
Tannier, Eric .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2009, 16 (10) :1287-1309
[8]  
Bourque G, 2002, GENOME RES, V12, P26
[9]   Double Cut and Join with Insertions and Deletions [J].
Braga, Marilia D. V. ;
Willing, Eyla ;
Stoye, Jens .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2011, 18 (09) :1167-1184
[10]   DCJ-Indel sorting revisited [J].
Compeau, Phillip E. C. .
ALGORITHMS FOR MOLECULAR BIOLOGY, 2013, 8