Edit Distances and Factorisations of Even Permutations
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The solution space of sorting by reversals
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
A fixed-parameter algorithm for string-to-string correction
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Complexity decompositions in the problem of comparison of polytene chromosome banding sequences
Pattern Recognition and Image Analysis
| Hi-index | 0.00 |
Genome rearrangement is a new and important research area that studies the gene orders and the evolution of gene families. With the development of fast sequencing techniques, large-scale DNA molecules are investigated with respect to the relative order of genes in them. Contrary to the traditional alignment approach, genome rearrangements are based on comparison of gene orders. Recently, it became a topic capturing wide attention. In this paper, we cover many kinds of rearrangement events such as reversal, transposition, translocation, fussion, fission, and so on. Different types of distances between genomes or chromosomes are discussed. A variety of mathematic models are included