메뉴 건너뛰기




Volumn 2, Issue 1, 2004, Pages 173-213

Optimal, efficient reconstruction of phylogenetic networks with constrained recombination

Author keywords

Ancestral recombination graph; Bi convex graph; Molecular evolution; Phylogenetic networks; Recombination; SNP

Indexed keywords

ARTICLE; GENE SEQUENCE; GENE STRUCTURE; GENETIC ALGORITHM; GENETIC RECOMBINATION; MATHEMATICAL COMPUTING; MOLECULAR EVOLUTION; PHYLOGENETIC TREE; PHYLOGENY; SEQUENCE ANALYSIS;

EID: 3242876395     PISSN: 02197200     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219720004000521     Document Type: Article
Times cited : (144)

References (21)
  • 1
    • 0034913468 scopus 로고    scopus 로고
    • "Perfect phylogenetic networks with recombination"
    • L. Wang, K. Zhang and L. Zhang, "Perfect phylogenetic networks with recombination," J. Comput. Biol. 8, 69-78 (2001).
    • (2001) J. Comput. Biol. , vol.8 , pp. 69-78
    • Wang, L.1    Zhang, K.2    Zhang, L.3
  • 2
    • 0004485904 scopus 로고
    • "Computational complexity of inferring phylogenies by compatibility"
    • W. H. Day and D. Sankoff, "Computational complexity of inferring phylogenies by compatibility," Syst. Zool. 35, 224-229 (1986).
    • (1986) Syst. Zool. , vol.35 , pp. 224-229
    • Day, W.H.1    Sankoff, D.2
  • 3
    • 0346673801 scopus 로고    scopus 로고
    • "Strongly orderable graphs: A common generalization of strongly chordal and chordal bipartite graphs"
    • F. Dragan, "Strongly orderable graphs: A common generalization of strongly chordal and chordal bipartite graphs," Discrete Applied Math. 427-442 (2000).
    • (2000) Discrete Applied Math. , pp. 427-442
    • Dragan, F.1
  • 4
    • 84987049379 scopus 로고
    • "Efficient algorithms for inferring evolutionary history"
    • D. Gusfield, "Efficient algorithms for inferring evolutionary history," Networks 21, 19-28 (1991).
    • (1991) Networks , vol.21 , pp. 19-28
    • Gusfield, D.1
  • 5
    • 0004137004 scopus 로고    scopus 로고
    • "Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology"
    • Cambridge University Press
    • D. Gusfield, "Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology," Cambridge University Press (1997).
    • (1997)
    • Gusfield, D.1
  • 7
    • 84863081318 scopus 로고    scopus 로고
    • "PowerPoint slides for: Efficient Reconstruction of Phylogenetic Networks (of SNPs) with Constrained Recombination"
    • D. Gusfield, S. Eddhu, and C. Langley, "PowerPoint slides for: Efficient Reconstruction of Phylogenetic Networks (of SNPs) with Constrained Recombination," http://wwwcsif.cs.ucdavis.edu/~gusfield/talks.html.
    • Gusfield, D.1    Eddhu, S.2    Langley, C.3
  • 8
    • 3242878476 scopus 로고    scopus 로고
    • "Efficient reconstruction of phylogenetic networks (of SNPs) with constrained recombination"
    • IEEE Press
    • D. Gusfield, S. Eddhu and C. Langley, "Efficient reconstruction of phylogenetic networks (of SNPs) with constrained recombination," in Proceedings of 2nd CSB Bioinformatics Conference. IEEE Press, (2003)
    • (2003) Proceedings of 2nd CSB Bioinformatics Conference
    • Gusfield, D.1    Eddhu, S.2    Langley, C.3
  • 9
    • 3242888776 scopus 로고    scopus 로고
    • "The fine structure of galls in phylogenetic networks with recombination"
    • UC Davis, Department of Computer Science
    • D. Gusfield, S. Eddhu, and C. Langley, "The fine structure of galls in phylogenetic networks with recombination," Technical report, UC Davis, Department of Computer Science, (2003).
    • (2003) Technical Report
    • Gusfield, D.1    Eddhu, S.2    Langley, C.3
  • 10
    • 0025299784 scopus 로고
    • "Reconstructing evolution of sequences subject to recombination using parsimony"
    • J. Hein, "Reconstructing evolution of sequences subject to recombination using parsimony," Math. Biosci. 98, 185-200 (1990).
    • (1990) Math. Biosci. , vol.98 , pp. 185-200
    • Hein, J.1
  • 11
    • 0027471670 scopus 로고
    • "A heuristic method to reconstruct the history of sequences subject to recombination"
    • J. Hein, "A heuristic method to reconstruct the history of sequences subject to recombination," J. Mol. Evol. 36, 396-405 (1993).
    • (1993) J. Mol. Evol. , vol.36 , pp. 396-405
    • Hein, J.1
  • 12
    • 0022211482 scopus 로고
    • "Statistical properties of the number of recombination events in the history of a sample of DNA sequences"
    • R. Hudson and N. Kaplan, "Statistical properties of the number of recombination events in the history of a sample of DNA sequences," Genetics 111, 147-164 (1985).
    • (1985) Genetics , vol.111 , pp. 147-164
    • Hudson, R.1    Kaplan, N.2
  • 13
    • 0039528958 scopus 로고    scopus 로고
    • "Reconstructing a history of recombinations from a set of sequences"
    • J. D. Kececioglu and D. Gusfield, "Reconstructing a history of recombinations from a set of sequences," Discrete Applied Math. 239-260 (1998).
    • (1998) Discrete Applied Math. , pp. 239-260
    • Kececioglu, J.D.1    Gusfield, D.2
  • 14
    • 0035895254 scopus 로고    scopus 로고
    • "Heterogeneous geographic patterns of nucleotide sequence diversity between two alcohol dehydrogenase genes in wild barley (Hordeum vulgare subspecies spontaneum)"
    • J. Z. Lin, A. Brown and M. T. Clegg, "Heterogeneous geographic patterns of nucleotide sequence diversity between two alcohol dehydrogenase genes in wild barley (Hordeum vulgare subspecies spontaneum)," PNAS 98, 531-536 (2001).
    • (2001) PNAS , vol.98 , pp. 531-536
    • Lin, J.Z.1    Brown, A.2    Clegg, M.T.3
  • 15
    • 0037279717 scopus 로고    scopus 로고
    • "Bounds on the minimum number of recombination events in a sample history"
    • S. R. Myers and R. C. Griffiths, "Bounds on the minimum number of recombination events in a sample history," Genetics 163, 375-394 (2003).
    • (2003) Genetics , vol.163 , pp. 375-394
    • Myers, S.R.1    Griffiths, R.C.2
  • 16
    • 3242890371 scopus 로고    scopus 로고
    • "Perfect phylogenetic networks: A new methodology for reconstructing the evolutionary history of natural languages"
    • preprint, 14 April
    • L. Nakhleh, D. Ringe and T. Warnow, "Perfect phylogenetic networks: a new methodology for reconstructing the evolutionary history of natural languages," preprint, 14 April 2002.
    • (2002)
    • Nakhleh, L.1    Ringe, D.2    Warnow, T.3
  • 17
    • 0036468808 scopus 로고    scopus 로고
    • "Linkage disequilibrium, haplotype evolution, and the coalescent"
    • M. Norborg and S. Tavare, "Linkage disequilibrium, haplotype evolution, and the coalescent," Trends in Genetics 18, 83-90 (2002).
    • (2002) Trends in Genetics , vol.18 , pp. 83-90
    • Norborg, M.1    Tavare, S.2
  • 18
    • 0035139147 scopus 로고    scopus 로고
    • "Intraspecific gene genealogies: Trees grafting into networks"
    • D. Posada and K. Crandall, "Intraspecific gene genealogies: trees grafting into networks," Trends in Ecology and Evolution 16, 37-45 (2001).
    • (2001) Trends in Ecology and Evolution , vol.16 , pp. 37-45
    • Posada, D.1    Crandall, K.2
  • 19
    • 0033793521 scopus 로고    scopus 로고
    • "Consequences of recombination on traditional phylogenetic analysis"
    • M. H. Schierup and J. Hein, "Consequences of recombination on traditional phylogenetic analysis," Genetics 156, 879-891 (2000).
    • (2000) Genetics , vol.156 , pp. 879-891
    • Schierup, M.H.1    Hein, J.2
  • 20
    • 3242879607 scopus 로고    scopus 로고
    • "On the minimum number of recombination events in the evolutionary history of DNA sequences"
    • (to appear)
    • Y. Song and J. Hein, "On the minimum number of recombination events in the evolutionary history of DNA sequences," J. Math. Bio. (to appear) (2003).
    • (2003) J. Math. Bio.
    • Song, Y.1    Hein, J.2
  • 21
    • 2442543323 scopus 로고    scopus 로고
    • "Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks: Finding the Minimum Number of Recombination Events"
    • Springer-Verlag LNCS
    • Y. Song and J. Hein, "Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks: Finding the Minimum Number of Recombination Events," in Proc. of 2003 Workshop on Algorithms in Bioinformatics, Springer-Verlag LNCS, (2003).
    • (2003) Proc. of 2003 Workshop on Algorithms in Bioinformatics
    • Song, Y.1    Hein, J.2


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