Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming
作者: Vassily LyubetskyRoman GershgorinKonstantin Gorbunov
作者单位: 1Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute)
2Faculty of Mechanics and Mathematics, Lomonosov Moscow State University
刊名: BMC Bioinformatics, 2017, Vol.18 (1)
来源数据库: Springer Journal
DOI: 10.1186/s12859-017-1944-x
关键词: Chromosome structureChromosomal rearrangementAncestral genomeEvolution along the treeReconstruction of ancestral genomesTransformation of chromosome structuresParsimony principleInteger linear programmingEfficient algorithms
英文摘要: Chromosome structure is a very limited model of the genome including the information about its chromosomes such as their linear or circular organization, the order of genes on them, and the DNA strand encoding a gene. Gene lengths, nucleotide composition, and intergenic regions are ignored. Although highly incomplete, such structure can be used in many cases, e.g., to reconstruct phylogeny and evolutionary events, to identify gene synteny, regulatory elements and promoters (considering highly conserved elements), etc. Three problems are considered; all assume unequal gene content and the presence of gene paralogs. The distance problem is to determine the minimum number of operations required to transform one chromosome structure into another and the corresponding transformation itself...
原始语种摘要: Chromosome structure is a very limited model of the genome including the information about its chromosomes such as their linear or circular organization, the order of genes on them, and the DNA strand encoding a gene. Gene lengths, nucleotide composition, and intergenic regions are ignored. Although highly incomplete, such structure can be used in many cases, e.g., to reconstruct phylogeny and evolutionary events, to identify gene synteny, regulatory elements and promoters (considering highly conserved elements), etc. Three problems are considered; all assume unequal gene content and the presence of gene paralogs. The distance problem is to determine the minimum number of operations required to transform one chromosome structure into another and the corresponding transformation itself...
全文获取路径: Springer  (合作)
分享到:
来源刊物:
影响因子:3.024 (2012)

×
关键词翻译
关键词翻译
  • programming 程序设计
  • unequal 不等的
  • nucleotide 核苷酸
  • chromosome 染色体
  • intergenic 基因间的
  • rearrangement 重新配置
  • problem 题目
  • reconstruction 复原
  • genome 基因组
  • known 己知