SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5724 LNBI, Issue , 2009, Pages 85-96

  Feijão, Pedro ^a   Meidanis, João ^a,b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b SCYLLA BIOINFORMATICS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

BREAKPOINT; BREAKPOINT DISTANCE; GENOME COMPARISON; GENOME REARRANGEMENTS; MEDIAN PROBLEM; MULTICHROMOSOMAL GENOMES; NEW RESULTS; NP-HARD; POLYNOMIAL-TIME ALGORITHMS;

ALGORITHMS; BIOINFORMATICS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

GENES;

EID: 70350365701     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04241-6_8     Document Type: Conference Paper

References (27)

1. Sturtevant, A.H., Dobzhansky, T.: Inversions in the third chromosome of wild races of Drosophila pseudoobscura, and their use in the study of the history of the species. PNAS 22(7), 448-450 (1936)
2. McClintock, B.: The origin and behavior of mutable loci in maize. PNAS 36(6), 344-355 (1950)
3. Nadeau, J.H., Taylor, B.A.: Lengths of chromosomal segments conserved since divergence of man and mouse. PNAS 81(3), 814-818 (1984)
4. Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In: Proc. 27th Ann. Symp. Theory of Computing STOC 1995 (1995)
5. Hannenhalli, S.: Polynomial-time algorithm for computing translocation distance between genomes. Discrete Appl. Math. 71(1-3), 137-151 (1996)
6. Christie, D.A.: Sorting permutations by block-interchanges. Information Processing Letters 60, 165-169 (1996)
7. Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discrete Math. 11(2), 224-240 (1998)
8. Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3(4), 369-379 (2006)
9. Mira, C., Meidanis, J.: Sorting by block-interchanges and signed reversals. In: Proc. ITNG 2007, pp. 670-676 (2007)
10. Dias, Z., Meidanis, J.: Genome rearrangements distance by fusion, fission, and transposition is easy. In: Proc. SPIRE 2001, pp. 250-253 (2001)
11. Lu, C.L., Huang, Y.L., Wang, T.C., Chiu, H.T.: Analysis of circular genome rearrangement by fusions, fissions and block-interchanges. BMC Bioinformatics 7, 295 (2006)
12. Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16), 3340-3346 (2005)
13. Blanchette, M., Bourque, G., Sankoff, D.: Breakpoint phylogenies. In: Genome Inform. Ser. Workshop Genome Inform., vol. 8, pp. 25-34 (1997)
14. Moret, B.M., Wang, L.S., Warnow, T., Wyman, S.K.: New approaches for reconstructing phylogenies from gene order data. Bioinformatics 17(suppl. 1), S165-S173 (2001)
15. Bourque, G., Pevzner, P.A.: Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Res. 12(1), 26-36 (2002)
16. Adam, Z., Sankoff, D.: The ABCs of MGR with DCJ. Evol. Bioinform. Online 4, 69-74 (2008)
17. Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal genome median and halving problems. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol. 5251, pp. 1-13. Springer, Heidelberg (2008)
18. Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 163-173. Springer, Heidelberg (2006)
19. Bryant, D.: The complexity of the breakpoint median problem. Technical Report CRM-2579, Centre de recherches mathematiques, Université de Montréal (1998)
20. Caprara, A.: The reversal median problem. INFORMS J. Comput. 15, 93-113 (2003)
21. Lovász, L., Plummer, M.D.: Matching theory. Annals of Discrete Mathematics, vol. 29. North-Holland, Amsterdam (1986)
22. Ohno, S.: Evolution by gene duplication. Springer, Heidelberg (1970)
23. Kellis, M., Birren, B.W., Lander, E.S.: Proof and evolutionary analysis of ancient genome duplication in the yeast saccharomyces cerevisiae. Nature 428 (6983), 617-624 (2004)
24. Alekseyev, M.A., Pevzner, P.A.: Colored de Bruijn graphs and the genome halving problem. IEEE/ACM Trans. Comput. Biol. Bioinform. 4(1), 98-107 (2007)
25. Mixtacki, J.: Genome halving under DCJ revisited. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 276-286. Springer, Heidelberg (2008)
26. Warren, R., Sankoff, D.: Genome aliquoting with double cut and join. BMC Bioin-formatics 10(suppl. 1), S2 (2009)
27. Zheng, C., Zhu, Q., Adam, Z., Sankoff, D.: Guided genome halving: hardness, heuristics and the history of the hemiascomycetes. Bioinformatics 24(13), i96-i104 (2008)