{"external_id":{"isi":["000511618800007"]},"publication_identifier":{"eissn":["14712105"]},"doi":"10.1186/s12859-019-3208-4","publication":"BMC Bioinformatics","author":[{"first_name":"Sergey","last_name":"Aganezov","full_name":"Aganezov, Sergey"},{"last_name":"Zban","first_name":"Ilya","full_name":"Zban, Ilya"},{"first_name":"Vitalii","last_name":"Aksenov","full_name":"Aksenov, Vitalii","id":"2980135A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Alexeev","first_name":"Nikita","full_name":"Alexeev, Nikita"},{"first_name":"Michael C.","last_name":"Schatz","full_name":"Schatz, Michael C."}],"has_accepted_license":"1","language":[{"iso":"eng"}],"article_number":"641","_id":"7214","citation":{"ama":"Aganezov S, Zban I, Aksenov V, Alexeev N, Schatz MC. Recovering rearranged cancer chromosomes from karyotype graphs. <i>BMC Bioinformatics</i>. 2019;20. doi:<a href=\"https://doi.org/10.1186/s12859-019-3208-4\">10.1186/s12859-019-3208-4</a>","ista":"Aganezov S, Zban I, Aksenov V, Alexeev N, Schatz MC. 2019. Recovering rearranged cancer chromosomes from karyotype graphs. BMC Bioinformatics. 20, 641.","apa":"Aganezov, S., Zban, I., Aksenov, V., Alexeev, N., &#38; Schatz, M. C. (2019). Recovering rearranged cancer chromosomes from karyotype graphs. <i>BMC Bioinformatics</i>. BMC. <a href=\"https://doi.org/10.1186/s12859-019-3208-4\">https://doi.org/10.1186/s12859-019-3208-4</a>","chicago":"Aganezov, Sergey, Ilya Zban, Vitalii Aksenov, Nikita Alexeev, and Michael C. Schatz. “Recovering Rearranged Cancer Chromosomes from Karyotype Graphs.” <i>BMC Bioinformatics</i>. BMC, 2019. <a href=\"https://doi.org/10.1186/s12859-019-3208-4\">https://doi.org/10.1186/s12859-019-3208-4</a>.","short":"S. Aganezov, I. Zban, V. Aksenov, N. Alexeev, M.C. Schatz, BMC Bioinformatics 20 (2019).","mla":"Aganezov, Sergey, et al. “Recovering Rearranged Cancer Chromosomes from Karyotype Graphs.” <i>BMC Bioinformatics</i>, vol. 20, 641, BMC, 2019, doi:<a href=\"https://doi.org/10.1186/s12859-019-3208-4\">10.1186/s12859-019-3208-4</a>.","ieee":"S. Aganezov, I. Zban, V. Aksenov, N. Alexeev, and M. C. Schatz, “Recovering rearranged cancer chromosomes from karyotype graphs,” <i>BMC Bioinformatics</i>, vol. 20. BMC, 2019."},"article_type":"original","year":"2019","intvolume":"        20","volume":20,"ddc":["570"],"isi":1,"file_date_updated":"2020-07-14T12:47:54Z","month":"12","article_processing_charge":"No","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2023-09-06T14:51:06Z","file":[{"relation":"main_file","checksum":"7a30357efdcf8f66587ed495c0927724","content_type":"application/pdf","file_name":"2019_BMCBioinfo_Aganezov.pdf","access_level":"open_access","creator":"dernst","date_updated":"2020-07-14T12:47:54Z","file_id":"7221","file_size":1917374,"date_created":"2020-01-02T16:10:58Z"}],"type":"journal_article","day":"17","department":[{"_id":"DaAl"}],"abstract":[{"lang":"eng","text":"Background: Many cancer genomes are extensively rearranged with highly aberrant chromosomal karyotypes. Structural and copy number variations in cancer genomes can be determined via abnormal mapping of sequenced reads to the reference genome. Recently it became possible to reconcile both of these types of large-scale variations into a karyotype graph representation of the rearranged cancer genomes. Such a representation, however, does not directly describe the linear and/or circular structure of the underlying rearranged cancer chromosomes, thus limiting possible analysis of cancer genomes somatic evolutionary process as well as functional genomic changes brought by the large-scale genome rearrangements.\r\n\r\nResults: Here we address the aforementioned limitation by introducing a novel methodological framework for recovering rearranged cancer chromosomes from karyotype graphs. For a cancer karyotype graph we formulate an Eulerian Decomposition Problem (EDP) of finding a collection of linear and/or circular rearranged cancer chromosomes that are determined by the graph. We derive and prove computational complexities for several variations of the EDP. We then demonstrate that Eulerian decomposition of the cancer karyotype graphs is not always unique and present the Consistent Contig Covering Problem (CCCP) of recovering unambiguous cancer contigs from the cancer karyotype graph, and describe a novel algorithm CCR capable of solving CCCP in polynomial time. We apply CCR on a prostate cancer dataset and demonstrate that it is capable of consistently recovering large cancer contigs even when underlying cancer genomes are highly rearranged.\r\n\r\nConclusions: CCR can recover rearranged cancer contigs from karyotype graphs thereby addressing existing limitation in inferring chromosomal structures of rearranged cancer genomes and advancing our understanding of both patient/cancer-specific as well as the overall genetic instability in cancer."}],"date_published":"2019-12-17T00:00:00Z","publication_status":"published","publisher":"BMC","scopus_import":"1","oa":1,"oa_version":"Published Version","date_created":"2019-12-29T23:00:46Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Recovering rearranged cancer chromosomes from karyotype graphs","quality_controlled":"1","status":"public"}