메뉴 건너뛰기




Volumn 160, Issue 9, 2012, Pages 1299-1310

New results for the Longest Haplotype Reconstruction problem

Author keywords

Approximation complexity; Computational biology; Fixed parameter algorithms; Haplotyping

Indexed keywords

APPROXIMATION COMPLEXITY; COMPUTATIONAL BIOLOGY; FIXED-PARAMETER ALGORITHMS; HAPLOTYPES; HAPLOTYPING; INPUT MATRICES; NEW RESULTS; NP-HARD; RECONSTRUCTION PROBLEMS;

EID: 84858449947     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2011.10.014     Document Type: Article
Times cited : (2)

References (15)
  • 1
    • 0001657065 scopus 로고    scopus 로고
    • Some APX-completeness results for cubic graphs
    • P. Alimonti, and V. Kann Some APX-completeness results for cubic graphs Theoretical Computer Science 237 12 2000 123 134
    • (2000) Theoretical Computer Science , vol.237 , Issue.12 , pp. 123-134
    • Alimonti, P.1    Kann, V.2
  • 3
    • 0032058198 scopus 로고    scopus 로고
    • Proof Verification and the Hardness of Approximation Problems
    • S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy Proof verification and the hardness of approximation problems Journal of the ACM 45 3 1998 501 555 (Pubitemid 128506634)
    • (1998) Journal of the ACM , vol.45 , Issue.3 , pp. 501-555
    • Arora, S.1    Lund, C.2    Motwani, R.3    Sudan, M.4    Szegedy, M.5
  • 6
    • 84858446853 scopus 로고    scopus 로고
    • New aspects of haplotype inference from SNP fragments
    • G.P.C. Fung, iConcept Press Annerley
    • H. Chen, Z. Zhao, K. Zhang, and D. Zhu New aspects of haplotype inference from SNP fragments G.P.C. Fung, A Practical Guide to Bioinformatics Analysis 2010 iConcept Press Annerley 173 183
    • (2010) A Practical Guide to Bioinformatics Analysis , pp. 173-183
    • Chen, H.1    Zhao, Z.2    Zhang, K.3    Zhu, D.4
  • 7
    • 36549019057 scopus 로고    scopus 로고
    • The complexity of the single individual SNP haplotyping problem
    • DOI 10.1007/s00453-007-0029-z
    • R. Cilibrasi, L. van Iersel, S. Kelk, and J. Tromp The complexity of the single individual SNP haplotyping problem Algorithmica 49 1 2007 13 36 (Pubitemid 350177762)
    • (2007) Algorithmica (New York) , vol.49 , Issue.1 , pp. 13-36
    • Cilibrasi, R.1    Van Iersel, L.2    Kelk, S.3    Tromp, J.4
  • 9
    • 4544326903 scopus 로고    scopus 로고
    • Opportunities for combinatorial optimization in computational biology
    • DOI 10.1287/ijoc.1040.0073
    • H.J. Greenberg, W.E. Hart, and G. Lancia Opportunities for combinatorial optimization in computational biology INFORMS Journal on Computing 16 3 2004 211 231 (Pubitemid 39253165)
    • (2004) INFORMS Journal on Computing , vol.16 , Issue.3 , pp. 211-231
    • Greenberg, H.J.1    Hart, W.E.2    Lancia, G.3
  • 10
    • 0002291589 scopus 로고    scopus 로고
    • On the complexity of comparing evolutionary trees
    • PII S0166218X96000625
    • J. Hein, T. Jiang, L. Wang, and K. Zhang On the complexity of comparing evolutionary trees Discrete Applied Mathematics 71 1996 153 169 (Pubitemid 126391777)
    • (1996) Discrete Applied Mathematics , vol.71 , Issue.1-3 , pp. 153-169
    • Hein, J.1    Jiang, T.2    Wang, L.3    Zhang, K.4
  • 11
    • 0029497647 scopus 로고
    • On the approximation of shortest common supersequences and longest common subsequences
    • T. Jiang, and M. Li On the approximation of shortest common supersequences and longest common subsequences SIAM Journal on Computing 24 1995 1122 1139
    • (1995) SIAM Journal on Computing , vol.24 , pp. 1122-1139
    • Jiang, T.1    Li, M.2
  • 13
    • 84943255398 scopus 로고    scopus 로고
    • SNPs problems, complexity and algorithms
    • F. Meyer auf der Heide, LNCS Springer Heidelberg
    • G. Lancia, V. Bafna, S. Istrail, R. Lippert, and R. Schwartz SNPs problems, complexity and algorithms F. Meyer auf der Heide, ESA 2001 LNCS vol. 2161 2001 Springer Heidelberg 182 193
    • (2001) ESA 2001 , vol.2161 , pp. 182-193
    • Lancia, G.1    Bafna, V.2    Istrail, S.3    Lippert, R.4    Schwartz, R.5


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