题解：Gene Assembly（区间调度问题)

嘘......

于 2019-08-11 09:46:43 发布

阅读量365

点赞数

分类专栏：杂七杂八

本文链接：https://blog.csdn.net/weixin_43540515/article/details/99169236

版权

随着大量基因DNA序列数据的出现，寻找基因变得越来越重要。基因由多个编码区域（exons）组成，这些exons在蛋白质合成过程中保持顺序。该问题旨在给定一组可能的exons，找到能组装成基因的最大exons链，遵循exons在基因序列中的顺序。输入包含exons的数量及其起始和结束位置，输出是最大exons链的编号。此问题可以转化为一个区间调度问题，通过贪心策略按结束时间排序来解决。

摘要由CSDN通过智能技术生成

Statement of the Problem
With the large amount of genomic DNA sequence data being made available, it is becoming more important to find genes (parts of the genomic DNA which are responsible for the synthesis of proteins) in these sequences. It is known that for eukaryotes (in contrast to prokaryotes) the process is more complicated, because of the presence of junk DNA that interrupts the coding region of genes in the genomic sequence. That is, a gene is composed by several pieces (called exons) of coding regions. It is known that the order of the exons is maintained in the protein synthesis process, but the number of exons and their lengths can be arbitrary.
Most gene finding algorithms have two steps: in the first they search for possible exons; in the second they try to assemble a largest possible gene, by finding a chain with the largest possible number of exons. This chain must obey the order in which the exons appear in the genomic sequence. We say that exon i appea