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.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1089/106652703322539088 | DOI Listing |
Publication Analysis
Top Keywords
pedigree analysis
8
complexity fundamental
4
fundamental computational
4
problems
4
computational problems
4
problems pedigree
4
analysis pedigree
4
analysis central
4
central component
4
component current
4
Similar Publications
Want AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!