Institutional Repository
| computational complexity of counting problems on 3-regular planar graphs | |
| Xia Mingji; Zhang Peng; Zhao Wenbo | |
| 2007 | |
| Source | THEORETICAL COMPUTER SCIENCE
 |
| ISSN | 0304-3975 |
| Volume | 384Issue:1Pages:111-125 |
| Indexed Type | cnki ; ei ; sci ; sciencedirect |
| Abstract | 选用鹌鹑上的12个微卫星位点,对随机选取朝鲜鹌鹑的40个个体进行多态性检测,共检测到55个等位基因,每个座位平均等位基因数为4.583个。该群体平均多态信息含量和平均杂合度分别为0.6945和0.7111,表明朝鲜鹌鹑属多态性较丰富的群体。 |
| Keyword | 朝鲜鹌鹑,微卫星标记,遗传多样性,多态信息含量,杂合度#p-completeness Holographic Reduction Vertex Cover Matching |
| 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 | 英语 |
| WOS ID | WOS:000249704400011 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/11220 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Xia Mingji,Zhang Peng,Zhao Wenbo. computational complexity of counting problems on 3-regular planar graphs[J]. THEORETICAL COMPUTER SCIENCE,2007,384(1):111-125. |
| APA | Xia Mingji,Zhang Peng,&Zhao Wenbo.(2007).computational complexity of counting problems on 3-regular planar graphs.THEORETICAL COMPUTER SCIENCE,384(1),111-125. |
| MLA | Xia Mingji,et al."computational complexity of counting problems on 3-regular planar graphs".THEORETICAL COMPUTER SCIENCE 384.1(2007):111-125. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| computational comple（529KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment