| Subject: | Computer Science, Theory & Methods
|
| Title: | computational complexity of counting problems on 3-regular planar graphs |
| Author: | Xia Mingji
; Zhang Peng
; Zhao Wenbo
|
| Keyword: | 朝鲜鹌鹑,微卫星标记,遗传多样性,多态信息含量,杂合度#P-completeness
; holographic reduction
; vertex cover
; matching
|
| Source: | THEORETICAL COMPUTER SCIENCE
|
| Issued Date: | 2007
|
| Volume: | 384, Issue:1, Pages:111-125 | | Indexed Type: | cnki
; ei
; sci
; sciencedirect
|
| 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.
|
| Abstract: | 选用鹌鹑上的12个微卫星位点,对随机选取朝鲜鹌鹑的40个个体进行多态性检测,共检测到55个等位基因,每个座位平均等位基因数为4.583个。该群体平均多态信息含量和平均杂合度分别为0.6945和0.7111,表明朝鲜鹌鹑属多态性较丰富的群体。 |
| Language: | 英语
|
| WOS ID: | WOS:000249704400011
|
| Citation statistics: |
|
| Content Type: | 期刊论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/11220
|
| Appears in Collections: | 软件所图书馆_期刊论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| computational complexity of counting problems on 3-regular planar graphs.pdf（529KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
Xia Mingji,Zhang Peng,Zhao Wenbo. computational complexity of counting problems on 3-regular planar graphs[J]. THEORETICAL COMPUTER SCIENCE,2007-01-01,384(1):111-125.
|
|
|
