Format

Send to

Choose Destination
Front Genet. 2019 Oct 29;10:1020. doi: 10.3389/fgene.2019.01020. eCollection 2019.

A New Algorithm for Identifying Genome Rearrangements in the Mammalian Evolution.

Author information

1
School of Computer Science, Inner Mongolia University, Hohhot, China.
2
School of Electrical and Information Engineering, Beijing University of Civil Engineering and Architecture, Beijing, China.
3
Beijing University of Civil Engineering and Architecture, Beijing Key Laboratory of Intelligent Processing for Building Big Data, Beijing, China.

Abstract

Genome rearrangements are the evolutionary events on level of genomes. It is a global view on evolution research of species to analyze the genome rearrangements. We introduce a new method called RGRPT (recovering the genome rearrangements based on phylogenetic tree) used to identify the genome rearrangements. We test the RGRPT using simulated data. The results of experiments show that RGRPT have high sensitivity and specificity compared with other tools when to predict rearrangement events. We use RGRPT to predict the rearrangement events of six mammalian genomes (human, chimpanzee, rhesus macaque, mouse, rat, and dog). RGRPT has recognized a total of 1,157 rearrangement events for them at 10 kb resolution, including 858 reversals, 16 translocations, 249 transpositions, and 34 fusions/fissions. And RGRPT has recognized 475 rearrangement events for them at 50 kb resolution, including 332 reversals, 13 translocations, 94 transpositions, and 36 fusions/fissions. The code source of RGRPT is available from https://github.com/wangjuanimu/data-of-genome-rearrangement.

KEYWORDS:

algorithm; evolution; genome rearrangements; mammal; phylogenetic tree

Supplemental Content

Full text links

Icon for Frontiers Media SA Icon for PubMed Central
Loading ...
Support Center