Divide-and-conquer approach for the exemplar breakpoint distance
Open Access
- 15 February 2005
- journal article
- research article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 21 (10) , 2171-2176
- https://doi.org/10.1093/bioinformatics/bti327
Abstract
Motivation: A one-to-one correspondence between the sets of genes in the two genomes being compared is necessary for the notions of breakpoint and reversal distances. To compare genomes where there are paralogous genes, Sankoff formulated the exemplar distance problem as a general version of the genome rearrangement problem. Unfortunately, the problem is NP-hard even for the breakpoint distance. Results: This paper proposes a divide-and-conquer approach for calculating the exemplar breakpoint distance between two genomes with multiple gene families. The combination of our approach and Sankoff's branch-and-bound technique leads to a practical program to answer this question. Tests with both simulated and real datasets show that our program is much more efficient than the existing program that is based only on the branch-and-bound technique. Availability: Code for the program is available from the authors. Contact:matzlx@nus.edu.sgKeywords
This publication has 7 references indexed in Scilit:
- Initial sequencing and comparative analysis of the mouse genomeNature, 2002
- A Faster and Simpler Algorithm for Sorting Signed Permutations by ReversalsSIAM Journal on Computing, 2000
- Genome rearrangement with gene familiesBioinformatics, 1999
- Transforming cabbage into turnipJournal of the ACM, 1999
- Multiple Genome Rearrangement and Breakpoint PhylogenyJournal of Computational Biology, 1998
- Lengths of chromosomal segments conserved since divergence of man and mouse.Proceedings of the National Academy of Sciences, 1984
- The chromosome inversion problemJournal of Theoretical Biology, 1982