메뉴 건너뛰기




Volumn 4453 LNBI, Issue , 2007, Pages 488-502

Association mapping of complex diseases with ancestral recombination graphs: Models and efficient algorithms

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; DISEASES; GRAPH THEORY; MOLECULAR BIOLOGY;

EID: 34547463036     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-71681-5_34     Document Type: Conference Paper
Times cited : (6)

References (35)
  • 1
    • 10944231221 scopus 로고    scopus 로고
    • The number of recombination events in a sample history: Conflict graph and lower bounds
    • V. Bafna and V. Bansal: The number of recombination events in a sample history: conflict graph and lower bounds. IEEE/ACM Trans, on Computational Biology and Bioinformatics, v.1, 78-90, 2004.
    • (2004) IEEE/ACM Trans, on Computational Biology and Bioinformatics , vol.1 , pp. 78-90
    • Bafna, V.1    Bansal, V.2
  • 2
    • 33645987285 scopus 로고    scopus 로고
    • Inference about Recombination from Haplotype Data: Lower Bounds and Recombination Hotspots
    • V. Bafna and V. Bansal, Inference about Recombination from Haplotype Data: Lower Bounds and Recombination Hotspots. J. of Comp. Bio., v.13, p.501-521, 2006.
    • (2006) J. of Comp. Bio , vol.13 , pp. 501-521
    • Bafna, V.1    Bansal, V.2
  • 3
    • 13844266486 scopus 로고    scopus 로고
    • On the computational complexity of the rooted subtree prune and regraft distance
    • M. Bordewich and C. Semple: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics, v.8, p.409-423, 2004.
    • (2004) Annals of Combinatorics , vol.8 , pp. 409-423
    • Bordewich, M.1    Semple, C.2
  • 4
    • 34547436220 scopus 로고    scopus 로고
    • Private communications
    • D. Brown: Private communications.
    • Brown, D.1
  • 5
    • 0038392950 scopus 로고    scopus 로고
    • Finding genes underlying risk of complex disease by linkage disequilibrium mapping
    • A. G. Clark: Finding genes underlying risk of complex disease by linkage disequilibrium mapping. Current Opinion in Genetics and Development, 13, p296-302, 2003.
    • (2003) Current Opinion in Genetics and Development , vol.13 , pp. 296-302
    • Clark, A.G.1
  • 6
    • 0019797407 scopus 로고
    • Evolutionary trees from DNA sequences: A maximum likelihood approach
    • J. Felsenstein, Evolutionary trees from DNA sequences: a maximum likelihood approach, J. Mol. Evol., v.17, p.368-376, 1981.
    • (1981) J. Mol. Evol , vol.17 , pp. 368-376
    • Felsenstein, J.1
  • 7
    • 0030498194 scopus 로고    scopus 로고
    • R. C Griffiths and P. Marjoram: Ancestral inference from samples of DNA sequences with recombination. J. of Comp. Bio., v.3, p479-502, 1996.
    • R. C Griffiths and P. Marjoram: Ancestral inference from samples of DNA sequences with recombination. J. of Comp. Bio., v.3, p479-502, 1996.
  • 8
    • 15344339638 scopus 로고    scopus 로고
    • Optimal, efficient reconstruction of Root-Unknown phylogenetic networks with constrained and structured recombination
    • D. Gusfield: Optimal, efficient reconstruction of Root-Unknown phylogenetic networks with constrained and structured recombination. JCSS, 70, 381-398, 2005.
    • (2005) JCSS , vol.70 , pp. 381-398
    • Gusfield, D.1
  • 9
    • 3242876395 scopus 로고    scopus 로고
    • Optimal, efficient reconstruction of phylogenetic networks with constrained recombination
    • D. Gusfield, S. Eddhu and C. Langley: Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J. Bioinformatics and Computational Biology, v. 2, 173-213, 2004.
    • (2004) J. Bioinformatics and Computational Biology , vol.2 , pp. 173-213
    • Gusfield, D.1    Eddhu, S.2    Langley, C.3
  • 10
    • 10044254311 scopus 로고    scopus 로고
    • The fine structure of galls in phylogenetic networks
    • D. Gusfield, S. Eddhu and C. Langley: The fine structure of galls in phylogenetic networks. INFORMS J. on Computing, v. 16, p.459-469, 2004.
    • (2004) INFORMS J. on Computing , vol.16 , pp. 459-469
    • Gusfield, D.1    Eddhu, S.2    Langley, C.3
  • 11
    • 0025299784 scopus 로고
    • Reconstructing evolution of sequences subject to recombination using parsimony
    • J. Hein: Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci, v. 98, p.185-200, 1990.
    • (1990) Math. Biosci , vol.98 , pp. 185-200
    • Hein, J.1
  • 12
    • 0027471670 scopus 로고
    • A heuristic method to reconstruct the history of sequences subject to recombination
    • J. Hein, A heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol., v.36, p.396-405, 1993.
    • (1993) J. Mol. Evol , vol.36 , pp. 396-405
    • Hein, J.1
  • 15
    • 0022211482 scopus 로고
    • Statistical properties of the number of recombination events in the history of a sample of DNA sequences
    • R. Hudson and N. Kaplan: Statistical properties of the number of recombination events in the history of a sample of DNA sequences. Genetics, v.111, p.147-164, 1985.
    • (1985) Genetics , vol.111 , pp. 147-164
    • Hudson, R.1    Kaplan, N.2
  • 16
    • 79959503826 scopus 로고    scopus 로고
    • The HapMap project
    • International HapMap Consortium
    • International HapMap Consortium: The HapMap project, Nature, 426, p789-796, 2003.
    • (2003) Nature , vol.426 , pp. 789-796
  • 17
    • 79959524146 scopus 로고    scopus 로고
    • A haplotype map of the human genome
    • International HapMap Consortium
    • International HapMap Consortium: A haplotype map of the human genome. Nature, 437, p1299-1320, 2005.
    • (2005) Nature , vol.437 , pp. 1299-1320
  • 19
    • 0036725038 scopus 로고    scopus 로고
    • Gene mapping via Ancestral Recombination Graph
    • F. Larribe, S. Lessard and N. J. Schork: Gene mapping via Ancestral Recombination Graph. Theor. Popul. Biol., v. 62, p. 215-229, 2002.
    • (2002) Theor. Popul. Biol , vol.62 , pp. 215-229
    • Larribe, F.1    Lessard, S.2    Schork, N.J.3
  • 20
    • 0347361674 scopus 로고    scopus 로고
    • Modeling Linkage Disequilibrium, and identifying recombination hotspots using SNP data
    • N. Li and M. Stephens: Modeling Linkage Disequilibrium, and identifying recombination hotspots using SNP data. Genetics, 165, p2213-2233, 2003.
    • (2003) Genetics , vol.165 , pp. 2213-2233
    • Li, N.1    Stephens, M.2
  • 22
    • 0033358667 scopus 로고    scopus 로고
    • Assessment of linkage disequilibrium by the decay of haplotype sharing, with application to fine-scale genetic mapping
    • M. S. McPeek and A. Strahs: Assessment of linkage disequilibrium by the decay of haplotype sharing, with application to fine-scale genetic mapping. Am. J. Hum. Genet., 65, p858-875, 1999.
    • (1999) Am. J. Hum. Genet , vol.65 , pp. 858-875
    • McPeek, M.S.1    Strahs, A.2
  • 23
    • 33751112507 scopus 로고    scopus 로고
    • Mapping trait loci using inferred ancestral recombination graphs
    • M. Minichiello and R. Durbin; Mapping trait loci using inferred ancestral recombination graphs. Am. J. Hum. Genet., v.79, p.910-922, 2006.
    • (2006) Am. J. Hum. Genet , vol.79 , pp. 910-922
    • Minichiello, M.1    Durbin, R.2
  • 24
    • 0036177752 scopus 로고    scopus 로고
    • Fine-scale mapping of disease loci via shattered coalescent modeling of genealogies
    • A. P. Morris, J. C Whittaker and D. J. Balding: Fine-scale mapping of disease loci via shattered coalescent modeling of genealogies. Am. J. Hum. Genet, 70, P686-707, 2002.
    • (2002) Am. J. Hum. Genet , vol.70
    • Morris, A.P.1    Whittaker, J.C.2    Balding, D.J.3
  • 25
    • 0037279717 scopus 로고    scopus 로고
    • Bounds on the minimum number of recombination events in a sample history
    • S. R. Myers and R. C. Griffiths: Bounds on the minimum number of recombination events in a sample history. Genetics, v. 163, p.375-394, 2003.
    • (2003) Genetics , vol.163 , pp. 375-394
    • Myers, S.R.1    Griffiths, R.C.2
  • 26
    • 0036468808 scopus 로고    scopus 로고
    • Linkage disequilibrium: What history has to tell us
    • M. Norborg and S. Tavare: Linkage disequilibrium: what history has to tell us. Trends in Genetics, 18, 83-90, 2002.
    • (2002) Trends in Genetics , vol.18 , pp. 83-90
    • Norborg, M.1    Tavare, S.2
  • 27
    • 0034973984 scopus 로고    scopus 로고
    • High-resolution multipoint linkage-disequilibrium mapping in the context of a human genome sequence
    • B. Rannala and J. P. Reeve: High-resolution multipoint linkage-disequilibrium mapping in the context of a human genome sequence. Am. J. Hum. Genet., 69, p 159-178, 2001.
    • (2001) Am. J. Hum. Genet , vol.69 , pp. 159-178
    • Rannala, B.1    Reeve, J.P.2
  • 28
    • 0029741063 scopus 로고    scopus 로고
    • The Future of Genetic Studies of Complex Human Diseases
    • N. Risch and K. Merikangas: The Future of Genetic Studies of Complex Human Diseases. Science, 275, p1516-1517, 1996.
    • (1996) Science , vol.275 , pp. 1516-1517
    • Risch, N.1    Merikangas, K.2
  • 29
    • 2442543323 scopus 로고    scopus 로고
    • Parsimonious reconstruction of sequence evolution and haplotype blocks: Finding the minimum number of recombination events
    • Y. Song and J. Hein: Parsimonious reconstruction of sequence evolution and haplotype blocks: Finding the minimum number of recombination events. Proc. of 2003 Workshop on Algorithms in Bioinformatics (WABI), 2003.
    • (2003) Proc. of 2003 Workshop on Algorithms in Bioinformatics (WABI)
    • Song, Y.1    Hein, J.2
  • 30
    • 16544370982 scopus 로고    scopus 로고
    • On the Minimum Number of Recombination Events in the Evolutionary History of DNA Sequences
    • Y. Song and J. Hein: On the Minimum Number of Recombination Events in the Evolutionary History of DNA Sequences. J. of Math. Biology, v.48, p. 160-186, 2003.
    • (2003) J. of Math. Biology , vol.48 , pp. 160-186
    • Song, Y.1    Hein, J.2
  • 31
    • 29144460130 scopus 로고    scopus 로고
    • Y. S. Song, Y. Wu and D. Gusfield: Efficient computation of close lower and upper bounds on the minimum number of needed recombinations in the evolution of biological sequences. Bioinformatics, v. 421, p.i413-i422, Proceedings of ISMB 2005.
    • Y. S. Song, Y. Wu and D. Gusfield: Efficient computation of close lower and upper bounds on the minimum number of needed recombinations in the evolution of biological sequences. Bioinformatics, v. 421, p.i413-i422, Proceedings of ISMB 2005.
  • 32
    • 0035071957 scopus 로고    scopus 로고
    • A new statistical method for haplotype reconstruction from population data
    • M. Stephens, N. Smith and P. Donnelly: A new statistical method for haplotype reconstruction from population data. Am. J. Hum. Genet., v. 68, p.978-989, 2001.
    • (2001) Am. J. Hum. Genet , vol.68 , pp. 978-989
    • Stephens, M.1    Smith, N.2    Donnelly, P.3
  • 33
    • 0023425198 scopus 로고
    • A cladistic analysis of phenotypic associations with haplotypes inferred from restriction endonuclease mapping. I. Basic theory and an analysis of alcohol dehydrogenase activity in Drosophila
    • A. R. Templeton, E. Boerwinkle and C F. Sing: A cladistic analysis of phenotypic associations with haplotypes inferred from restriction endonuclease mapping. I. Basic theory and an analysis of alcohol dehydrogenase activity in Drosophila. Genetics, 117, p343-351, 1987.
    • (1987) Genetics , vol.117 , pp. 343-351
    • Templeton, A.R.1    Boerwinkle, E.2    Sing, C.F.3
  • 34
    • 0034913468 scopus 로고    scopus 로고
    • Perfect Phylogenetic Networks with Recombination
    • L. Wang, K. Zhang and L. Zhang: Perfect Phylogenetic Networks with Recombination. J. of Comp. Bio., v.8, p.69-78, 2001.
    • (2001) J. of Comp. Bio , vol.8 , pp. 69-78
    • Wang, L.1    Zhang, K.2    Zhang, L.3
  • 35
    • 15544365509 scopus 로고    scopus 로고
    • Coalescent-Based Association Mapping and Fine Mapping of Complex Trait Loci
    • S. Zollner and J.K. Pritchard: Coalescent-Based Association Mapping and Fine Mapping of Complex Trait Loci, Genetics, 169, p. 1071-1092, 2005.
    • (2005) Genetics , vol.169 , pp. 1071-1092
    • Zollner, S.1    Pritchard, J.K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.