Solving the preserving reversal median problem

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Volumn 5, Issue 3, 2008, Pages 332-347

  Bernt, Matthias ^a   Merkle, Daniel ^b   Middendorf, Martin ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

Common intervals; Gene orders; Reversal median problem; Reversals; Strong interval trees

Indexed keywords

CANNING; DATA STRUCTURES; FILE ORGANIZATION; MATHEMATICAL TRANSFORMATIONS; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; POLYNOMIALS;

ARTIFICIAL DATA; COMMON INTERVALS; EXACT ALGORITHMS; GENE ORDERS; INPUT GENE ORDERS; MEDIAN PROBLEM; NP-HARD; PHYLOGENETIC RELATIONSHIPS; POLYNOMIAL-TIME; REVERSAL MEDIAN PROBLEM; REVERSALS; SETS OF GENES; STRONG INTERVAL TREES;

TREES (MATHEMATICS);

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; CHROMOSOME MAP; COMPUTER SIMULATION; DNA SEQUENCE; GENETICS; GENOMIC INSTABILITY; METHODOLOGY; MOLECULAR EVOLUTION; NUCLEOTIDE SEQUENCE;

ALGORITHMS; CHROMOSOME MAPPING; COMPUTER SIMULATION; DNA MUTATIONAL ANALYSIS; EVOLUTION, MOLECULAR; GENOMIC INSTABILITY; MODELS, GENETIC; SEQUENCE ANALYSIS, DNA;

EID: 49249111796     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2008.39     Document Type: Conference Paper

References (28)

1. G. Bourque and P.A. Pevzner, "Genome-Scale Evolution: Reconstructing Gene Orders in the Ancestral Species," Genome Research, vol. 12, no. 1, pp. 26-36, 2002.
2. B. Moret, A. Siepel, J. Tang, and T. Liu, "Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data," Proc. Second Int'l Workshop Algorithms in Bioinformatics (WABI '02), pp. 521-536, 2002.
3. B. Moret, J. Tang, and T. Warnow, Mathematics of Evolution and Phylogeny, ch. Reconstructing Phylogenies from Gene-Content and Gene-Order Data, pp. 321-352, Oxford Univ. Press, 2005.
4. M. Bernt, D. Merkle, and M. Middendorf, "Using Median Sets for Inferring Phylogenetic Trees," Bioinformatics, vol. 23, no. 2, pp. e129-e135, 2007.
5. A. Bergeron and J. Stoye, "On the Similarity of Sets of Permutations and Its Applications to Genome Comparison," J. Computational Biology, vol. 13, no. 7, pp. 1345-1354, 2006.
6. T. Uno and M. Yagiura, "Fast Algorithms to Enumerate All Common Intervals of Two Permutations," Algorithmica, vol. 2, no. 26, pp. 290-309, 2000.
7. S. Heber and J. Stoye, "Finding All Common Intervals of k Permutations," Proc. 12th Ann. Symp. Combinatorial Pattern Matching (CPM '01), pp. 207-218, 2001.
8. G. Didier, "Common Intervals of Two Sequences," Proc. Third Int'l Workshop Algorithms in Bioinformatics (WABI '03), pp. 17-24, 2003.
9. T. Schmidt and J. Stoye, "Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences," Proc. 15th Ann. Symp. Combinatorial Pattern Matching (CPM '04), pp. 347-358, 2004.
10. A. Bergeron, M. Blanchette, A. Chateau, and C. Chauve, "Reconstructing Ancestral Gene Orders Using Conserved Intervals," Proc. Fourth Int'l Workshop Algorithms in Bioinformatics (WABI '04), pp. 14-25, 2004.
11. M. Bernt, D. Merkle, and M. Middendorf, "Genome Rearrangement Based on Reversals That Preserve Conserved Intervals," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 3, no. 3, pp. 275-288, July-Sept. 2006.
12. S. Bérard, A. Bergeron, and C Chauve, "Conservation of Combinatorial Structures in Evolution Scenarios," Proc. Second RECOMB Comparative Genomics Satellite Workshop (RCG '04), pp. 1-15, 2004.
13. M. Bernt, D. Merkle, and M. Middendorf, "The Reversal Median Problem, Common Intervals, and Mitochondrial Gene Orders," Computational Life Sciences II-Proc. Second Int'l Symp. CompLife, pp. 52-63, 2006.
14. Y. Diekmann, M.-F. Sagot, and E. Tannier, "Evolution under Reversals: Parsimony and Conservation of Common Intervals," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 4, pp. 301-309, 2007.
15. M. Figeac and J. Varré, "Sorting by Reversals with Common Intervals," Proc. Fourth Int'l Workshop Algorithms in Bioinformatics (WABI '04), pp. 26-37, 2004.
16. S. Hannenhalli and P. Pevzner, "Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals," Proc. 27th Ann. ACM Symp. Theory of Computing (STOC '95), pp. 178-189, 1995.
17. A. Bergeron, J. Mixtacki, and J. Stoye, "Reversal Distance without Hurdles and Fortresses," Proc. 15th Ann. Symp. Combinatorial Pattern Matching (CPM '04), pp. 388-399, 2004.
18. E. Tannier, A. Bergeron, and M.-F. Sagot, "Advances in Sorting by Reversals," Discrete Applied Math., vol. 155, no. 6-7, p. 888, 2006.
19. A. Caprara, "The Reversal Median Problem," INFORMS J. Computing, vol. 15, no. 1, pp. 93-113, 2003.
20. A. Siepel and B. Moret, "Finding an Optimal Inversion Median: Experimental Results," Proc. First Int'l Workshop Algorithms in Bioinformatics (WABI '01), pp. 189-203, 2001.
21. M. Bemt, D. Merkle, and M. Middendorf, "A Parallel Algorithm for Solving the Reversal Median Problem," Proc. Parallel Processing and Applied Math.-Bio-Computing Workshop (PBC '05), pp. 10891096, 2005.
22. S. Bérard, A. Bergeron, C. Chauve, and C. Paul, "Perfect Sorting by Reversals is not Always Difficult," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 4, no. 1, pp. 4-16, Jan. 2007.
23. R. Eres, G.M. Landau, and L. Parida, "A Combinatorial Approach to Automatic Discovery of Cluster-Patterns," Proc. Third Int'l Workshop Algorithms in Bioinformatics (WABI '03), pp. 139-150, 2003.
24. A. Bergeron, C. Chauve, F. de Montgolfier, and M. Raffinot, "Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs," Proc. 13th Ann. European Symp. Algorithms (ESA '05), pp. 779-790, 2005.
25. A. Bergeron, C. Chauve, F. de Montgolfier, and M. Raffinot, "Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs," to appear in SJAM J. Discrete Math., 2008.
26. J. Boore, Mitochondrial Gene Arrangement Database, http://evogen.jgi.doe.gov/, 2006.
27. M. Cosner, R. Jansen, B. Moret, L. Raubeson, L.-S. Wang, T. Warnow, and S. Wyman, Comparative Genomics: Empirical and Analytical Approaches to Gene Order Dynamics, Map Alignment, and the Evolution of Gene Families, ch. An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae, pp. 99-121, Kluwer Academic Publishers, 2000.
28. D. Bader, B. Moret, and M. Yan, "A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study," J. Computational Biology, vol. 5, no. 8, pp. 483-491, 2001.