Representing and decomposing genomic structural variants as balanced integer flows on sequence graphs

BMC Bioinformatics

Volumn 17, Issue 1, 2016, Pages

  Zerbino, Daniel R ^a,b   Ballinger, Tracy ^a,b   Paten, Benedict ^b   Hickey, Glenn ^b   Haussler, David ^b  

^a EUROPEAN BIOINFORMATICS INSTITUTE   (United Kingdom)

^b University of California Santa Cruz   (United States)

Author keywords

Copy number variation; DCJ; Rearrangement; Structural variation

Indexed keywords

CHROMOSOMES; FLOW GRAPHS;

COMBINATORIAL COMPLEXITY; COPY NUMBER VARIATIONS; EVOLUTIONARY HISTORY; GENERAL MODEL; REARRANGEMENT; SINGLE NUCLEOTIDES; STRUCTURAL DIFFERENCES; STRUCTURAL VARIATIONS;

GENES;

COPY NUMBER VARIATION; DECOMPOSITION; DNA STRUCTURE; GENOME; MODEL; PHENOTYPE;

EID: 84989315211     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/s12859-016-1258-4     Document Type: Article

References (33)

1. The International HapMap3 Consortium. Integrating common and rare genetic variation in diverse human populations. Nature. 2010; 467:52-8.
2. The 1000 Genomes Project Consortium. An integrated map of genetic variation from 1,092 human genomes. Nature. 2012; 491:56-65.
3. Cancer Genome Atlas Research Network. Comprehensive genomic characterization defines human glioblastoma genes and core pathways. Nature. 2008; 455(7216):1061-8. doi: http://dx.doi.org/10.1038/nature07385.
4. The International Cancer Genome Consortium. International network of cancer genome projects. Nature. 2010; 464:993-8.
5. Jukes T, Cantor C. Evolution of Protein Molecules. Mammalian Protein Metabolism. Vol. 3. New York: Academic Press; 1969.
6. Yancopoulos S, Attie O, Friedberg R. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics. 2005; 21(16):3340-346. doi: http://dx.doi.org/10.1093/bioinformatics/bti535.
7. Feijão P, Meidanis J. Scj: A breakpoint-like distance that simplifies real several rearrangement problems. IEEE-ACM Trans Comp Biol Bioinf. 2011; 8(5):1318-29.
8. Yancopoulos S, Friedberg R. DCJ path formulation for genome transformations which include insertions, deletions, and duplications. J Comput Biol. 2009; 16(10):1311-38. doi: http://dx.doi.org/10.1089/cmb.2009.0092.
9. Zhang F, Gu W, Hurles M, Lupski J. Copy number variation in human health, disease, and evolution. Annu Rev Hum Genet. 2009; 10:451-81.
10. Shlien A, Malkin D. Copy number variations and cancer. Genome Med. 2009; 1(6):62. doi: http://dx.doi.org/10.1186/gm62.
11. Hannenhalli S, Pevzner PA. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J ACM. 1999; 46(1):1-27.
12. Bergeron A, Mixtacki J, Stoye J. A unifying view of genome rearrangements. Algorithm Bioinforma. 2006; 4175:163-73.
13. Durrett R. Genome Rearrangement: Recent Progress and Open Problems In: Nielsen R, editor. Statistical Methods in Molecular Evolution. New York: Springer-Verlag: 2005.
14. El-Mabrouk N, Nadeau JH, Sankoff D. Genome halving. Lect Notes Comput Sci. 1998; 1448:235-50.
15. El-Mabrouk N, Sankoff D. On the reconstruction of ancient doubled circular genomes using minimum reversal. Genome Inf. 1999; 10:83-93.
16. El-Mabrouk N, Bryant B, Sankoff D. Reconstructing the pre-doubling genome. In: Proc. Third Ann. Int'l Conf. Computational Molecular Biology (RECOMB). Berlin: Springer-Verlag: 1999. p. 153-163.
17. El-Mabrouk N, Sankoff D. The reconstruction of doubled genomes. SIAM J Comput. 2003; 32:754-92.
18. Alekseyev MA, Pevzner PA. Colored de bruijn graphs and the genome halving problem. IEEE-ACM Trans Comp Biol Bioinf. 2007; 4(1):98-107.
19. El-Mabrouk N. Sorting signed permutations by reversals and insertions/deletions of contiguous segments. J Discrete Algorithm. 2001; 1:105-22.
20. Braga MDV, Willing E, Stoye J. Double cut and join with insertions and deletions. J Comput Biol. 2011; 18(9):1167-84. doi: http://dx.doi.org/10.1089/cmb.2011.0118.
21. Chen X, Zheng J, Fu Z, Nan P, Zhong Y, Lonardi S, Jiang T. Assignment of orthologous genes via genome rearrangement. IEEE-ACM Trans Comp Biol Bioinf. 2005; 2(4):302-15.
22. Shao M, Lin Y. Approximating the edit distance for genomes with duplicate genes under dcj, insertion and deletion. BMC Bioinforma. 2012; 13(Suppl 19):513.
23. Shao M, Moret BME. Comparing genomes with rearrangements and segmental duplications. Bioinformatics. 2015; 31:329-8.
24. Shao M, Lin Y, Moret BME. Sorting genomes with rearrangements and segmental duplications through trajectory graphs. BMC Bioinforma. 2013; 14(Suppl 15):9.
25. Bader M. Sorting by reversals, block interchanges, tandem duplications, and deletions. BMC Bioinforma. 2009; 10(Suppl 1):9. doi: http://dx.doi.org/10.1186/1471-2105-10-S1-S9.
26. Bader M. Genome rearrangements with duplications. BMC Bioinforma. 2010; 11(Suppl 1):27.
27. Ozery-Flato M, Shamir R. Sorting cancer karyotypes by elementary operations. J Comput Biol. 2009; 16(10):1445-60.
28. Zeira R, Shamir R. Sorting by cuts, joins and whole chromosome duplications. Combinatorial Pattern Matching. Lecture Notes in Computer Science. vol. 9133. Heidelberg: Springer: 2015. p. 396-409.
29. Paten B, Zerbino D, Hickey G, Haussler D. A unifying parsimony model of genome evolution. BMC Bioinforma. 2014; 15:206.
30. Pevzner PA. DNA phyical mapping and alternating eulerian cycles in colored graphs. Algorithmica. 1995; 13:77-105.
31. Kotzig A. Moves without forbidden transitions in a graph. Matematický časopis. 1968; 18(1):76-80.
32. Harary F, Uhlenbeck GE. On the number of husimi trees: I. Proc Natl Acad Sci. 1952; 39:315-22.
33. MacLane S. A combinatorial condition for planar graphs. Fundam Math. 1937; 28:22-32.