The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A dynamic programming algorithm for haplotype block partitioning
Open accessAbstract
We develop a dynamic programming algorithm for haplotype block partitioning to minimize the number of representative single nucleotide polymorphisms (SNPs) required to account for most of the common haplotypes in each block. Any measure of haplotype quality can be used in the algorithm and of course the measure should depend on the specific application. The dynamic programming algorithm is applied to analyze the chromosome 21 haplotype data of Patil et al. [Patil, N., Berno, A. J., Hinds, D. A., Barrett, W. A., Doshi, J. M., Hacker, C. R., Kautzer, C. R., Lee, D. H., Marjoribanks, C., McDonough, D. P., et al. (2001) Science 294, 1719–1723], who searched for blocks of limited haplotype diversity. Using the same criteria as in Patil et al. , we identify a total of 3,582 representative SNPs and 2,575 blocks that are 21.5% and 37.7% smaller, respectively, than those identified using a greedy algorithm of Patil et al . We also apply the dynamic programming algorithm to the same data set based on haplotype diversity. A total of 3,982 representative SNPs and 1,884 blocks are identified to account for 95% of the haplotype diversity in each block.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum-likelihood estimation of molecular haplotype frequencies in a diploid population.
(1995) · Molecular Biology and Evolution · doi:10.1093/oxfordjournals.molbev.a040269 · Cited by 1,950
High-resolution haplotype structure in the human genome
Daly, M. J., Rioux, J. D., Schaffner, S. F., Hudson, T. J., & Lander, E. S. (2001) · Nature Genetics · doi:10.1038/ng1001-229 · Cited by 1,717
Blocks of Limited Haplotype Diversity Revealed by High-Resolution Scanning of Human Chromosome 21
Patil, N., Berno, A. J., Hinds, D. A., Barrett, W. A., Doshi, J. M., Hacker, C. R., Kautzer, C. R., Lee, D. H., Marjoribanks, C., McDonough, D. P., et al. (2001) · Science · doi:10.1126/science.1065573 · Cited by 1,145
Clark, A. G., Weiss, K. M., Nickerson, D. A., Taylor, S. L., Buchanan, A., Stengård, J., Salomaa, V., Vartiainen, E., Perola, M., Boerwinkle, E., et al. (1998) · The American Journal of Human Genetics · doi:10.1086/301977 · Cited by 435
Cited by
Genome-wide association studies for common diseases and complex traits
Hirschhorn, J. N., & Daly, M. J. (2005) · Nature Reviews Genetics · doi:10.1038/nrg1521 · Cited by 2,863
Carlson, C. S., Eberle, M. A., Rieder, M. J., Yi, Q., Kruglyak, L., & Nickerson, D. A. (2004) · The American Journal of Human Genetics · doi:10.1086/381000 · Cited by 1,589
Haplotype blocks and linkage disequilibrium in the human genome
Wall, J. D., & Pritchard, J. K. (2003) · Nature Reviews Genetics · doi:10.1038/nrg1123 · Cited by 642
Qin, Z. S., Niu, T., & Liu, J. S. (2002) · The American Journal of Human Genetics · doi:10.1086/344207 · Cited by 489
Chapman, J. M., Cooper, J. D., Todd, J. A., & Clayton, D. G. (2003) · Human Heredity · doi:10.1159/000073729 · Cited by 419
Metadata
- Authors
- Zhang, K., Deng, M., Chen, T., Waterman, M. S., & Sun, F.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2002-05-21
- Volume
- 99
- Issue
- 11
- Pages
- 7335-7339
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2156341632
- Cited by
- 336
- References
- 4
- FWCI
- 23.68
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A dynamic programming algorithm for haplotype block partitioning. https://app.cochat.ai/papers/10.1073/pnas.102186799
- The paper
- Zhang, K., Deng, M., Chen, T., Waterman, M. S., & Sun, F. (2002). A dynamic programming algorithm for haplotype block partitioning. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.102186799
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.