Multichromosomal median and halving problems under different genomic distances

BMC Bioinformatics

Volumn 10, Issue , 2009, Pages

  Tannier, Eric ^a,b,d   Zheng, Chunfang ^c   Sankoff, David ^c  

^a INRIA RHÔNE ALPES   (France)

^b UNIVERSITÉ DE LYON   (France)

^c UNIVERSITY OF OTTAWA   (Canada)

^d UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANCESTRAL GENOMES; BREAKPOINT DISTANCE; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPLEXITY ISSUES; EVOLUTIONARY EVENTS; GENOME REARRANGEMENTS; LINEAR CHROMOSOME; MULTICHROMOSOMAL GENOMES;

ALGORITHMS;

GENES;

ALGORITHM; ARTICLE; BIOINFORMATICS; CHROMOSOME ANALYSIS; GENE DUPLICATION; GENE REARRANGEMENT; GENETIC DISTANCE; GENOME ANALYSIS; MUTATIONAL ANALYSIS; THEORETICAL STUDY; BIOLOGY; CHROMOSOME; GENETIC DATABASE; GENETICS; GENOME; GENOMICS; METHODOLOGY;

ALGORITHMS; CHROMOSOMES; COMPUTATIONAL BIOLOGY; DATABASES, GENETIC; GENE REARRANGEMENT; GENOME; GENOMICS;

EID: 65849156401     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-10-120     Document Type: Article

References (39)

