Linearization of Ancestral Genomes with Duplicated Genes

P. Avdeyev, M. Alekseyev
{"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.
具有重复基因的祖先基因组线性化
比较基因组学的关键计算问题之一是基于现存物种的基因组重建祖先物种的基因组。由于基因组结构的大多数戏剧性变化是由基因组重排引起的,因此这个问题通常被提出为最小化现存和祖先基因组之间的基因组重排数量。三个给定基因组的基本情况被称为基因组中位数问题。全基因组复制(WGDs)代表了另一种戏剧性的进化事件,并激发了预复制祖先基因组的重建,称为基因组减半问题。对于已知的线性基因组,由线性染色体组成的预复制或中位基因组的重建是非常棘手的。存在有效的方法来解决这个问题的宽松版本,其中允许预复制或中位基因组具有圆形染色体。在此之前,我们提出了一种构造基因组中值问题的近似解的方法,并证明了其近似误差的一个界。在这项研究中,我们扩展了提出的方法来构造基因组减半问题的近似解。我们还将最初提出的方法扩展到具有重复基因的基因组中值问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信