Literature DB >> 29312438

Implicit Transpositions in DCJ Scenarios.

Pavel Avdeyev1, Shuai Jiang2, Max A Alekseyev1.   

Abstract

Genome rearrangements are large-scale evolutionary events that shuffle genomic architectures. The minimal number of such events between two genomes is often used in phylogenomic studies to measure the evolutionary distance between the genomes. Double-Cut-and-Join (DCJ) operations represent a convenient model of most common genome rearrangements (reversals, translocations, fissions, and fusions), while other genome rearrangements, such as transpositions, can be modeled by pairs of DCJs. Since the DCJ model does not directly account for transpositions, their impact on DCJ scenarios is unclear. In the present work, we study implicit appearance of transpositions (as pairs of DCJs) in DCJ scenarios. We consider shortest DCJ scenarios satisfying the maximum parsimony assumption, as well as more general DCJ scenarios based on some realistic but less restrictive assumptions. In both cases, we derive a uniform lower bound for the rate of implicit transpositions, which depends only on the genomes but not a particular DCJ scenario between them. Our results imply that implicit appearance of transpositions in DCJ scenarios may be unavoidable or even abundant for some pairs of genomes. We estimate that for mammalian genomes implicit transpositions constitute at least 6% of genome rearrangements.

Entities:  

Keywords:  DCJ; breakpoint graphs; chromosome evolution; genome rearrangements; transpositions

Year:  2017        PMID: 29312438      PMCID: PMC5733028          DOI: 10.3389/fgene.2017.00212

Source DB:  PubMed          Journal:  Front Genet        ISSN: 1664-8021            Impact factor:   4.599


  11 in total

1.  Low occurrence of gene transposition events during the evolution of the genus Drosophila.

Authors:  José María Ranz; Josefa González; Ferran Casals; Alfredo Ruiz
Journal:  Evolution       Date:  2003-06       Impact factor: 3.694

2.  The solution space of sorting by DCJ.

Authors:  Marília D V Braga; Jens Stoye
Journal:  J Comput Biol       Date:  2010-09       Impact factor: 1.479

3.  Combinatorial structure of genome rearrangements scenarios.

Authors:  Aïda Ouangraoua; Anne Bergeron
Journal:  J Comput Biol       Date:  2010-09       Impact factor: 1.479

4.  Efficient sorting of genomic permutations by translocation, inversion and block interchange.

Authors:  Sophia Yancopoulos; Oliver Attie; Richard Friedberg
Journal:  Bioinformatics       Date:  2005-06-09       Impact factor: 6.937

5.  Yeast ancestral genome reconstructions: the possibilities of computational methods II.

Authors:  Cedric Chauve; Haris Gavranovic; Aida Ouangraoua; Eric Tannier
Journal:  J Comput Biol       Date:  2010-09       Impact factor: 1.479

Review 6.  Sorting by weighted reversals, transpositions, and inverted transpositions.

Authors:  Martin Bader; Enno Ohlebusch
Journal:  J Comput Biol       Date:  2007-06       Impact factor: 1.479

7.  Reconstructing contiguous regions of an ancestral genome.

Authors:  Jian Ma; Louxin Zhang; Bernard B Suh; Brian J Raney; Richard C Burhans; W James Kent; Mathieu Blanchette; David Haussler; Webb Miller
Journal:  Genome Res       Date:  2006-09-18       Impact factor: 9.043

8.  Multichromosomal median and halving problems under different genomic distances.

Authors:  Eric Tannier; Chunfang Zheng; David Sankoff
Journal:  BMC Bioinformatics       Date:  2009-04-22       Impact factor: 3.169

9.  Sorting genomes with rearrangements and segmental duplications through trajectory graphs.

Authors:  Mingfu Shao; Yu Lin; Bernard Moret
Journal:  BMC Bioinformatics       Date:  2013-10-15       Impact factor: 3.169

10.  Estimation of the true evolutionary distance under the fragile breakage model.

Authors:  Nikita Alexeev; Max A Alekseyev
Journal:  BMC Genomics       Date:  2017-05-24       Impact factor: 3.969

View more

北京卡尤迪生物科技股份有限公司 © 2022-2023.