-
2
-
-
0029886532
-
Parametric and nonparametric linkage analysis: A unified multipoint approach
-
Leonid Kruglyak, Mark J Daly, Mary Pat Reeve-Daly, Eric S Lander. Parametric and nonparametric linkage analysis: A unified multipoint approach. American Journal of Human Genetics, 1996, 58: 1347-1363.
-
(1996)
American Journal of Human Genetics
, vol.58
, pp. 1347-1363
-
-
Kruglyak, L.1
Daly, M.J.2
Reeve-Daly, M.P.3
Lander, E.S.4
-
3
-
-
0036338150
-
Merlin: Rapid analysis of dense genetic maps using sparse gene flow trees
-
Abecasis G R, Cherny S S et al. Merlin: Rapid analysis of dense genetic maps using sparse gene flow trees. Nature Genetics, 2002, 30: 97-101.
-
(2002)
Nature Genetics
, vol.30
, pp. 97-101
-
-
Abecasis, G.R.1
Cherny, S.S.2
-
4
-
-
0032231941
-
Pedcheck: A program for identification of genotype incompatibilities in linkage analysis
-
Jeffrey R O'Connell, Daniel E Weeks. Pedcheck: A program for identification of genotype incompatibilities in linkage analysis. American Journal of Human Genetics, 1998, 63: 259-266.
-
(1998)
American Journal of Human Genetics
, vol.63
, pp. 259-266
-
-
O'Connell, J.R.1
Weeks, D.E.2
-
5
-
-
85039567727
-
-
November
-
deCode News Center, November 2001. http://www.decode.com/news/releases/.
-
(2001)
-
-
-
7
-
-
0036157589
-
Detection and integration of genotyping errors in statistical genetics
-
Eric Sobel, Jeanette C Papp, Kenneth Lange. Detection and integration of genotyping errors in statistical genetics. American Journal of Human Genetics, 2002, 70: 496-508.
-
(2002)
American Journal of Human Genetics
, vol.70
, pp. 496-508
-
-
Sobel, E.1
Papp, J.C.2
Lange, K.3
-
8
-
-
85039566667
-
Mænd vil vide, hvem de er far til
-
(In Danish)
-
Jan Dohrmann. Mænd vil vide, hvem de er far til. Nordjyske, 2002. (In Danish).
-
(2002)
Nordjyske
-
-
Dohrmann, J.1
-
9
-
-
1242274172
-
Back to your roots
-
Mick Hamer. Back to your roots. New Scientist, 2002, 2334: 33-36.
-
(2002)
New Scientist
, vol.2334
, pp. 33-36
-
-
Hamer, M.1
-
10
-
-
85039582212
-
-
March
-
Human Genome Diversity Project, March 2002. http://www.stanford.edu/group/morrinst/hgdp.html.
-
(2002)
-
-
-
11
-
-
0033365403
-
An optimal algorithm for automatic genotype elimination
-
Jeffrey R O'Connell, Daniel E Weeks. An optimal algorithm for automatic genotype elimination. American Journal of Human Genetics, 1999, 65: 1733-1740.
-
(1999)
American Journal of Human Genetics
, vol.65
, pp. 1733-1740
-
-
O'Connell, J.R.1
Weeks, D.E.2
-
13
-
-
0242659452
-
On the complexity of fundamental computational problems in pedigree analysis
-
Technical Report CSE-99-8, Computer Science Department, University of California, Davis, September; Revised version to appear in Journal of Computational Biology
-
Antonio Piccolboni, Dan Gusfield. On the complexity of fundamental computational problems in pedigree analysis. Technical Report CSE-99-8, Computer Science Department, University of California, Davis, September 1999. Revised version to appear in the Journal of Computational Biology.
-
(1999)
-
-
Piccolboni, A.1
Gusfield, D.2
-
14
-
-
0023259678
-
An algorithm for automatic genotype elimination
-
Kenneth Lange, Tushar Madhu Goradia. An algorithm for automatic genotype elimination. American Journal of Human Genetics, 1987, 40: 250-256.
-
(1987)
American Journal of Human Genetics
, vol.40
, pp. 250-256
-
-
Lange, K.1
Goradia, T.M.2
-
15
-
-
0037701006
-
Efficient rule-based haplotyping algorithms for pedigree data [extended abstract]
-
ACM, April 10-13
-
Jing Li, Tao Jiang. Efficient rule-based haplotyping algorithms for pedigree data [extended abstract]. In Proc. RECOMB'03, Berlin, Germany, ACM, April 10-13, 2003, pp.197-206.
-
(2003)
Proc. RECOMB'03, Berlin, Germany
, pp. 197-206
-
-
Li, J.1
Jiang, T.2
-
16
-
-
0031897962
-
Protein folding in the hydrophobic-hydrophilic (hp) model is NP-complete
-
Bonnie Berger, Tom Leighton. Protein folding in the hydrophobic-hydrophilic (hp) model is NP-complete. Journal of Computational Biology, 1998, 5(1): 27-40.
-
(1998)
Journal of Computational Biology
, vol.5
, Issue.1
, pp. 27-40
-
-
Berger, B.1
Leighton, T.2
-
17
-
-
0031645683
-
On the complexity of protein folding (extended abstract)
-
ACM Press
-
Pierluigi Crescenzi, Deborah Goldman, Christos Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis. On the complexity of protein folding (extended abstract). In Proc. the Thirtieth Annual ACM Symp. Theory of Computing, ACM Press, 1998, pp.597-603.
-
(1998)
Proc. the Thirtieth Annual ACM Symp. Theory of Computing
, pp. 597-603
-
-
Crescenzi, P.1
Goldman, D.2
Papadimitriou, C.3
Piccolboni, A.4
Yannakakis, M.5
-
18
-
-
0242659450
-
Computational complexity of consistency checking
-
[thesis]. Department of Computer Science, Aalborg University, June
-
Jens A Hansen, Jacob Johnsen, John Knudsen. Computational complexity of consistency checking [thesis]. Department of Computer Science, Aalborg University, June 2002. Available at http://www.cs.auc.dk/~luca/PAPERS/hjk02.ps.gz.
-
(2002)
-
-
Hansen, J.A.1
Johnsen, J.2
Knudsen, J.3
-
19
-
-
25044470730
-
Multipoint linkage analysis based on allele sharing models
-
[dissertation]. Institute of Statistics and Decision Sciences, Duke University
-
Daniel Fanner Gudbjartsson. Multipoint Linkage Analysis Based on Allele Sharing Models [dissertation]. Institute of Statistics and Decision Sciences, Duke University, 2000.
-
(2000)
-
-
Gudbjartsson, D.F.1
-
20
-
-
0003408936
-
-
The Johns Hopkins University Press, 3rd Edition
-
Jurg Ott. Analysis of Human Genetic Linkage. The Johns Hopkins University Press, 3rd Edition, 1999.
-
(1999)
Analysis of Human Genetic Linkage
-
-
Ott, J.1
-
22
-
-
1242319096
-
-
Tuesday, April 9; Personal communication
-
Claus Bøttcher Jørgensen, Tuesday, April 9, 2002. Personal communication.
-
(2002)
-
-
Jørgensen, C.B.1
-
23
-
-
85039579415
-
-
Monday, October 28; Personal communication
-
Kenneth Lange. Monday, October 28, 2002. Personal communication.
-
(2002)
-
-
Lange, K.1
-
25
-
-
0022769976
-
Graph-based algorithms for Boolean function manipulation
-
August
-
Bryant R E. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Computers, August 1986, C-35(8): 677-691.
-
(1986)
IEEE Trans. Computers
, vol.C-35
, Issue.8
, pp. 677-691
-
-
Bryant, R.E.1
-
26
-
-
0001788107
-
Algorithms for the satisfiability (SAT) problem: A survey
-
Amer. Math. Soc., Providence, RI
-
Jun Gu, Paul W Purdom, John Franco, Benjamin W Wah. Algorithms for the satisfiability (SAT) problem: A survey. In Satisfiability Problem: Theory and Applications (Piscataway, NJ, 1996), DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Amer. Math. Soc., Providence, RI, 1997, 35: 19-151.
-
(1997)
Satisfiability Problem: Theory and Applications (Piscataway, NJ, 1996), DIMACS Ser. Discrete Math. Theoret. Comput. Sci.
, vol.35
, pp. 19-151
-
-
Gu, J.1
Purdom, P.W.2
Franco, J.3
Wah, B.W.4
-
27
-
-
49249151236
-
The complexity of computing the permanent
-
Valiant L G. The complexity of computing the permanent. Theoret. Comput. Sci., 1979, 8(2): 189-201.
-
(1979)
Theoret. Comput. Sci.
, vol.8
, Issue.2
, pp. 189-201
-
-
Valiant, L.G.1
|