메뉴 건너뛰기




Volumn , Issue , 2009, Pages 150-161

Inferring genome-wide mosaic structure

Author keywords

[No Author keywords available]

Indexed keywords

BREAK-POINTS; GENETIC INFORMATION; GENETIC RECOMBINATIONS; GENETIC VARIANTS; GENOME SEQUENCES; HAPLOTYPES; MOSAIC STRUCTURE; RECOMBINATION EVENTS; SHORTEST PATH;

EID: 61949264264     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (16)
  • 1
    • 15344339638 scopus 로고    scopus 로고
    • Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
    • DOI 10.1016/j.jcss.2004.12.009, PII S0022000004001539, Bioinformatics
    • Gusfield, D. (2005) Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination, Journal of Computer and System Sciences, 70, 381-398. (Pubitemid 40391416)
    • (2005) Journal of Computer and System Sciences , vol.70 , Issue.3 , pp. 381-398
    • Gusfield, D.1
  • 2
    • 0022211482 scopus 로고
    • Statistical properties of the number of recombination events in the history of a sample of DNA sequences
    • Rudson, R., Kaplan, N. (1985) Statistical properties of the number of the recombination events in the history of a sample of DNA sequences, Genetics, 111, 147-164. (Pubitemid 16248827)
    • (1985) Genetics , vol.111 , Issue.1 , pp. 147-164
    • Hudson, R.R.1    Kaplan, N.L.2
  • 3
    • 0020560127 scopus 로고
    • Nucleotide polymorphism at the alcohol dehydrogenase locus of Drosophila melanogaster
    • Kreitman, M. (1983) Nucleotide polymorphism at the alcohol dehydrogenase locus of Drosophila melanogaster, Nature, 304, 412-417. (Pubitemid 13077938)
    • (1983) Nature , vol.304 , Issue.5925 , pp. 412-417
    • Kreitman, M.1
  • 5
    • 0037279717 scopus 로고    scopus 로고
    • Bounds on the minimum number of recombination events in a sample history
    • Myers S.R., Griffiths, R.C. (2003) Bounds on the minimum number of recombination events in a sample history, Genetics, 163, 375-394. (Pubitemid 36222680)
    • (2003) Genetics , vol.163 , Issue.1 , pp. 375-394
    • Myers, S.R.1    Griffiths, R.C.2
  • 7
    • 29144460130 scopus 로고    scopus 로고
    • Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution
    • DOI 10.1093/bioinformatics/bti1033
    • Song, Y.S., WU, Y, Gusfield, D. (2005) Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution, Bioinformatics, 21, i413-i422. (Pubitemid 41794515)
    • (2005) Bioinformatics , vol.21 , Issue.SUPPL. 1
    • Song, Y.S.1    Wu, Y.2    Gusfield, D.3
  • 8
    • 15944363058 scopus 로고    scopus 로고
    • Constructing minimal ancestral recombination graphs
    • DOI 10.1089/cmb.2005.12.147
    • Song, Y.S., Rein, J. (2005) Constructing minimal ancestral recombination graphs, J. Comput. Biol., 12(2), 147-169. (Pubitemid 40444585)
    • (2005) Journal of Computational Biology , vol.12 , Issue.2 , pp. 147-169
    • Song, Y.S.1    Hein, J.2
  • 11
    • 84957034204 scopus 로고    scopus 로고
    • Finding founder sequences from a set of recombinants
    • Ukkonen, E. (2002) Finding founder sequences from a set of recombinants, WABI 2002, 277-286.
    • (2002) WABI 2002 , pp. 277-277
    • Ukkonen, E.1
  • 12
    • 0034913468 scopus 로고    scopus 로고
    • Perfect phylogenetic networks with recombinaiton
    • Wang, L., Zhang, K., Zhang, L. (2001) Perfect phylogenetic networks with recombinaiton, J. Comput. Biol., 8, 69-78.
    • (2001) J. Comput. Biol. , vol.8 , pp. 69-78
    • Wang, L.1    Zhang, K.2    Zhang, L.3
  • 13
    • 37849030797 scopus 로고    scopus 로고
    • Improved algorithms for inferring the minimum mosaic of a set of recombinants
    • Wu, Y., Gusfield, D. (2007) Improved algorithms for inferring the minimum mosaic of a set of recombinants, CPM 2007, 150-161.
    • (2007) CPM 2007 , pp. 150-161
    • Wu, Y.1    Gusfield, D.2
  • 14
    • 0037188541 scopus 로고    scopus 로고
    • A Dynamic programming algorithm for haplotype block partitioning
    • Zhang, K., Deng, M., Chen, T., Waterman, M.S., Sun, F. (2003) A Dynamic programming algorithm for haplotype block partitioning, PNAS., 99, 7335-7339.
    • (2003) PNAS , vol.99 , pp. 7335-7339
    • Zhang, K.1    Deng, M.2    Chen, T.3    Waterman, M.S.4    Sun, F.5
  • 16
    • 84873031115 scopus 로고    scopus 로고
    • http://cgd.jax.org/ImputedSNPData/imputedSNPs.htm.


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