阿摩線上測驗 登入

申論題資訊

試卷:109年 - 109國立臺灣大學_碩士班招生考試_資訊工程學研究所:資料結構與演算法(A)#106053
科目:台大◆資工◆資料結構與演算法(A)
年份:109年
排序:0

題組內容

15. (15 points) A Single Nucleotide Polymorphism (SNP, pronounced snip) is a single nucleotide variation in the genome that recurs in a signifcant proportion of the population of a species. The patterns of Linkage Disequilibrium (LD) observed in the human population reveal a block-like structure. LD refers to the association that particular alleles at nearby sites are more likely to occur together than would be predicted by chance. The entire chromogome can be partitioned into high LD regions interspersed by low LD regions. The high LD regions are usually called "heplotype blocks," and the low LD ones are referred to as "recombination hotspots." Since there is little or no recombination within a haplotype block, these SNPs are highly correlated. Consequently, a smnall subset of SNPs, called tag SNPs or haplotype tagging SNPs, is suficient to categorize the haplotype patterns of the block. It has been shown that we can recast the tag SNP selection problem as Problem W, which is,"Given a universal set U = {u1, u2, ...un} and a family F = {F1, F2,..., Fm} of subsets of U, Aind a minimu um-size subset 620217e25e286.jpg of F, such that every element of U belongs to at least one subset in620217abd5966.jpg

申論題內容

(a) (S points) Prove or disprove that a greedy approach always delivers an optimal solution fo: Problem