1. Fertin G Labarre A Rusu I Tannier E Vialette S Combinatorics of Genome Rearrangements MIT Press 2009.
2. Tannier E Zheng C Sankoff D Multichromosomal genome median and halving problems Algorithms in Bioinformatics, proceedings of WABI'08, of Lecture Notes in Bioinformatics 2008, 5251:1-13.
3. Bergeron A Mixtacki J Stoye J A unifying view of genome rearrangements Algorithms in Bioinformatics, proceedings of WABI'06, of Lecture Notes in Computer Science 2006, 4175:163-173.
4. Mixtacki J Genome Halving under DCJ revisited Proceedings of COCOON'08, Lecture Notes in Computer Science 2008.
5. Warren R Sankoff D Genome halving with double cut and join Proceedings of the 6th Asia-Pacific Bioinformatics Conference, of Advances in Bioinformatics and Computational Biology 2008, 6:231-240.
6. Aury J Jaillon O Duret L Noel B Jubin C Porcel B Ségurens B Daubin V Anthouard V Aiach N Arnaiz O Billaut A Beisson J Blanc I Bouhouche K Câmara F Duharcourt S Guigó R Gogendeau D Katinka M Keller A Kissmehl R Klotz C Koll F Mouël AL Lepère G Malinsky S Nowacki M Nowak J Plattner H Poulain J Ruiz F Serrano V Zagulski M Dessen P Bétermier M Weissenbach J Scarpelli C Schächter V Sperling L Meyer E Cohen J Wincker P Global trends of whole-genome duplications revealed by the ciliate Paramecium tetraurelia Nature 2006, 444:171-178. 17086204
7. Otto S Whitton J Polyploid incidence and evolution Annual Review of Genetics 2000, 24:401-437.
8. Watterson G Ewens W Hall T Morgan A The chromosome inversion problem Journal of Theoretical Biology 1982, 99:1-7.
9. Sankoff D Blanchette M The median problem for breakpoints in comparative genomics Proceedings of the Third International Computing and Combinatorics Conference COCOON'97, of Lecture Notes in Computer Science 1997, 1276:251-263.
10. Pevzner P Tesler G Transforming men into mice: The Nadeau-Taylor chromosomal breakage model revisited Proceedings of the seventh annual international conference on Research in computational molecular biology RECOMB'03 2003:247-256.
11. Bergeron A Mixtacki J Stoye J On computing the breakpoint reuse rate in rearrangement scenarios Proceedings of Recomb Workshop on Comparative Genomics, Lecture Notes in Bioinformatics Springer-Verlag 2008.
12. Yancopoulos S Attie O Friedberg R Efficient sorting of genomic permutations by translocation, inversion and block interchange Bioinformatics 2005, 21:3340-3346. 15951307
13. Lin Y Lu C Chang HY Tang C An efficient algorithm for sorting by block-interchange and its application to the evolution of vibrio species Journal of Computational Biology 2005, 12:102-112. 15725736
14. Bergeron A Mixtacki J Stoye J HP distance via Double Cut and Join distance Combinatorial Pattern Matching, proceedings of CPM'08, of Lecture Notes in Computer Science 2008:5029.
15. Lin YC Lu CL Liu YC Tang CY SPRING: A tool for the analysis of genome rearrangement using reversals and block-interchanges Nucleic Acids Res 2006, 34:W696-W699. 1538842 16845100
16. Alekseyev M Pevzner PA Colored de Bruijn graphs and the genome halving problem IEEE/ACM Transactions on Computational Biology and Bioinformatics 2008, 4:98-107.
17. Hannenhalli S Pevzner P Transforming men into mice (polynomial algorithm for genomic distance problem) Proceedings of the 36th Annual Symposium on Foundations of Computer Science FOCS'95) 1995:581-592.
18. Zheng C Zhu Q Sankoff D Descendants of whole genome duplication within gene order phylogeny Journal of Computational Biology 2008, 15:947-964. 18788908
19. Zheng C Zhu Q Sankoff D Genome halving with an outgroup Evolutionary Bioinformatics 2006, 2:319-326.
20. Pe'er I Shamir R The median problems for breakpoints are NP-complete Electronic Colloquium on Computational Complexity 1998:5.
21. Bryant D The complexity of the breakpoint median problem Tech. Rep. CRM-2579 Centre de recherches mathématiques, Université de Montréal 1998.
22. Caprara A The reversal median problem INFORMS Journal on Computing 2003, 15:93-113.
23. Ohlebusch E Abouelhoda MI Hockel K A linear time algorithm for the inversion median problem in circular bacterial genomes J of Discrete Algorithms 2007, 5:637-646.
24. Bernt M Merkle D Middendorf M Solving the Preserving Reversal Median Problem IEEE/ACM Transactions on Computational Biology and Bioinformatics 2008, 5:332-347.
25. Lovasz L Plummer MD Matching Theory, of Annals of Discrete Mathematics. Amsterdam: North Holland 1986: 29.
26. Garey MR Johnson DS Computers and intractability. A guide to the theory of NP-completness New York: W. H. Freeman 1979.
27. Zheng C Zhu Q Adam Z Sankoff D Guided genome halving: Hardness, heuristics and the history of the Hemiascomycetes Bioinformatics 2008, 24(13):i96-104. 18586750
28. Berman P Karpinski M On some tighter inapproximability results Automata, Languages and Programming, of Lecture Notes In Computer Science 1999, 1644:705.
29. Xu W Sankoff D Decompositions of Multiple Breakpoint Graphs and Rapid Exact Solutions to the Median Problem Algorithms in Bioinformatics, proceedings of WABI'08, Lecture Notes in Bioinformatics 2008.
30. Adam Z Sankoff D The ABCs of MGR with DCJ Evol Bioinform Online 2008, 4:69-74. 2614205 19204809
31. Lenne R Solnon C Stützle T Tannier E Birattari M Reactive stochastic local search algorithms for the genomic median problem Proceedings of EvoCOP'08, of Lecture Notes in Computer Science 2008, 4972:266-276.
32. El-Mabrouk N Sankoff D The reconstruction of doubled genomes SIAM Journal of Computing 2003, 32:754-792.
33. Tesler G Efficient algorithms for multichromosomal genome rearrangements Journal of Computer and System Sciences 2002, 65:587-609.
34. Ozery-Flato M Shamir R Two notes on genome rearrangement Journal of Bioinformatics and Computational Biology 2003, 1:71-94.
35. Jean G Nikolski M Genome rearrangements: A correct algorithm for optimal capping Information Processing Letters 2007, 104:14-20.
36. Zheng C Wall PK Leebens-Mack J de Pamphilis C Albert V Sankoff D The effect of massive gene loss following whole genome duplication on the algorithmic reconstruction of the ancestral Populus diploid Proceedings of CSB'08 2008.
37. Bourque G Pevzner P Genome-scale evolution: Reconstructing gene orders in the ancestral species Genome Research 2002, 12:26-36. 155248 11779828
38. Chen X Zheng J Fu Z Nan P Zhong Y T Jiang SL Assignement of orthologous genes via genome rearrangement IEEE/ACM Transactions on Computational Biology and Bioinformatics 2005, 2:302-315.
39. Hannenhalli S Pevzner P Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals Journal of the ACM 1999, 46:1-27.