中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
学科主题: Computer Science, Theory & Methods
题名:
computational complexity of counting problems on 3-regular planar graphs
作者: Xia Mingji ; Zhang Peng ; Zhao Wenbo
关键词: 朝鲜鹌鹑,微卫星标记,遗传多样性,多态信息含量,杂合度#P-completeness ; holographic reduction ; vertex cover ; matching
刊名: THEORETICAL COMPUTER SCIENCE
发表日期: 2007
卷: 384, 期:1, 页:111-125
收录类别: 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.
摘要: 选用鹌鹑上的12个微卫星位点,对随机选取朝鲜鹌鹑的40个个体进行多态性检测,共检测到55个等位基因,每个座位平均等位基因数为4.583个。该群体平均多态信息含量和平均杂合度分别为0.6945和0.7111,表明朝鲜鹌鹑属多态性较丰富的群体。
语种: 英语
WOS记录号: WOS:000249704400011
Citation statistics:
内容类型: 期刊论文
URI标识: http://ir.iscas.ac.cn/handle/311060/11220
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
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.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Xia Mingji]'s Articles
[Zhang Peng]'s Articles
[Zhao Wenbo]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Xia Mingji]‘s Articles
[Zhang Peng]‘s Articles
[Zhao Wenbo]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace