TY - BOOK AU - Fertin, G. AU - Labarre, A. AU - Rusu, I. AU - Tannier, E. AU - Vialette, S. PY - 2009 DA - 2009// TI - Combinatorics of Genome Rearrangements UR - https://doi.org/10.7551/mitpress/9780262062824.001.0001 DO - 10.7551/mitpress/9780262062824.001.0001 ID - Fertin2009 ER - TY - CHAP AU - Bergeron, A. AU - Mixtacki, J. AU - Stoye, J. PY - 2006 DA - 2006// TI - A unifying view of genome rearrangements BT - Proc 6th Workshop Algs in Bioinf (WABI'06), Volume 4175 of Lecture Notes in Comp Sci PB - Springer Verlag CY - Berlin ID - Bergeron2006 ER - TY - JOUR AU - Yancopoulos, S. AU - Attie, O. AU - Friedberg, R. PY - 2005 DA - 2005// TI - Efficient sorting of genomic permutations by translocation, inversion and block interchange JO - Bioinformatics VL - 21 UR - https://doi.org/10.1093/bioinformatics/bti535 DO - 10.1093/bioinformatics/bti535 ID - Yancopoulos2005 ER - TY - JOUR AU - Bergeron, A. AU - Mixtacki, J. AU - Stoye, J. PY - 2009 DA - 2009// TI - A new linear-time algorithm to compute the genomic distance via the double cut and join distance JO - Theor Comput Sci VL - 410 UR - https://doi.org/10.1016/j.tcs.2009.09.008 DO - 10.1016/j.tcs.2009.09.008 ID - Bergeron2009 ER - TY - CHAP AU - Chen, X. PY - 2010 DA - 2010// TI - On sorting permutations by double-cut-and-joins BT - Proc 16th Conf Computing and Combinatorics (COCOON'10), Volume 6196 of Lecture Notes in Comp Sci PB - Springer Verlag CY - Berlin ID - Chen2010 ER - TY - JOUR AU - Chen, X. AU - Sun, R. AU - Yu, J. PY - 2011 DA - 2011// TI - Approximating the double-cut-and-join distance between unsigned genomes JO - BMC Bioinformatics VL - 12 UR - https://doi.org/10.1186/1471-2105-12-S9-S17 DO - 10.1186/1471-2105-12-S9-S17 ID - Chen2011 ER - TY - CHAP AU - Yancopoulos, S. AU - Friedberg, R. PY - 2008 DA - 2008// TI - Sorting genomes with insertions, deletions and duplications by DCJ BT - recombcg08 ID - Yancopoulos2008 ER - TY - CHAP AU - Hannenhalli, S. AU - Pevzner, P. PY - 1995 DA - 1995// TI - Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals) BT - Proc 27th Ann ACM Symp Theory of Comput (STOC'95) PB - ACM Press CY - New York UR - https://doi.org/10.1145/225058.225112 DO - 10.1145/225058.225112 ID - Hannenhalli1995 ER - TY - JOUR AU - Bader, D. AU - Moret, B. AU - Yan, M. PY - 2001 DA - 2001// TI - A fast linear-time algorithm for inversion distance with an experimental comparison JO - J Comput Biol VL - 8 UR - https://doi.org/10.1089/106652701753216503 DO - 10.1089/106652701753216503 ID - Bader2001 ER - TY - JOUR AU - Jean, G. AU - Nikolski, M. PY - 2007 DA - 2007// TI - Genome rearrangements: a correct algorithm for optimal capping JO - Inf Proc Letters VL - 104 UR - https://doi.org/10.1016/j.ipl.2007.04.011 DO - 10.1016/j.ipl.2007.04.011 ID - Jean2007 ER - TY - JOUR AU - Ozery-Flato, M. AU - Shamir, R. PY - 2003 DA - 2003// TI - Two notes on genome rearrangement JO - J Bioinf Comp Bio VL - 1 UR - https://doi.org/10.1142/S0219720003000198 DO - 10.1142/S0219720003000198 ID - Ozery-Flato2003 ER - TY - JOUR AU - Tesler, G. PY - 2002 DA - 2002// TI - Efficient algorithms for multichromosomal genome rearrangements JO - J Comput Syst Sci VL - 65 UR - https://doi.org/10.1016/S0022-0000(02)00011-9 DO - 10.1016/S0022-0000(02)00011-9 ID - Tesler2002 ER - TY - JOUR AU - El-Mabrouk, N. PY - 2001 DA - 2001// TI - Sorting signed permutations by reversals and insertions/deletions of contiguous segments JO - Journal of Discrete Algorithms VL - 1 ID - El-Mabrouk2001 ER - TY - JOUR AU - Chen, X. AU - Zheng, J. AU - Fu, Z. AU - Nan, P. AU - Zhong, Y. AU - Lonardi, S. AU - Jiang, T. PY - 2005 DA - 2005// TI - Assignment of orthologous genes via genome rearrangement JO - ACM/IEEE Trans on Comput Bio & Bioinf VL - 2 UR - https://doi.org/10.1109/TCBB.2005.48 DO - 10.1109/TCBB.2005.48 ID - Chen2005 ER - TY - CHAP AU - Braga, M. AU - Willing, E. AU - Stoye, J. PY - 2010 DA - 2010// TI - Genomic distance with DCJ and indels BT - Algorithms in Bioinformatics UR - https://doi.org/10.1007/978-3-642-15294-8_8 DO - 10.1007/978-3-642-15294-8_8 ID - Braga2010 ER - TY - JOUR AU - Angibaud, S. AU - Fertin, G. AU - Rusu, I. AU - Vialette, S. PY - 2007 DA - 2007// TI - A pseudo-boolean framework for computing rearrangement distances between genomes with duplicates JO - jcb VL - 14 ID - Angibaud2007 ER - TY - JOUR AU - Angibaud, S. AU - Fertin, G. AU - Rusu, I. AU - Thévenin, A. AU - Vialette, S. PY - 2009 DA - 2009// TI - On the approximability of comparing genomes with duplicates JO - Journal of Graph Algorithms and Applications VL - 13 UR - https://doi.org/10.7155/jgaa.00175 DO - 10.7155/jgaa.00175 ID - Angibaud2009 ER - TY - JOUR AU - Caprara, A. AU - Rizzi, R. PY - 2002 DA - 2002// TI - Improved approximation for breakpoint graph decomposition and sorting by reversals JO - J of Combin Optimization VL - 6 UR - https://doi.org/10.1023/A:1013851611274 DO - 10.1023/A:1013851611274 ID - Caprara2002 ER - TY - CHAP AU - Christie, D. PY - 1998 DA - 1998// TI - A 3/2-approximation algorithm for sorting by reversals BT - Proc 9th Ann ACM/SIAM Symp Discrete Algs (SODA'98) PB - SIAM Press CY - Philadelphia ID - Christie1998 ER - TY - JOUR AU - Lin, G. AU - Jiang, T. PY - 2004 DA - 2004// TI - A further improved approximation algorithm for breakpoint graph decomposition JO - J of Combin Optimization VL - 8 UR - https://doi.org/10.1023/B:JOCO.0000031419.12290.2b DO - 10.1023/B:JOCO.0000031419.12290.2b ID - Lin2004 ER - TY - CHAP AU - Halldórsson, M. PY - 1995 DA - 1995// TI - Approximating discrete collections via local improvements BT - Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics ID - Halldórsson1995 ER - TY - JOUR AU - Hurkens, C. AU - Schrijver, A. PY - 1989 DA - 1989// TI - On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems JO - SIAM Journal on Discrete Mathematics VL - 2 UR - https://doi.org/10.1137/0402008 DO - 10.1137/0402008 ID - Hurkens1989 ER - TY - JOUR AU - Kececioglu, J. AU - Sankoff, D. PY - 1995 DA - 1995// TI - Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement JO - Algorithmica VL - 13 UR - https://doi.org/10.1007/BF01188586 DO - 10.1007/BF01188586 ID - Kececioglu1995 ER - TY - JOUR AU - Bailey, J. AU - Eichler, E. PY - 2006 DA - 2006// TI - Primate segmental duplications: crucibles of evolution, diversity and disease JO - Nature Reviews Genetics VL - 7 UR - https://doi.org/10.1038/nrg1895 DO - 10.1038/nrg1895 ID - Bailey2006 ER - TY - STD TI - York T, Durrett R, Nielsen R: Dependence of paracentric inversion rate on tract length. BMC Bioinformatics. 2007, 8 (115): ID - ref25 ER - TY - CHAP AU - Lefebvre, J. F. AU - El-Mabrouk, N. AU - Tillier, E. AU - Sankoff, D. PY - 2003 DA - 2003// TI - Detection and validation of single gene inversions BT - Proc 11th Int'l Conf on Intelligent Systems for Mol Biol (ISMB'03), Volume 19 of Bioinformatics ID - Lefebvre2003 ER -