A fast and exact algorithm for the perfect reversal median problem
Pages 305 - 316
Abstract
We study the problem of finding for the gene orders of three taxa a potential ancestral gene order such that the corresponding rearrangement scenario has a minimal number of reversals where each of the reversals has to preserve the common intervals of the given input gene orders. Common intervals identify sets of genes that occur consecutively in all input gene orders. The problem of finding such an ancestral gene order is called the perfect reversal median problem (pRMP). A tree based data structure for the representation of the common intervals of all input gene orders is used for the design and realization of a fast and exact algorithm--called TCIP--for solving the pRMP. It is known that for two given gene orders the minimum number of reversals to transfer one gene order into the other can be computed in polynomial time, whereas the corresponding problem with the restriction that common intervals should not be destroyed by the reversals is already NP-hard. Nevertheless, we show empirically on biological and artificial data that TCIP for the pRMP is usually even faster than the fastest exact algorithm (Caprara's median solver) for the reversal median problem (RMP), i.e., the corresponding problem in which the common intervals are not considered.
References
[1]
S. Bérard, A. Bergeron, and C. Chauve. Conservation of combinatorial structures in evolution scenarios. In Comparative Genomics, RECOMB 2004 International Workshop, RCG 2004, number 3388 in LNBI, pages 1-15, 2004.
[2]
S. Bérard, A. Bergeron, C. Chauve, and C. Paul. Perfect sorting by reversals is not always difficult. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4(1):4-16, 2007.
[3]
A. Bergeron, M. Blanchette, A. Chateau, and C. Chauve. Reconstructing ancestral gene orders using conserved intervals. In Proc. WABI, number 3240 in LNCS, pages 14-25, 2004.
[4]
A. Bergeron, C. Chauve, F. de Montgolfier, and M.Raffinot. Computing common intervals of K permutations, with applications to modular decomposition of graphs. In Proc. ESA, number 3669 in LNCS, pages 779-790. Springer-Verlag, Berlin, 2005.
[5]
A. Bergeron, J. Mixtacki, and J. Stoye. Reversal distance without hurdles and fortresses. In Proc. CPM, number 3109 in LNCS, pages 388-399. Springer Verlag, 2004.
[6]
A. Bergeron and J. Stoye. On the similarity of sets of permutations and its applications to genome comparison. J. Comp. Biol., 13(7):1345-1354, 2006.
[7]
M. Bernt, D. Merkle, and M. Middendorf. A parallel algorithm for solving the reversal median problem. In Proc. Parallel Processing and Applied Mathematics - Bio-Computing Workshop (PBC'5), number 3911 in LNCS, pages 1089-1096, 2005.
[8]
M. Bernt, D. Merkle, and M. Middendorf. Genome rearrangement based on reversals that preserve conserved intervals. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3(3):275-288, 2006.
[9]
M. Bernt, D. Merkle, and M. Middendorf. The reversal median problem, common intervals, and mitochondrial gene orders. In Computational Life Sciences II - Proc. 2nd International Symposium CompLife, number LNCS in 4216, pages 52-63, 2006.
[10]
M. Bernt, D. Merkle, and M. Middendorf. Using median sets for inferring phylogenetic trees. Bioinformatics, 23(2):e129-e135, 2007.
[11]
J.L. Boore. Mitochondrial gene arrangement database, 2006. http://evogen.jgi.doe.gov/.
[12]
G. Bourque and P. A. Pevzner. Genome-scale evolution: Reconstructing gene orders in the ancestral species. Genome Res., 12(1):26-36, 2002.
[13]
A. Caprara. The reversal median problem. INFORMS Journal on Computing, 15(1):93-113, 2003.
[14]
M. Figeac and J. Varré. Sorting by reversals with common intervals. In Proc. WABI, number 3240 in LNBI, pages 26-37, 2004.
[15]
S. Hannenhalli and P. Pevzner. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. In Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, pages 178-189. ACM Press, 1995.
[16]
S. Heber and J. Stoye. Finding all common intervals of k permutations. In Proc. CPM, number 2089 in LNCS, pages 207-218, 2001.
[17]
B. Moret, A. Siepel, J. Tang, and T. Liu. Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In Proc. WABI, number LNCS in 2452, pages 521-536, 2002.
[18]
B. Moret, J. Tang, and T.Warnow. Reconstructing phylogenies from gene-content and geneorder data. Mathematics of Evolution and Phylogeny, 2005.
[19]
A. Siepel and B.Moret. Finding an optimal inversion median: Experimental results. In Proc. WABI, number 2149 in LNCS, pages 189-203, 2001.
[20]
E. Tannier, A. Bergeron, and M.-F. Sagot. Advances in sorting by reversals. accepted at Discrete Applied Mathematics, 2005.
[21]
T. Uno and M. Yagiura. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica, 2(26):290-309, 2000.
Recommendations
Solving the Preserving Reversal Median Problem
Genomic rearrangement operations can be very useful to infer the phylogenetic relationship of gene orders representing species. We study the problem of finding potential ancestral gene orders for the gene orders of given taxa, such that the ...
The reversal median problem, common intervals, and mitochondrial gene orders
CompLife'06: Proceedings of the Second international conference on Computational Life SciencesAn important problem for phylogenetic investigations that are based on gene orders is to find for three given gene orders a fourth gene order that has a minimum sum of reversal distances to the three given gene orders. This problem is called Reversal ...
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem
WG '02: Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer ScienceWe investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer l together with a set S of words of length k over the four symbols A , C , G , T . The ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 07 May 2007
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025