메뉴 건너뛰기




Volumn 5092 LNCS, Issue , 2008, Pages 287-298

Haplotype inferring via galled-tree networks is NP-complete

Author keywords

[No Author keywords available]

Indexed keywords

NUCLEAR PROPULSION;

EID: 48249097447     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69733-6_29     Document Type: Conference Paper
Times cited : (4)

References (25)
  • 1
    • 13844266486 scopus 로고    scopus 로고
    • On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance
    • Bordewich, M., Semple, C.: On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance. Annals of Combinatorics 8, 409-423 (2004)
    • (2004) Annals of Combinatorics , vol.8 , pp. 409-423
    • Bordewich, M.1    Semple, C.2
  • 2
    • 0025269067 scopus 로고
    • Inference of Haplotypes from PCR-Amplified Samples of Dipoid Populations
    • Clark, A.: Inference of Haplotypes from PCR-Amplified Samples of Dipoid Populations. Molecular Biology and Evolution 7, 111-122 (1990)
    • (1990) Molecular Biology and Evolution , vol.7 , pp. 111-122
    • Clark, A.1
  • 3
    • 79959524146 scopus 로고    scopus 로고
    • A Haplotype Map of the Human Genome
    • The International HapMap Consortium
    • The International HapMap Consortium. A Haplotype Map of the Human Genome. Nature 437, 1299-1320 (2005)
    • (2005) Nature , vol.437 , pp. 1299-1320
  • 4
    • 0034791035 scopus 로고    scopus 로고
    • High-Resolution Haplotype Structure in the Human Genome
    • Daly, M., Rioux, J., Schaffner, S., Hudson, T., Lander, E.: High-Resolution Haplotype Structure in the Human Genome. Nature Genetics 29(2), 229-232 (2001)
    • (2001) Nature Genetics , vol.29 , Issue.2 , pp. 229-232
    • Daly, M.1    Rioux, J.2    Schaffner, S.3    Hudson, T.4    Lander, E.5
  • 6
    • 48249147919 scopus 로고    scopus 로고
    • Haplotype Inferring via Galled-Tree Networks Using a Hypergraph Covering Problem for Special Genotype Matrices
    • to appear
    • Gupta, A., Manuch, J., Stacho, L., Zhao, X.: Haplotype Inferring via Galled-Tree Networks Using a Hypergraph Covering Problem for Special Genotype Matrices. Discr. Appl. Math. (to appear)
    • Discr. Appl. Math
    • Gupta, A.1    Manuch, J.2    Stacho, L.3    Zhao, X.4
  • 7
    • 33846524472 scopus 로고    scopus 로고
    • Characterization of the Existence of Galled-Tree Networks
    • Gupta, A., Manuch, J., Stacho, L., Zhao, X.: Characterization of the Existence of Galled-Tree Networks. J. of Bioinform. and Comp. Biol. 4(6), 1309-1328 (2006)
    • (2006) J. of Bioinform. and Comp. Biol , vol.4 , Issue.6 , pp. 1309-1328
    • Gupta, A.1    Manuch, J.2    Stacho, L.3    Zhao, X.4
  • 8
    • 34547442890 scopus 로고    scopus 로고
    • Gupta, A., Manuch, J., Stacho, L., Zhao, X.: Algorithm for Haplotype Inferring via Galled-Tree Networks with Simple Galls (extended abstract). In: Istrail, S., Pevzner, P., Waterman, M. (eds.) ISBRA 2007. LNCS (LNBI), 4463, pp. 121-132. Springer, Heidelberg (2007)
    • Gupta, A., Manuch, J., Stacho, L., Zhao, X.: Algorithm for Haplotype Inferring via Galled-Tree Networks with Simple Galls (extended abstract). In: Istrail, S., Pevzner, P., Waterman, M. (eds.) ISBRA 2007. LNCS (LNBI), vol. 4463, pp. 121-132. Springer, Heidelberg (2007)
  • 9
    • 0034812677 scopus 로고    scopus 로고
    • Inference of Haplotypes from Samples of Diploid Populations: Complexity and Algorithms
    • Gusfield, D.: Inference of Haplotypes from Samples of Diploid Populations: Complexity and Algorithms. J. Comp. Biology 8(3), 305-323 (2001)
    • (2001) J. Comp. Biology , vol.8 , Issue.3 , pp. 305-323
    • Gusfield, D.1
  • 11
    • 33644509032 scopus 로고    scopus 로고
    • Gusfield, D.: Haplotype Inference by Pure Parsimony. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, 2676, pp. 144-155. Springer, Heidelberg (2003)
    • Gusfield, D.: Haplotype Inference by Pure Parsimony. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 144-155. Springer, Heidelberg (2003)
  • 12
    • 15344339638 scopus 로고    scopus 로고
    • Optimal, Efficient Reconstruction of Root-Unknown Phylogenetic Networks with Constrained and Structured Recombination
    • Gusfield, D.: Optimal, Efficient Reconstruction of Root-Unknown Phylogenetic Networks with Constrained and Structured Recombination. J. Comput. Syst. Sci. 70(3), 381-398 (2005)
    • (2005) J. Comput. Syst. Sci , vol.70 , Issue.3 , pp. 381-398
    • Gusfield, D.1
  • 13
    • 10044254311 scopus 로고    scopus 로고
    • The Fine Structure of Galls in Phylogenetic Networks
    • Gusfield, D., Eddhu, S., Langley, C.: The Fine Structure of Galls in Phylogenetic Networks. INFORMS Journal on Computing 16(4), 459-469 (2004)
    • (2004) INFORMS Journal on Computing , vol.16 , Issue.4 , pp. 459-469
    • Gusfield, D.1    Eddhu, S.2    Langley, C.3
  • 14
    • 3242876395 scopus 로고    scopus 로고
    • Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination
    • Gusfield, D., Eddhu, S., Langley, C.: Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. Journal of Bioinformatics and Computational Biology 2(1), 173-213 (2004)
    • (2004) Journal of Bioinformatics and Computational Biology , vol.2 , Issue.1 , pp. 173-213
    • Gusfield, D.1    Eddhu, S.2    Langley, C.3
  • 15
    • 48249134829 scopus 로고    scopus 로고
    • Gusfield, D., Orzack, S.H.: Handbook of Computational Molecular Biology, Chapter Haplotype Inference. CRC Computer and Information Science Series, p. 18C1C18C28. Chapman & Hall, Boca Raton (2005)
    • Gusfield, D., Orzack, S.H.: Handbook of Computational Molecular Biology, Chapter Haplotype Inference. CRC Computer and Information Science Series, p. 18C1C18C28. Chapman & Hall, Boca Raton (2005)
  • 16
    • 0035958749 scopus 로고    scopus 로고
    • Genome Research: Map of the Human Genome 3.0
    • Helmuth, L.: Genome Research: Map of the Human Genome 3.0. Science 293(5530), 583-585 (2001)
    • (2001) Science , vol.293 , Issue.5530 , pp. 583-585
    • Helmuth, L.1
  • 17
    • 1242341361 scopus 로고    scopus 로고
    • Haplotyping Populations: Complexity and Aproximations
    • University of Trento
    • Lancia, G., Pinotti, C., Rizzi, R.: Haplotyping Populations: Complexity and Aproximations. Dit-02-082, University of Trento (2002)
    • (2002) Dit-02-082
    • Lancia, G.1    Pinotti, C.2    Rizzi, R.3
  • 21
    • 37549066390 scopus 로고    scopus 로고
    • BREAKTHROUGH OF THE YEAR: Human Genetic Variation
    • Pennisi, E.: BREAKTHROUGH OF THE YEAR: Human Genetic Variation. Science 318(5858), 1842-1843 (2007)
    • (2007) Science , vol.318 , Issue.5858 , pp. 1842-1843
    • Pennisi, E.1
  • 22
    • 33646723920 scopus 로고    scopus 로고
    • A Concise Necessary and Sufficient Condition for the Existence of a Galled-Tree
    • Song, Y.S.: A Concise Necessary and Sufficient Condition for the Existence of a Galled-Tree. IEEE/ACM Transaction on Computational Biology and Bioinformatics 3(2), 186-191 (2006)
    • (2006) IEEE/ACM Transaction on Computational Biology and Bioinformatics , vol.3 , Issue.2 , pp. 186-191
    • Song, Y.S.1
  • 23
    • 33646165723 scopus 로고    scopus 로고
    • Song, Y.S., Wu, Y., Gusfield, D.: Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), 3692, pp. 152-164. Springer, Heidelberg (2005)
    • Song, Y.S., Wu, Y., Gusfield, D.: Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol. 3692, pp. 152-164. Springer, Heidelberg (2005)
  • 25


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