![]() |
![]() Traditional phylogenetic tree reconstruction is based on point mutations of a single gene. This approach is hardly suitable for genomes whose genes are almost identical and barely captures evolutionary scenarios. To better understand the evolution of organisms, we must not only consider the organisms' gene content but also their gene order. Here, 225 complete bacterial genomic sequences were downloaded from the National Center for Biotechnology Information (NCBI)[1]. Each individual proteome was blasted against the collection and provided a number of homologous genes shared with others. Then, the synteny (order of genes) of each two genomes can be considered as two signed permutations. One permutation can be rearranged into another in minimum finite steps, called reversal distance. Applying distance-based phylogenetic tree reconstruction tool on these distances yields a phylogenetic tree that may provide new insights into the evolution. PGRAPH employs deep theoretical results of Hannenhalli and Pevzner[2] to calculate a reversal distance between any two genomes in our database. However, the theory does not specify when and where the synteny blocks should be reversed (flipped) in order to achieve the minimum distance. Here, PGRAPH is able to illustrate one such scenario. Please be aware that there are many possible flipping scenarios, we have yet known which one really happened in the evolution of an organism. When comparing two genomes and considering their orthologous genes, their gene orders can be modeled as a signed permutation. The order of these genes of one genome can be rearranged into another by consecutively choosing a synteny block and reversing that block and its orientation one at a time, e.g. D0: 1,-7,6,-10,9,-8,2,-11,[-3,5],4 D1: 1,-7,6,-10,9,-8,2,-11,-5,[3,4] D2: 1,-7,6,-10,9,-8,2,[-11,-5,-4,-3] D3: 1,-7,6,[-10,9,-8,2,3,4,5],11 D4: 1,[-7,6,-5,-4,-3,-2],8,-9,10,11 D5: 1,2,3,4,5,[-6],7,8,-9,10,11 D6: 1,2,3,4,5,6,7,8,[-9],10,11 D7: 1,2,3,4,5,6,7,8,9,10,11 The minimum number of reversing steps is call optimal reversal distance. For the above example, the reversal distance is 7. (*) PGRAPH requires JRE 5.0 update 4 or later. Please download and install from here. |
|
Genome Rearrangement Analysis Please choose any two genomes to analyse and visualize their reversal distance. |
|
|
|
References [1] National Center for Biotechnology Information (NCBI) [2] S. Hannenhalli, and P.A. Pevzner, P.A. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46(1), 1-27, 1999 [3] PHYLIP package |
For questions and suggestions regarding the PGRAPH please contact. Bioinformatics Research Group National Electronics and Computer Technology Center, Thailand
|