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 条
  • [1] Computational Complexity of Fundamental Problems in Social Choice Theory
    Dey, Palash
    Narahari, Y.
    Bhattacharyya, Arnab
    PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS (AAMAS'15), 2015, : 1973 - 1974
  • [2] Computational Complexity of Two Problems of Cognitive Data Analysis
    Kutnenko O.A.
    Journal of Applied and Industrial Mathematics, 2022, 16 (01) : 89 - 97
  • [3] The complexity of checking consistency of pedigree information and related problems
    Aceto, L
    Hansen, JA
    Ingólfsdóttir, A
    Johnsen, J
    Knudsen, J
    THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2003, 2841 : 174 - 187
  • [4] The complexity of checking consistency of pedigree information and related problems
    Luca Aceto
    Jens A. Hansen
    Anna Ingólfsdóttir
    Jacob Johnsen
    John Knudsen
    Journal of Computer Science and Technology, 2004, 19 : 42 - 59
  • [5] The complexity of checking consistency of pedigree information and related problems
    Aceto, L
    Hansen, JA
    Ingólfsdóttir, A
    Johnsen, J
    Knudsen, J
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2004, 19 (01) : 42 - 59
  • [6] COMPUTATIONAL COMPLEXITY OF HOLANT PROBLEMS
    Cai, Jin-Yi
    Lu, Pinyan
    Xia, Mingji
    SIAM JOURNAL ON COMPUTING, 2011, 40 (04) : 1101 - 1132
  • [7] COMPLEXITY PROBLEMS IN COMPUTATIONAL THEORY
    SLISENKO, AO
    RUSSIAN MATHEMATICAL SURVEYS, 1981, 36 (06) : 23 - 125
  • [8] Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems
    Watanabe, Toshimasa
    2012 THIRD INTERNATIONAL CONFERENCE ON NETWORKING AND COMPUTING (ICNC 2012), 2012, : 19 - 20
  • [9] The computational complexity of bilevel assignment problems
    Elisabeth Gassner
    Bettina Klinz
    4OR, 2009, 7 : 379 - 394
  • [10] Sample complexity for computational classification problems
    Ryabko, Daniil
    ALGORITHMICA, 2007, 49 (01) : 69 - 77
12345