-
1
-
-
0035065577
-
Single-nucleotide polymorphisms in the public domain: How useful are they?
-
G. Marth, R. Yeh, M. Minton, R. Donaldson, Q. Li, S. Duan, R. Davenport, R. Miller, and P. Kwok. Single-nucleotide polymorphisms in the public domain: how useful are they? Nature Genetics, 27: 371-372, 2001.
-
(2001)
Nature Genetics
, vol.27
, pp. 371-372
-
-
Marth, G.1
Yeh, R.2
Minton, M.3
Donaldson, R.4
Li, Q.5
Duan, S.6
Davenport, R.7
Miller, R.8
Kwok, P.9
-
2
-
-
0035819474
-
Implications of the human genome project for medical science
-
F. S. Collins and V. A. McKusick. Implications of the human genome project for medical science. JAMA, 285:2447-2448, 2001.
-
(2001)
JAMA
, vol.285
, pp. 2447-2448
-
-
Collins, F.S.1
McKusick, V.A.2
-
3
-
-
0035776497
-
Methods for genotyping single nucleotide polymorphisms
-
P. Kwok. Methods for genotyping single nucleotide polymorphisms. Annual Review of Genomics and Human Genetics, 2:235-258, 2001.
-
(2001)
Annual Review of Genomics and Human Genetics
, vol.2
, pp. 235-258
-
-
Kwok, P.1
-
4
-
-
0001781529
-
On the primer selection problem in polymerase chain reaction experiments
-
W.R. Pearson, G. Robins, D.E. Wrege, and T. Zhang. On the primer selection problem in polymerase chain reaction experiments. Discrete and Applied Mathematics, 71:231-246, 1996.
-
(1996)
Discrete and Applied Mathematics
, vol.71
, pp. 231-246
-
-
Pearson, W.R.1
Robins, G.2
Wrege, D.E.3
Zhang, T.4
-
6
-
-
33947165692
-
A greedy algorithm for minimizing the number of primers in multiple PCR experiments
-
K. Doi and H. Imai. A greedy algorithm for minimizing the number of primers in multiple PCR experiments. Genome Informatics, 10:73-82, 1999.
-
(1999)
Genome Informatics
, vol.10
, pp. 73-82
-
-
Doi, K.1
Imai, H.2
-
7
-
-
0029174417
-
A new approach to primer selection problem in polymerase chain reaction experiments
-
AAAI Press, Cambridge, United Kingdom
-
W. R. Pearson, G. Robins, D. E. Wrege, and T. Zhang. A new approach to primer selection problem in polymerase chain reaction experiments. In Third International Conference on Intelligent Systems for Molecular Biology, pp. 285-291. AAAI Press, Cambridge, United Kingdom, 1995.
-
(1995)
Third International Conference on Intelligent Systems for Molecular Biology
, pp. 285-291
-
-
Pearson, W.R.1
Robins, G.2
Wrege, D.E.3
Zhang, T.4
-
9
-
-
33947099368
-
Complexity properties of the primer selection problem for PCR experiments
-
The University of Tokyo, Tokyo, Japan pp
-
K. Doi and H. Imai. Complexity properties of the primer selection problem for PCR experiments. In Proceedings of the 5th Japan-Korea Joint Workshop on Algorithms and Computation, The University of Tokyo, Tokyo, Japan pp. 152-159, 2000.
-
(2000)
Proceedings of the 5th Japan-Korea Joint Workshop on Algorithms and Computation
, pp. 152-159
-
-
Doi, K.1
Imai, H.2
-
10
-
-
0028117341
-
A guide to the design and use of mismatched and degenerate primers
-
S. Kwok, S.Y. Chang, J.J. Sninsky, and A. Wang. A guide to the design and use of mismatched and degenerate primers. PCR Methods and Applications, 3:S39-S47, 1994.
-
(1994)
PCR Methods and Applications
, vol.3
-
-
Kwok, S.1
Chang, S.Y.2
Sninsky, J.J.3
Wang, A.4
-
11
-
-
0022422660
-
IUPAC-IUB symbols for nucleotide nomenclature
-
Cornish-Bowden. IUPAC-IUB symbols for nucleotide nomenclature. Nucleic Acids Research, 13:3021-3030, 1985.
-
(1985)
Nucleic Acids Research
, vol.13
, pp. 3021-3030
-
-
Cornish-Bowden1
-
12
-
-
1242311779
-
The degenerate primer design problem
-
C Linhart and R. Shamir. The degenerate primer design problem. Bioinformatics, 18(Suppl. 1):S172-S180, 2002.
-
(2002)
Bioinformatics
, vol.18
, Issue.SUPPL. 1
-
-
Linhart, C.1
Shamir, R.2
-
14
-
-
0342789972
-
Search, beam
-
S.C Shapiro, editor, Wiley-Interscience, New York, NY, 2nd edition
-
R. Bisiani. Search, beam. In S.C Shapiro, editor, Encyclopedia of Artificial Intelligence, pp. 1467-1468. Wiley-Interscience, New York, NY, 2nd edition, 1992.
-
(1992)
Encyclopedia of Artificial Intelligence
, pp. 1467-1468
-
-
Bisiani, R.1
-
15
-
-
0032826179
-
Identifying DNA and protein patterns with statistically significant alignments of multiple sequences
-
G.Z. Hertz and C.D. Stormo. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics, 15: 563-577, 1999.
-
(1999)
Bioinformatics
, vol.15
, pp. 563-577
-
-
Hertz, G.Z.1
Stormo, C.D.2
-
17
-
-
2042437650
-
Initial sequencing and analysis of the human genome
-
The Genome Sequencing Consortium
-
The Genome Sequencing Consortium. Initial sequencing and analysis of the human genome. Nature, 409:860-921, 2001.
-
(2001)
Nature
, vol.409
, pp. 860-921
-
-
-
19
-
-
0030479536
-
Origin of interspersed repeats in the human genome
-
A.F.A Smit. Origin of interspersed repeats in the human genome. Current Opinion in Genetics and Development, 6(6):743-749, 1996.
-
(1996)
Current Opinion in Genetics and Development
, vol.6
, Issue.6
, pp. 743-749
-
-
Smit, A.F.A.1
-
21
-
-
36549077239
-
-
Available at
-
A.F.A. Smit and P. Green. RepeatMasker. Available at http://ftp.genome. washington.edu/RM/RepeatMasker.html.
-
-
-
Smit, A.F.A.1
Green, P.2
-
22
-
-
0015600423
-
The Viterbi algortihm
-
G.D. Forney, Jr. The Viterbi algortihm. In Proceedings of IEEE, volume 61, pp. 268-278, 1973.
-
(1973)
Proceedings of IEEE
, vol.61
, pp. 268-278
-
-
Forney Jr., G.D.1
-
23
-
-
0023989064
-
Improved tools for biological sequence analysis
-
W.R. Pearson and D.J. Lipman. Improved tools for biological sequence analysis. In PNAS, volume 85, pages 2444-2448, 1988.
-
(1988)
PNAS
, vol.85
, pp. 2444-2448
-
-
Pearson, W.R.1
Lipman, D.J.2
-
24
-
-
0004137004
-
-
chapter 15, p, Press Syndicate of the University of Cambridge
-
D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, chapter 15, p. 377. Press Syndicate of the University of Cambridge, 1997.
-
(1997)
Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology
, pp. 377
-
-
Gusfield, D.1
|