Institutional Repository
| a new approximation algorithm for the k-facility location problem | |
| Zhang Peng | |
| 2007 | |
| Source | THEORETICAL COMPUTER SCIENCE
 |
| ISSN | 0304-3975 |
| Volume | 384Issue:1Pages:126-135 |
| Indexed Type | cnki ; ei ; sci ; sciencedirect |
| Abstract | 为完善小麦遗传图谱并对小麦主要品质性状进行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,标记间的平均遗传距离 |
| Keyword | 小麦,重组自交系群体,Ssr标记,连锁图谱,多态性facility Location K-median Local Search Approximation Algorithm |
| Department | Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China. Grad Univ Chinese Acad Sci, Beijing, Peoples R China. |
| Subject | Computer Science, Theory & Methods |
| Language | 英语 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/11222 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Zhang Peng. a new approximation algorithm for the k-facility location problem[J]. THEORETICAL COMPUTER SCIENCE,2007,384(1):126-135. |
| APA | Zhang Peng.(2007).a new approximation algorithm for the k-facility location problem.THEORETICAL COMPUTER SCIENCE,384(1),126-135. |
| MLA | Zhang Peng."a new approximation algorithm for the k-facility location problem".THEORETICAL COMPUTER SCIENCE 384.1(2007):126-135. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| a new approximation （501KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment