热门
computational complexity of counting problems on 3-regular planar graphs
文献类型：期刊论文
| 作者 | Xia Mingji ; Zhang Peng ; Zhao Wenbo |
| 刊名 | THEORETICAL COMPUTER SCIENCE
 |
| 出版日期 | 2007 |
| 卷号 | 384期号:1页码:111-125 |
| 关键词 | 朝鲜鹌鹑,微卫星标记,遗传多样性,多态信息含量,杂合度#P-completeness holographic reduction vertex cover matching |
| ISSN号 | 0304-3975 |
| 中文摘要 | 选用鹌鹑上的12个微卫星位点,对随机选取朝鲜鹌鹑的40个个体进行多态性检测,共检测到55个等位基因,每个座位平均等位基因数为4.583个。该群体平均多态信息含量和平均杂合度分别为0.6945和0.7111,表明朝鲜鹌鹑属多态性较丰富的群体。 |
| 学科主题 | Computer Science, Theory & Methods |
| 收录类别 | CNKI ; EI ; SCI ; SCIENCEDIRECT |
| 语种 | 英语 |
| WOS记录号 | WOS:000249704400011 |
| 公开日期 | 2011-07-01 |
| 附注 | A variety of counting problems on 3-regular planar graphs are considered in this paper. We give a sufficient condition which guarantees that the coefficients of a homogeneous polynomial can be uniquely determined by its values on a recurrence |
| 源URL | [http://124.16.136.157/handle/311060/11220]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 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. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。