Some notes on the combinatorial properties of haplotype tagging

Mathematical Biosciences

Volumn 185, Issue 2, 2003, Pages 205-216

  Wiuf, Carsten ^a,d   Laidlaw, Zoë ^b,c   Stumpf, Michael P H ^c  

^a Variagenics Inc   (United States)

^b UNIVERSITY OF SHEFFIELD   (United Kingdom)

^c UNIVERSITY COLLEGE LONDON   (United Kingdom)

^d AARHUS UNIVERSITY   (Denmark)

Author keywords

Block recombination; Haplotype tagging; SNPs

Indexed keywords

BIOMARKERS; BOOLEAN ALGEBRA; COMBINATORIAL MATHEMATICS;

HAPLOTYPE TAGGING;

GENETIC ENGINEERING;

GENETIC MARKER;

ALLELE; ARTICLE; GENETIC MARKER; HAPLOTYPE; MATHEMATICAL ANALYSIS; MATHEMATICAL MODEL; SINGLE NUCLEOTIDE POLYMORPHISM; THEORY;

EID: 0042738025     PISSN: 00255564     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0025-5564(03)00089-0     Document Type: Article

References (16)

1. L. Kruglyak, Prospects for whole-genome disequilibrium mapping of common disease genes, Nat. Genet. 22 (1999) 139.
2. J.K. Pritchard, M. Przeworski, Linkage disequilibrium in humans: Models and data, Am. J. Hum. Genet. 69 (2001) 1.
3. A.J. Jeffreys, L. Kauppi, R. Neumann, Intensely punctate meiotic recombination in the class II region of the major histocompatibility complex, Nat. Genet. 29 (2001) 217.
4. M.J. Daly, J.D. Rioux, S.E. Schaffner, T.J. Hudson, E.S. Lander, High-resolution haplotype structure in the human genome, Nat. Genet. 29 (2001) 229.
5. N. Patil, A.J. Berno, W.A. Barrett, J.M. Doshi, C.P. Hacker, et al., Blocks of limited haplotype diversity revealed by high-resolution scanning of human chromosome 21, Science 294 (2001) 1719.
6. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, New York, 1979.
7. J.E. Whitesitt, Boolean Algebras and their Applications, Addison-Wesley, Reading, MA, 1995.
8. H.M. Sheffer, A set of five independent postulates for Boolean algebras with applications to logical constants, Trans. Am. Math. Soc. 14 (1913) 481.
9. G.C. Estabrook, C. Johnson, F. McMorris, An idealized concept of the true cladistic character, Math. Biosci. 23 (1975) 263.
10. S. Myers, Bounds on the minimum number of recombination events in a sample history, Genetics 163 (2003) 375.
11. G. Watterson, On the number of segregating sites in genetic models without recombination, Theor. Pop. Biol. 52 (1975) 43.
12. R.R. Hudson, N. Kaplan, Statistical properties of the number of recombination events in the history of a sample of DNA sequences, Genetics 111 (1985) 147.
13. C. Wiuf, On the minimum number of topologies explaining a sample of DNA sequences, Theor. Pop. Biol. 62 (2002) 357.
14. D. Gusfield, Efficient algorithms for inferring evolutionary trees, Networks 21 (1991) 19.
15. J.H. van Lint, R.M. Wilson, A Course in Combinatorics, Cambridge University, Cambridge, 1992.
16. G.C.L. Johnson, L. Esposito, B.J. Barratt, A.N. Smith, J. Heward et al., Haplotype tagging for the identification of common disease genes, Nat. Genet. 29 (2001) 233.