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 条
  • [31] Computational complexity of deep learning: fundamental limitations and empirical phenomena
    Barak, Boaz
    Carrell, Annabelle
    Favero, Alessandro
    Li, Weiyu
    Stephan, Ludovic
    Zlokapa, Alexander
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2024, 2024 (10):
  • [32] Computational complexity of interacting electrons and fundamental limitations of density functionaltheory
    Max-Planck-Institut für Quantenoptik, Hans-Kopfermann-Str.1, D-85748 Garching, Germany
    不详
    Nat. Phys., 2009, 10 (732-735):
  • [33] Computational complexity analysis of MAS/MMAS and comparison with MoM for scattering and radiation problems
    Avdikos, GK
    Anastassiu, HT
    Kaklamani, DI
    Uzunoglu, NK
    ADVANCES IN SCATTERING AND BIOMEDICAL ENGINEERING, PROCEEDINGS, 2004, : 44 - 51
  • [34] The parametrized complexity of some fundamental problems in coding theory
    Downey, RG
    Fellows, MR
    Vardy, A
    Whittle, G
    SIAM JOURNAL ON COMPUTING, 1999, 29 (02) : 545 - 570
  • [35] Computational Complexity of College Math Eigenvalue Problems
    Mori, Yuki
    Yukita, Shuichi
    FRONTIERS IN EDUCATION CONFERENCE (FIE), 2015, 2015, : 640 - 645
  • [36] ON THE COMPUTATIONAL-COMPLEXITY OF DISCRETE MULTIVARIATE PROBLEMS
    YEMELICHEV, VA
    PEREPELITSA, VA
    SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1988, 26 (04): : 162 - 168
  • [37] ON THE COMPUTATIONAL-COMPLEXITY OF PATH COVER PROBLEMS
    NTAFOS, S
    GONZALEZ, T
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 29 (02) : 225 - 242
  • [38] ARITHMETIC THEORIES FOR COMPUTATIONAL-COMPLEXITY PROBLEMS
    HOMER, S
    REIF, J
    INFORMATION AND CONTROL, 1986, 69 (1-3): : 1 - 11
  • [39] On some multigraph decomposition problems and their computational complexity
    Priesler, M
    Tarsi, M
    DISCRETE MATHEMATICS, 2004, 281 (1-3) : 247 - 254
  • [40] On the Computational Complexity of Partial Word Automata Problems
    Holzer, Markus
    Jakobi, Sebastian
    Wendlandt, Matthias
    FUNDAMENTA INFORMATICAE, 2016, 148 (3-4) : 267 - 289
12345