메뉴 건너뛰기




Volumn 29, Issue 4, 2005, Pages 281-287

Haplotype assembly from aligned weighted SNP fragments

Author keywords

Assembly; Dynamic clustering; Haplotype; Minimum letter flips; SNP

Indexed keywords

ALGORITHMS; ASSEMBLY; COMPUTATIONAL METHODS; ERROR ANALYSIS; GENES; HALOGEN COMPOUNDS; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

EID: 23144447217     PISSN: 14769271     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compbiolchem.2005.05.001     Document Type: Article
Times cited : (48)

References (13)
  • 1
    • 0031834225 scopus 로고    scopus 로고
    • It's raining, hallelujah?
    • A. Chakravarti It's raining, hallelujah? Nat. Genet. 19 1998 216 217
    • (1998) Nat. Genet. , vol.19 , pp. 216-217
    • Chakravarti, A.1
  • 2
    • 0025269067 scopus 로고
    • Inference of haplotypes from PCR-amplified samples of diploid populations
    • A.G. Clark Inference of haplotypes from PCR-amplified samples of diploid populations Mol. Biol. Evol. 7 2 1990 111 122
    • (1990) Mol. Biol. Evol. , vol.7 , Issue.2 , pp. 111-122
    • Clark, A.G.1
  • 4
    • 0029653518 scopus 로고
    • Whole-genome random sequencing and assembly of haemophilus influenzae Rd
    • R.D. Fleischmann, M.D. Adams, and O. White Whole-genome random sequencing and assembly of haemophilus influenzae Rd Science 269 5223 1995 496 512
    • (1995) Science , vol.269 , Issue.5223 , pp. 496-512
    • Fleischmann, R.D.1    Adams, M.D.2    White, O.3
  • 6
    • 4544326903 scopus 로고    scopus 로고
    • Opportunities for combinatorial optimization in computational biology
    • Greenberg, H.J., Hart, W.E., Lancia, G., 2003. Opportunities for combinatorial optimization in computational biology. INFORMS J. Comput. 2004, 14, 211-213.
    • (2003) INFORMS J. Comput. , vol.14 , pp. 211-213
    • Greenberg, H.J.1    Hart, W.E.2    Lancia, G.3
  • 7
    • 0034812677 scopus 로고    scopus 로고
    • Inference of haplotypes from samples of diploid populations: Complexity and algorithms
    • D. Gusfield Inference of haplotypes from samples of diploid populations: complexity and algorithms J. Comput. Biol. 8 3 2001 305 323
    • (2001) J. Comput. Biol. , vol.8 , Issue.3 , pp. 305-323
    • Gusfield, D.1
  • 8
    • 0035958749 scopus 로고    scopus 로고
    • Genome research: Map of human genome 3.0
    • L. Helmuth Genome research: map of human genome 3.0 Science 5530 293 2001 583 585
    • (2001) Science , vol.5530 , Issue.293 , pp. 583-585
    • Helmuth, L.1
  • 9
    • 0036514657 scopus 로고    scopus 로고
    • Algorithmic strategies for the SNPs haplotype assembly problem
    • R. Lippert, R. Schwartza, G. Lancia, and S. Istrail Algorithmic strategies for the SNPs haplotype assembly problem Brief. Bioinform. 3 1 2002 23 31
    • (2002) Brief. Bioinform. , vol.3 , Issue.1 , pp. 23-31
    • Lippert, R.1    Schwartza, R.2    Lancia, G.3    Istrail, S.4
  • 11
    • 0034727107 scopus 로고    scopus 로고
    • An SNP map of the human genome generated by reduced representation shotgun sequencing
    • D.A.V.J. Pollarn, and C.R. Cowles An SNP map of the human genome generated by reduced representation shotgun sequencing Nature 407 2000 513 519
    • (2000) Nature , vol.407 , pp. 513-519
    • Pollarn, D.A.V.J.1    Cowles, C.R.2
  • 12
    • 84957010924 scopus 로고    scopus 로고
    • Practical algorithms and fixed-parameter tractability for the single individual SNP haplotyping problem
    • Guigo, R., Gusfield, D. (Eds.), Proceedings of the Second Annual Workshop on Algorithms in Bioinformatics (WABI) Springer
    • Rizzi, R., Bafna, V., Istrail, S., Lancia, G., 2002. Practical algorithms and fixed-parameter tractability for the single individual SNP haplotyping problem. In: Guigo, R., Gusfield, D. (Eds.), Proceedings of the Second Annual Workshop on Algorithms in Bioinformatics (WABI), vol. 2452 of Lecture Notes in Computer Science. Springer, pp. 29-43.
    • (2002) Lecture Notes in Computer Science , vol.2452 , pp. 29-43
    • Rizzi, R.1    Bafna, V.2    Istrail, S.3    Lancia, G.4


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