메뉴 건너뛰기




Volumn 68, Issue 4, 2006, Pages 919-944

Unique reconstruction of tree-like phylogenetic networks from distances between leaves

Author keywords

Network; Phylogenetic network; Phylogeny

Indexed keywords

ARTICLE; BIOLOGICAL MODEL; GENETIC PROCEDURES; MATHEMATICS; PHYLOGENY; STATISTICS;

EID: 33746883512     PISSN: 00928240     EISSN: 15229602     Source Type: Journal    
DOI: 10.1007/s11538-005-9044-x     Document Type: Article
Times cited : (11)

References (23)
  • 1
    • 0000673494 scopus 로고
    • Reconstructing the shape of a tree from observed dissimilarity data
    • Bandelt, H.-J., Dress, A., 1986. Reconstructing the shape of a tree from observed dissimilarity data. Adv. Appl. Math. 7, 309-343.
    • (1986) Adv. Appl. Math. , vol.7 , pp. 309-343
    • Bandelt, H.-J.1    Dress, A.2
  • 2
    • 0026911267 scopus 로고
    • Split decomposition: A new and useful approach to phylogenetic analysis of distance data
    • Bandelt, H.-J., Dress, A., 1992. Split decomposition: A new and useful approach to phylogenetic analysis of distance data. Mol. Phylogenet. Evol. 1, 242-252.
    • (1992) Mol. Phylogenet. Evol. , vol.1 , pp. 242-252
    • Bandelt, H.-J.1    Dress, A.2
  • 3
    • 13844296576 scopus 로고    scopus 로고
    • A framework for representing reticulate evolution
    • Baroni, M., Semple, C., Steel, M., 2004. A framework for representing reticulate evolution. Anal. Combinat. 8, 391-408.
    • (2004) Anal. Combinat. , vol.8 , pp. 391-408
    • Baroni, M.1    Semple, C.2    Steel, M.3
  • 4
    • 0019797407 scopus 로고
    • Evolutionary trees from DNA sequences: A maximum likelihood approach
    • Felsenstein, J., 1981. Evolutionary trees from DNA sequences: A maximum likelihood approach. J. Mol. Evol. 17, 368-376.
    • (1981) J. Mol. Evol. , vol.17 , pp. 368-376
    • Felsenstein, J.1
  • 6
    • 0019752439 scopus 로고
    • A non-sequential method for constructing trees and hierarchical classifications
    • Fitch, W.M., 1981. A non-sequential method for constructing trees and hierarchical classifications. J. Mol. Evol. 18, 30-37.
    • (1981) J. Mol. Evol. , vol.18 , pp. 30-37
    • Fitch, W.M.1
  • 7
    • 84987049379 scopus 로고
    • Efficient algorithms for inferring evolutionary history
    • Gusfield, D., 1991. Efficient algorithms for inferring evolutionary history. Networks 21, 19-28.
    • (1991) Networks , vol.21 , pp. 19-28
    • Gusfield, D.1
  • 8
    • 3242876395 scopus 로고    scopus 로고
    • Optimal, efficient reconstruction of phylogenetic networks with constrained recombination
    • Gusfield, D., Eddhu, S., Langley, C., 2004a. Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J. Bioinform. Comput. Biol. 2, 173-213.
    • (2004) J. Bioinform. Comput. Biol. , vol.2 , pp. 173-213
    • Gusfield, D.1    Eddhu, S.2    Langley, C.3
  • 9
    • 10044254311 scopus 로고    scopus 로고
    • The fine structure of galls in phylogenetic networks
    • Gusfield, D., Eddhu, S., Langley, C., 2004b. The fine structure of galls in phylogenetic networks. INFORMS J. Comput. 16(4), 459-469.
    • (2004) INFORMS J. Comput. , vol.16 , Issue.4 , pp. 459-469
    • Gusfield, D.1    Eddhu, S.2    Langley, C.3
  • 10
    • 0022376704 scopus 로고
    • Dating of the human-ape splitting by a molecular clock of mitochondrial DNA
    • Hasegawa, M., Kishino, H., Yano, K., 1985. Dating of the human-ape splitting by a molecular clock of mitochondrial DNA. J. Mol. Evol. 22, 160-174.
    • (1985) J. Mol. Evol. , vol.22 , pp. 160-174
    • Hasegawa, M.1    Kishino, H.2    Yano, K.3
  • 11
    • 0025299784 scopus 로고
    • Reconstructing evolution of sequences subject to recombination using parsimony
    • Hein, J., 1990. Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. 98, 185-200.
    • (1990) Math. Biosci. , vol.98 , pp. 185-200
    • Hein, J.1
  • 12
    • 0027471670 scopus 로고
    • A heuristic method to reconstruct the history of sequences subject to recombination
    • Hein, J., 1993. A heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol. 36, 396-405.
    • (1993) J. Mol. Evol. , vol.36 , pp. 396-405
    • Hein, J.1
  • 13
    • 0031678692 scopus 로고    scopus 로고
    • SplitsTree: A program for analyzing and visualizing evolutionary data
    • Huson, D.H., 1998. SplitsTree: A program for analyzing and visualizing evolutionary data. Bioinformatics 141, 68-73.
    • (1998) Bioinformatics , vol.141 , pp. 68-73
    • Huson, D.H.1
  • 14
    • 0004265380 scopus 로고
    • Evolution of protein molecules
    • Osawa, S., Honjo, T. (Eds.), Springer-Verlag, Tokyo
    • Jukes, T.H., Cantor, C.R., 1969. Evolution of protein molecules. In: Osawa, S., Honjo, T. (Eds.), Evolution of Life: Fossils, Molecules, and Culture. Springer-Verlag, Tokyo, pp. 79-95.
    • (1969) Evolution of Life: Fossils, Molecules, and Culture , pp. 79-95
    • Jukes, T.H.1    Cantor, C.R.2
  • 15
    • 0019296687 scopus 로고
    • A simple method for estimating evolutionary rate of base substitutions through comparative studies of nucleotide sequences
    • Kimura, M., 1980. A simple method for estimating evolutionary rate of base substitutions through comparative studies of nucleotide sequences. J. Mol. Evol. 16, 111-120.
    • (1980) J. Mol. Evol. , vol.16 , pp. 111-120
    • Kimura, M.1
  • 16
    • 3142516825 scopus 로고
    • A simple method for construcing phylogenetic trees from distance matrices
    • U.S.A.
    • Li, W.-H., 1981. A simple method for construcing phylogenetic trees from distance matrices. Proc. Natl. Acad. Sci. U.S.A. 78, 1085-1089.
    • (1981) Proc. Natl. Acad. Sci. , vol.78 , pp. 1085-1089
    • Li, W.-H.1
  • 17
    • 1842502896 scopus 로고    scopus 로고
    • From a phylogenetic tree to a reticulated network
    • Makarenkov, V., Legendre, P., 2004. From a phylogenetic tree to a reticulated network. J. Comput. Biol. 11, 195-212.
    • (2004) J. Comput. Biol. , vol.11 , pp. 195-212
    • Makarenkov, V.1    Legendre, P.2
  • 20
    • 0023375195 scopus 로고
    • The neighbor-joining method: A new method for reconstructing phylogenetic trees
    • Saitou, N., Nei, M., 1987. The neighbor-joining method: A new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4, 406-425.
    • (1987) Mol. Biol. Evol. , vol.4 , pp. 406-425
    • Saitou, N.1    Nei, M.2
  • 21
    • 0000491446 scopus 로고
    • Additive similarity trees
    • Sattath, S., Tversky, A., 1977. Additive similarity trees. Psychometrika 42, 319-345.
    • (1977) Psychometrika , vol.42 , pp. 319-345
    • Sattath, S.1    Tversky, A.2
  • 22
    • 0034913468 scopus 로고    scopus 로고
    • Perfect phylogenetic networks with recombination
    • Wang, L., Zhang, K., Zhang, L., 2001. Perfect phylogenetic networks with recombination. J. Comput. Biol. 8, 69-78.
    • (2001) J. Comput. Biol. , vol.8 , pp. 69-78
    • Wang, L.1    Zhang, K.2    Zhang, L.3
  • 23
    • 33745475103 scopus 로고    scopus 로고
    • Unique solvability of certain hybrid networks from their distances
    • Willson, S.J., 2006. Unique solvability of certain hybrid networks from their distances. Ann. Combinat.
    • (2006) Ann. Combinat.
    • Willson, S.J.1


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