| 学科主题: | Computer Science, Theory & Methods
|
| 题名: | a new approximation algorithm for the k-facility location problem |
| 作者: | Zhang Peng
|
| 关键词: | 小麦,重组自交系群体,SSR标记,连锁图谱,多态性facility location
; k-median
; local search
; approximation algorithm
|
| 刊名: | THEORETICAL COMPUTER SCIENCE
|
| 发表日期: | 2007
|
| 卷: | 384, 期:1, 页:126-135 | | 收录类别: | cnki
; ei
; sci
; sciencedirect
|
| 部门归属: | Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China. Grad Univ Chinese Acad Sci, Beijing, Peoples R China.
|
| 摘要: | 为完善小麦遗传图谱并对小麦主要品质性状进行QTL定位,以小麦京771和Pm97034及其173个后代重组自交系(RIL)为作图群体,利用906对SSR引物筛选出RIL群体双亲表现多态性的引物270对,多态性频率为29.8%。利用这270对引物对RIL群体进行分析,共检测到184个多态性标记位点,利用其中的129个标记构建小麦分子的遗传连锁图谱。用Mapmaker 3.0和Mapdraw V2.1软件将129个SSR位点绘在小麦遗传连锁图上,该图谱覆盖小麦基因组全长2 106.2 cM,标记间的平均遗传距离 |
| 语种: | 英语
|
| 内容类型: | 期刊论文
|
| URI标识: | http://ir.iscas.ac.cn/handle/311060/11222
|
| Appears in Collections: | 软件所图书馆_期刊论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| a new approximation algorithm for the k-facility location problem.pdf（501KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
Zhang Peng. a new approximation algorithm for the k-facility location problem[J]. THEORETICAL COMPUTER SCIENCE,2007-01-01,384(1):126-135.
|
|
|
