메뉴 건너뛰기




Volumn 26, Issue 1, 1997, Pages 210-230

Sparse dynamic programming for evolutionary-tree comparison

Author keywords

Computational biology; Evolutionary trees; Sparse dynamic programming

Indexed keywords


EID: 0001052107     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794262422     Document Type: Review
Times cited : (29)

References (24)
  • 1
    • 0027871991 scopus 로고
    • A polynomial-time algorithm for the phylogeny problem when the number of character states is fixed
    • IEEE Computer Society Press, Los Alamitos, CA
    • R. AGARWALA AND D. FERNANDEZ-BACA, A polynomial-time algorithm for the phylogeny problem when the number of character states is fixed, in Proc. 34th IEEE Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 140-147.
    • (1994) Proc. 34th IEEE Annual Symposium on Foundations of Computer Science , pp. 140-147
    • Agarwala, R.1    Fernandez-Baca, D.2
  • 3
    • 0042565676 scopus 로고
    • Maximum agreement subtrees in multiple evolutionary trees
    • IEEE Computer Society Press, Los Alamitos, CA
    • A. AMIR AND D. KESELMAN, Maximum agreement subtrees in multiple evolutionary trees, in Proc. 35th IEEE Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 758-769.
    • (1995) Proc. 35th IEEE Annual Symposium on Foundations of Computer Science , pp. 758-769
    • Amir, A.1    Keselman, D.2
  • 4
    • 0008758279 scopus 로고
    • 2.5) time algorithms for the subgraph homeomorphism problem on trees
    • 2.5) time algorithms for the subgraph homeomorphism problem on trees, J. Algorithms, 8 (1987), pp. 106-112.
    • (1987) J. Algorithms , vol.8 , pp. 106-112
    • Chung, M.J.1
  • 5
    • 0000747464 scopus 로고
    • Foreward: Comparison and consensus of classifications
    • W. H. E. DAY, Foreward: Comparison and consensus of classifications, J. Classification, 3 (1986), pp. 183-185.
    • (1986) J. Classification , vol.3 , pp. 183-185
    • Day, W.H.E.1
  • 6
    • 0029192324 scopus 로고
    • A robust model for finding optimal evolutionary trees
    • M. FARACH, S. KANNAN, AND T. WARNOW, A robust model for finding optimal evolutionary trees, Algorithmica, 13 (1995), pp. 155-179.
    • (1995) Algorithmica , vol.13 , pp. 155-179
    • Farach, M.1    Kannan, S.2    Warnow, T.3
  • 8
    • 0000472542 scopus 로고
    • Estimating phylogenetic trees from distance matrices
    • J. S. FARRIS, Estimating phylogenetic trees from distance matrices, Amer. Naturalist, 106 (1972), pp. 645-668.
    • (1972) Amer. Naturalist , vol.106 , pp. 645-668
    • Farris, J.S.1
  • 9
    • 0024152983 scopus 로고
    • Phylogenies from molecular sequences: Inference and reliability
    • J. FELSENSTEIN, Phylogenies from molecular sequences: Inference and reliability, Annual Rev. Genetics, 22 (1988), pp. 521-565.
    • (1988) Annual Rev. Genetics , vol.22 , pp. 521-565
    • Felsenstein, J.1
  • 10
    • 0000399236 scopus 로고
    • Obtaining common pruned trees
    • C. R. FINDEN AND A. D. GORDON, Obtaining common pruned trees, J. Classification, 2 (1985), pp. 255-276.
    • (1985) J. Classification , vol.2 , pp. 255-276
    • Finden, C.R.1    Gordon, A.D.2
  • 11
    • 5544247726 scopus 로고
    • The construction of phylogenetic trees
    • W. M. FITCH AND E. MARGOLIASH, The construction of phylogenetic trees, Science, 155 (1976), pp. 29-94.
    • (1976) Science , vol.155 , pp. 29-94
    • Fitch, W.M.1    Margoliash, E.2
  • 12
    • 0024748699 scopus 로고
    • Faster scaling algorithms for network problems
    • H. GABOW AND R. TARJAN, Faster scaling algorithms for network problems, SIAM J. Comput., 18 (1989), pp. 1013-1036.
    • (1989) SIAM J. Comput. , vol.18 , pp. 1013-1036
    • Gabow, H.1    Tarjan, R.2
  • 13
    • 0023501273 scopus 로고
    • Molecular vs. morphological approaches to systematics
    • D. M. HILLIS, Molecular vs. morphological approaches to systematics, Annual Rev. Systematics and Ecology, 18 (1987), pp. 23-42.
    • (1987) Annual Rev. Systematics and Ecology , vol.18 , pp. 23-42
    • Hillis, D.M.1
  • 14
    • 0017492836 scopus 로고
    • A fast algorithm for computing longest common subsequences
    • J. HUNT AND T. SZYMANSKI, A fast algorithm for computing longest common subsequences, Comm. Assoc. Comput. Mach., 20 (1977), pp. 350-353.
    • (1977) Comm. Assoc. Comput. Mach. , vol.20 , pp. 350-353
    • Hunt, J.1    Szymanski, T.2
  • 15
    • 84863090748 scopus 로고
    • Steiner tree problems
    • F. K. HWANG AND D. S. RICHARDS, Steiner tree problems, Networks, 22 (1992), pp. 55-89.
    • (1992) Networks , vol.22 , pp. 55-89
    • Hwang, F.K.1    Richards, D.S.2
  • 18
    • 0023498406 scopus 로고
    • Earliest phylogenetic branchings: Comparing rRNA-based evolutionary trees inferred with various techniques
    • G. J. OLSEN, Earliest phylogenetic branchings: Comparing rRNA-based evolutionary trees inferred with various techniques, Cold Spring Harbor Sympos. on Quantitative Biol., 52 (1987), pp. 825-837.
    • (1987) Cold Spring Harbor Sympos. on Quantitative Biol. , vol.52 , pp. 825-837
    • Olsen, G.J.1
  • 19
    • 0023375195 scopus 로고
    • The neighbor-joining method: A new method for reconstructing phylogentic trees
    • N. SAITOU AND M. NEI, The neighbor-joining method: A new method for reconstructing phylogentic trees, Molecular Biol. Evol., 4 (1987), pp. 406-424.
    • (1987) Molecular Biol. Evol. , vol.4 , pp. 406-424
    • Saitou, N.1    Nei, M.2
  • 21
    • 0027912455 scopus 로고
    • Kaikoura tree theorems: Computing the maximum agreement subtree
    • M. STEEL AND T. WARNOW, Kaikoura tree theorems: Computing the maximum agreement subtree, Inform. Process. Lett., 48 (1989), pp. 77-82.
    • (1989) Inform. Process. Lett. , vol.48 , pp. 77-82
    • Steel, M.1    Warnow, T.2
  • 22
    • 0001140522 scopus 로고
    • Phylogeny reconstruction
    • D. M. Hillis and C. Moritz, eds., Sinauer Associates Inc., Sunderland, MA
    • D. L. SWOFFORD AND G. J. OLSEN, Phylogeny reconstruction, in Molecular Systematics, D. M. Hillis and C. Moritz, eds., Sinauer Associates Inc., Sunderland, MA, 1990, pp. 411-501.
    • (1990) Molecular Systematics , pp. 411-501
    • Swofford, D.L.1    Olsen, G.J.2
  • 24
    • 0040762859 scopus 로고
    • Master's thesis, Technical report 9301, Department of Computer Science, Memorial University of Newfoundland, St. John's, NF, Canada
    • H. T. WAREHAM, On the computational complexity of inferring evolutionary trees, Master's thesis, Technical report 9301, Department of Computer Science, Memorial University of Newfoundland, St. John's, NF, Canada, 1993.
    • (1993) On the Computational Complexity of Inferring Evolutionary Trees
    • Wareham, H.T.1


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