Maximum independent sets of commuting and noninterfering inversions

BMC Bioinformatics

Volumn 10, Issue SUPPL. 1, 2009, Pages

  Swenson, Krister M ^a   To, Yokuki ^b   Tang, Jijun ^b   Moret, Bernard M E ^a,c  

^a EPFL   (Switzerland)

^b The Department of Mechanical Engineering   (United States)

^c SWISS INSTITUTE OF BIOINFORMATICS   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITIES; EVOLUTIONARY PATH; INVERSION DISTANCE; MAXIMUM INDEPENDENT SETS; MEDIAN PROBLEM; PHYLOGENETIC RECONSTRUCTION; QUALITY OF SOLUTION; SIGNED PERMUTATIONS;

ALGORITHMS; BIOINFORMATICS;

ALGORITHMS;

ALGORITHM; ARTICLE; BIOLOGY; CHROMOSOME INVERSION; METHODOLOGY; MOLECULAR EVOLUTION; PHYLOGENY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; EVOLUTION, MOLECULAR; INVERSION, CHROMOSOME; PHYLOGENY;

EID: 60849098166     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-10-S1-S6     Document Type: Article

References (25)

1. Downie S Palmer J Use of chloroplast DNA rearrangements in reconstructing plant phylogeny Plant Molecular Systematics Chapman and Hall Soltis P, Soltis D, Doyle J 1992, 14-35
2. Darling A Mau B Blattner F Perna N Mauve: Multiple Alignment of Conserved Genomic Sequence With Rearrangements Genome Res 2004, 14:1394-1403 442156 15231754
3. Pevzner P Tesler G Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution Proc Natl Acad Sci USA. 2003, 100(13):7672-7677
4. Moret B Tang J Warnow T Reconstructing phylogenies from gene-content and gene Mathematics of Evolution and Phylogeny Oxford University Press, UK Gascuel O 2005, 321-352
5. Sankoff D Blanchette M The median problem for breakpoints in comparative genomics Proc 3rd Int'l Conf Computing and Combinatorics (COCOON'97) Lecture Notes in Computer Science, Springer Verlag, Berlin 1997, 1276:251-264
6. Caprara A Formulations and hardness of multiple sorting by reversals Proc 3rd Ann Int'l Conf Comput Mol Biol (RECOMB'99) ACM Press, New York 1999, 84-93
7. Pe'er I Shamir R The median problems for breakpoints are NP-complete Elec Colloq on Comput Complexity 1998, 71
8. Moret B Siepel A Tang J Liu T Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data Proc 2nd Int'l Workshop Algs in Bioinformatics (WABI'02) Lecture Notes in Computer Science, Springer Verlag, Berlin 2002, 2452:521-536
9. Siepel A Moret B Finding an Optimal Inversion Median: Experimental Results Proc 1st Int'l Workshop Algs in Bioinformatics (WABI'01) Lecture Notes in Computer Science, Springer Verlag, Berlin 2001, 2149:189-203
10. Tesler G Efficient algorithms for multichromosomal genome rearrangements J Comput Syst Sci 2002, 65(3):587-609
11. Swenson K Arndt W Tang J Moret B Phylogenetic reconstruction from complete gene orders of whole genomes Proc 6th Asia Pacific Bioinformatics Conf (APBC'08) in Advances in Bioinformatics and Computational Biology 2008, 6:241-250
12. Arndt W Tang J Improving inversion median computation using commuting reversals and cycle information Proc 5th RECOMB Work on Comp Genomics (RECOMBCG'07) Lecture Notes in Computer Science, Springer Verlag, Berlin 2007, 4751:30-44
13. Bernt M Merkle D Middendorf M Genome Rearrangement Based on Reversals that Preserve Conserved Intervals IEEE-ACM Trans Computational Biology and Bioinformatics 2006
14. Hannenhalli S Pevzner P Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals) Proc 27th Ann ACM Symp Theory of Comput (STOC'95) ACM Press, New York 1995, 178-189
15. Setubal J Meidanis J Introduction to Computational Molecular Biology PWS Publishers, Boston, MA 1997
16. Even S Itai A Queues, Stacks, and Graphs Theory of Machines and Computations Proceedings of an International Symposium on the Theory of Machines and Computations, Technion-Israel Inst. of Technol., Haifa, Israel, Aug. 1971, Academic Press, New York Zvi Kohavi and Azaria Paz 1971, 71-86
17. Even S Pnueli A Lempel A Permutation Graphs and Transitive Graphs JACM 1972, 19(3):400-410
18. Gavril F Algorithms for a maximum clique and a maximum independent set of a circle graph Networks 1973, 3:261-273
19. Bader D Moret B Yan M A fast linear-time algorithm for inversion distance with an experimental comparison J Comput Biol 2001, 8(5):483-491 11694179
20. Valiente G A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs Proc 14th Int'l Symp Alg and Comp (ISAAC'03) Lecture Notes in Computer Science, Springer Verlag, Berlin 2003, 2906:129-137
21. Bouchet A Reducing prime graphs and recognizing circle graphs Combinatorica 1987, 7(3):243-254
22. Spinrad J Efficient Graph Representations American Mathematical Society 2003
23. Caprara A On the tightness of the alternating-cycle lower bound for sorting by reversals J Combin Optimization 1999, 3:149-182
24. Swenson K Lin Y Rajan V Moret B Hurdles Hardly Have to be Heeded Proc 6th RECOMB Work on Comp. Genomics (RECOMBCG'08) Lecture Notes in Computer Science, Springer Verlag, Berlin 2009, 5267:239-249
25. Spinrad J Recognition of circle graphs Journal of Algorithms 1994, 16(2):264-282