Comparing genomes with rearrangements and segmental duplications

Bioinformatics

Volumn 31, Issue 12, 2015, Pages i329-i338

  Shao, Mingfu ^a   Moret, Bernard M E ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ANIMAL; CHROMOSOME; GENOMICS; HUMAN; MOLECULAR EVOLUTION; MOUSE; PROCEDURES; RAT; SEGMENTAL DUPLICATION; SYSTEM ANALYSIS;

ALGORITHMS; ANIMALS; CHROMOSOMES; EVOLUTION, MOLECULAR; GENOMICS; HUMANS; MICE; PROGRAMMING, LINEAR; RATS; SEGMENTAL DUPLICATIONS, GENOMIC;

EID: 84931083015     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btv229     Document Type: Conference Paper

References (20)

1. Bader D., et al. (2001). A fast linear-time algorithm for inversion distance with an experimental comparison. J. Comput. Biol., 8, 483-491
2. Bang-Jensen J. and Gutin G. (1998). Alternating cycles and trails in 2-edge-coloured complete multigraphs. Discrete Math., 188, 61-72
3. Bergeron A., et al. (2006). A unifying view of genome rearrangements. In: Proceedings of the 6th Workshop on Algorithms in Bioinformatics (WABI'06) , Volume 4175 of Lecture Notes in Computer Science. Springer Verlag, Berlin, pp. 163-173
4. Bergeron A., et al. (2009). A new linear-time algorithm to compute the genomic distance via the double cut and join distance. Theor. Comput. Sci., 410, 5300-5316
5. Braga M., et al. (2010). Genomic distance with DCJ and indels. In: Proceedings of the 10th Workshop on Algorithms in Bioinformatics (WABI'10) , Volume 6293 of Lecture Notes in Computer Science. Springer Verlag, Berlin, pp. 90-101
6. Braga M., et al. (2011). Double cut and join with insertions and deletions. J. Comput. Biol., 18, 1167-1184
7. Chen X. (2010). On sorting permutations by double-cut-and-joins. In: Proceedings of the 16th Conference On Computing and Combinatorics (COCOON'10) , volume 6196 of Lecture Notes in Computer Science. Springer Verlag, Berlin, pp. 439-448
8. Chen X., et al. (2005). Assignment of orthologous genes via genome rearrangement. ACM/IEEE Trans. Comput. Biol. Bioinform., 2, 302-315
9. Dewey C. (2011). Positional orthology: putting genomic evolutionary relationships into context. Brief. Bioinform., 12, 401-412
10. El-Mabrouk N. (2001). Sorting signed permutations by reversals and insertions/deletions of contiguous segments. J. Discrete Algorithms, 1, 105-122
11. Fu Z., et al. (2007). MSOAR: a high-throughput ortholog assignment system based on genome rearrangement. J. Comput. Biol., 14, 1160-1175
12. Gu W., et al. (2008). Mechanisms for human genomic rearrangements. Pathogenetics, 1, 4
13. Hannenhalli S. and Pevzner P. (1995). Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In: Proceedings of the 27th Annual ACM Symposium Theory of Computing (STOC'95) . ACM Press, New York, pp. 178-189
14. Holloway P., et al. (2013). Ancestral genome organization: an alignment approach. J. Comput. Biol., 20, 280-295
15. Kahn C. and Raphael B. (2008). Analysis of segmental duplications via duplication distance. Bioinformatics, 24, i133-i138
16. Kahn C., et al. (2010). Parsimony and likelihood reconstruction of human segmental duplications. Bioinformatics, 26, i446-i452
17. Moret B., et al. (2013). Rearrangements in phylogenetic inference: compare, model, or encode?. In: Chauve C., et al. (eds.) Models and Algorithms for Genome Evolution, Volume 19 of Computational Biology. Springer Verlag, Berlin, pp. 147-172
18. Shao M. and Lin Y. (2012). Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion. BMC Bioinformatics, 13 (Suppl 19) , S13
19. Shao M., et al. (2014). An exact algorithm to compute the DCJ distance for genomes with duplicate genes. In: Proceedings of the 18th International Conference on Computations of Molecular Biology (RECOMB'14) , Volume 8394 of Lecture Notes in Computer Science. Springer Verlag, Berlin, pp. 280-292
20. Yancopoulos S., et al. (2005). Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics, 21, 3340-3346