On the complexity of fundamental computational problems in pedigree analysis

被引:21
|
作者
Piccolboni, A [1 ]
Gusfield, D [1 ]
机构
[1] Univ Calif Davis, Dept Comp Sci, Davis, CA 95616 USA
关键词
linkage analysis; computational complexity; pedigree;
D O I
10.1089/106652703322539088
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Pedigree analysis is a central component of many current efforts to locate genes that contribute to diseases or to valuable traits. The analysis usually involves solving one of two very computation-intense problems. We analyze the complexity of these two problems. Surprisingly, we show that both problems are NP-hard even for pedigrees that contain no inbreeding loops.
引用
收藏
页码:763 / 773
页数:11
相关论文
共 50 条