{"title":"Linearization of Ancestral Genomes with Duplicated Genes","authors":"P. Avdeyev, M. Alekseyev","doi":"10.1145/3388440.3412484","DOIUrl":null,"url":null,"abstract":"One of the key computational problems in comparative genomics is the reconstruction of genomes of ancestral species based on genomes of extant species. Since most dramatic changes in genomic architectures are caused by genome rearrangements, this problem is often posed as minimization of the number of genome rearrangements between extant and ancestral genomes. The base case of three given genomes is known as the genome median problem. Whole-genome duplications (WGDs) represent yet another type of dramatic evolutionary events and inspire the reconstruction of preduplicated ancestral genomes, referred to as the genome halving problem. Reconstruction of the preduplicated or median genomes consisting of linear chromosomes for given linear genomes is known to be intractable. There exist efficient methods for solving a relaxed version of this problem, where the preduplicated or median genomes are allowed to have circular chromosomes. Previously we proposed a method for construction of an approximate solution to the genome median problem from a solution to the relaxed version, and proved a bound on its approximation error. In this study, we extend the proposed method for constructing an approximate solution to the genome halving problem. We also extend the originally proposed method to the genome median problem for genomes with duplicated genes.","PeriodicalId":411338,"journal":{"name":"Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3388440.3412484","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
One of the key computational problems in comparative genomics is the reconstruction of genomes of ancestral species based on genomes of extant species. Since most dramatic changes in genomic architectures are caused by genome rearrangements, this problem is often posed as minimization of the number of genome rearrangements between extant and ancestral genomes. The base case of three given genomes is known as the genome median problem. Whole-genome duplications (WGDs) represent yet another type of dramatic evolutionary events and inspire the reconstruction of preduplicated ancestral genomes, referred to as the genome halving problem. Reconstruction of the preduplicated or median genomes consisting of linear chromosomes for given linear genomes is known to be intractable. There exist efficient methods for solving a relaxed version of this problem, where the preduplicated or median genomes are allowed to have circular chromosomes. Previously we proposed a method for construction of an approximate solution to the genome median problem from a solution to the relaxed version, and proved a bound on its approximation error. In this study, we extend the proposed method for constructing an approximate solution to the genome halving problem. We also extend the originally proposed method to the genome median problem for genomes with duplicated genes.