Multiple genome rearrangement: a general approach via the evolutionary genome graph.
BACKGROUND
In spite of a well-known fact that genome rearrangements are supposed to be viewed in the light of the evolutionary relationships within and between the species involved, no formal underlying framework based on the evolutionary considerations for treating the questions arising in the area has been proposed. If such an underlying framework is provided, all the basic questions in the area can be posed in a biologically more appropriate and useful form: e.g., the similarity between two genomes can then be computed via the nearest ancestor, rather than 'directly', ignoring the evolutionary connections.


RESULTS
We outline an evolution-based general framework for answering questions related to the multiple genome rearrangement. In the proposed model, the evolutionary genome graph (EG-graph) encapsulates an evolutionary history of a genome family. For a set of all EG-graphs, we introduce a family of similarity measures, each defined via a fixed set of genome transformations. Given a set of genomes and restricting ourselves to the transpositions, an algorithm for constructing an EG-graph is presented. We also present the experimental results in the form of an EG-graph for a set of concrete genomes (for several species). This EG-graph turns out to be very close to the corresponding known phylogenetic tree.
Korkin
Dmitry
D
Faculty of Computer Science, University of New Brunswick, Fredericton, NB E3B 5A3, Canada. dkorkin@unb.ca
Goldfarb
Lev
L
D000465:Algorithms; D002874:Chromosome Mapping / Q000379:methods*; D019143:Evolution, Molecular; D020869:Gene Expression Profiling / Q000379:methods*; D010802:Phylogeny; D016415:Sequence Alignment / Q000379:methods*; D017422:Sequence Analysis, DNA / Q000379:methods*