On the complexity of fundamental computational problems in pedigree analysis

On the complexity of fundamental computational problems in pedigree analysis

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 pro...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computational biology 2003-01, Vol.10 (5), p.763-773
Hauptverfasser: Piccolboni, Antonio, Gusfield, Dan
Format: Artikel
Sprache:eng
Schlagworte:
Computational Biology - methods
Models, Genetic
Pedigree
Probability
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1066-5277
1557-8666
DOI:10.1089/106652703322539088