메뉴 건너뛰기




Volumn 5757 LNCS, Issue , 2009, Pages 325-336

An efficient algorithm for haplotype inference on pedigrees with a small number of recombinants (Extended Abstract)

Author keywords

Combinatorial algorithm; Computational biology; Haplotype inference; Pedigree; Probabilistic model; Recombination

Indexed keywords

COMBINATORIAL ALGORITHM; COMPUTATIONAL BIOLOGY; HAPLOTYPE INFERENCE; PEDIGREE; PROBABILISTIC MODEL; RECOMBINATION;

EID: 70350413296     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_30     Document Type: Conference Paper
Times cited : (3)

References (31)
  • 1
    • 0036338150 scopus 로고    scopus 로고
    • Abecasis, G.R., et al.: Nat Genet, 30(1), 97-101 (2002)
    • (2002) Nat Genet , vol.30 , Issue.1 , pp. 97-101
    • Abecasis, G.R.1
  • 2
    • 35548937764 scopus 로고    scopus 로고
    • Albers, C.A., et al.: Genetics 177, 1101-1116 (2007)
    • (2007) Genetics , vol.177 , pp. 1101-1116
    • Albers, C.A.1
  • 4
    • 33645231846 scopus 로고    scopus 로고
    • Baruch, E., et al.: Genetics 172, 1757-1765 (2006)
    • (2006) Genetics , vol.172 , pp. 1757-1765
    • Baruch, E.1
  • 6
    • 70350367953 scopus 로고    scopus 로고
    • Atlanta, GA, pp
    • Chin, F., et al.: Proc. 5th ICCS, Atlanta, GA, pp. 985-993 (2005)
    • (2005) Proc. 5th ICCS , pp. 985-993
    • Chin, F.1
  • 7
    • 35248841124 scopus 로고    scopus 로고
    • Doi, K., et al.:Minimum recombinant haplotype configuration on tree pedigrees. In: Benson, G., Page, R.D.M., et al. (eds.)WABI 2003. LNCS (LNBI), 2812, pp. 339-353. Springer,Heidelberg (2003)
    • Doi, K., et al.:Minimum recombinant haplotype configuration on tree pedigrees. In: Benson, G., Page, R.D.M., et al. (eds.)WABI 2003. LNCS (LNBI), vol. 2812, pp. 339-353. Springer,Heidelberg (2003)
  • 10
    • 18444369013 scopus 로고    scopus 로고
    • Gabriel, S.B., et al.: Science 296(5576), 2225-2229
    • Science , vol.296 , Issue.5576 , pp. 2225-2229
    • Gabriel, S.B.1
  • 13
    • 70350389800 scopus 로고    scopus 로고
    • May 2008
    • Haplotype Conference (May 2008),http://www.soph.uab.edu/ssg/nhgri/ haplotype2008
    • Haplotype Conference
  • 19
    • 44049100764 scopus 로고    scopus 로고
    • Li, J., Jiang, T.: J. Bioinformatics and Computational Biology 6(1), 241-259 (2008)
    • Li, J., Jiang, T.: J. Bioinformatics and Computational Biology 6(1), 241-259 (2008)
  • 21
    • 33744948186 scopus 로고    scopus 로고
    • Liu, L., et al.: Complexity and approximation of the minimum recombination haplotype configuration problem. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, 3827, pp. 370-379. Springer, Heidelberg (2005)
    • Liu, L., et al.: Complexity and approximation of the minimum recombination haplotype configuration problem. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 370-379. Springer, Heidelberg (2005)
  • 22
    • 70350399603 scopus 로고    scopus 로고
    • Singapore December
    • Liu, L., Jiang, T.: Proc. 18th GIW, pp. 95-106, Singapore (December 2007)
    • (2007) Proc. 18th GIW , pp. 95-106
    • Liu, L.1    Jiang, T.2
  • 26
    • 70350362930 scopus 로고    scopus 로고
    • Sobel, E., et al.: In: Speed, T., Waterman, M. (eds.) Genetic Mapping and DNA Sequencing,IMA in Math. and its App., 81, pp. 89-110 (1996)
    • Sobel, E., et al.: In: Speed, T., Waterman, M. (eds.) Genetic Mapping and DNA Sequencing,IMA Vol in Math. and its App., vol. 81, pp. 89-110 (1996)
  • 27
    • 79959503826 scopus 로고    scopus 로고
    • The International HapMap Consortium
    • The International HapMap Consortium. Nature 426, 789-796 (2003)
    • (2003) Nature , vol.426 , pp. 789-796


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