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
来源：
JOURNAL OF COMPUTATIONAL BIOLOGY | 2003年 / 10卷 / 05期
关键词：
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 条
  • [41] On the Computational Complexity of Monotone Constraint Satisfaction Problems
    Hermann, Miki
    Richoux, Florian
    WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5431 : 286 - 297
  • [42] Computational complexity of convoy movement planning problems
    Ram Gopalan
    Mathematical Methods of Operations Research, 2015, 82 : 31 - 60
  • [43] The computational complexity of equivalence and isomorphism problems - Introduction
    Goos, G
    COMPUTATIONAL COMPLEXITY OF EQUIVALENCE AND ISOMORPHISM PROBLEMS, 2000, 1852 : 1 - 10
  • [44] Computational Complexity of Robot Arm Simulation Problems
    Feng, Tianfeng
    Horiyama, Takashi
    Okamoto, Yoshio
    Otachi, Yota
    Saitoh, Toshiki
    Uno, Takeaki
    Uehara, Ryuhei
    COMBINATORIAL ALGORITHMS, IWOCA 2018, 2018, 10979 : 177 - 188
  • [45] A comment on “computational complexity of stochastic programming problems”
    Grani A. Hanasusanto
    Daniel Kuhn
    Wolfram Wiesemann
    Mathematical Programming, 2016, 159 : 557 - 569
  • [46] Computational complexity of convoy movement planning problems
    Gopalan, Ram
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2015, 82 (01) : 31 - 60
  • [47] Computational complexity of problems on probabilistic grammars and transducers
    Casacuberta, F
    de la Higuera, C
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, 2000, 1891 : 15 - 24
  • [48] The computational complexity of some explainable clustering problems
    Laber, Eduardo Sany
    INFORMATION PROCESSING LETTERS, 2024, 184
  • [49] Computational Complexity of Simultaneous Elementary Matching Problems
    Miki Hermann
    Phokion G. Kolaitis
    Journal of Automated Reasoning, 1999, 23 : 107 - 136
  • [50] The computational complexity of some problems of linear algebra
    Buss, JF
    Frandsen, GS
    Shallit, JO
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1999, 58 (03) : 572 - 596
12345