메뉴 건너뛰기




Volumn 6, Issue 1, 2009, Pages 62-75

Robustness of topological supertree methods for reconciling dense incompatible data

Author keywords

Graph algorithms; Phylogenetic tree; Supertree; Trees

Indexed keywords

DATA SETS; GRAPH ALGORITHMS; INPUT SETS; OPTIMIZATION PROBLEMS; PHYLOGENETIC TREE; POLYNOMIAL-TIME; SUPERTREE; TREES;

EID: 59649117844     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2008.51     Document Type: Article
Times cited : (3)

References (32)
  • 1
    • 0000090670 scopus 로고
    • N-Trees as Nestings: Complexity, Similarity and Consensus
    • E.N. Adams III, "N-Trees as Nestings: Complexity, Similarity and Consensus," J. Classification, vol. 3, pp. 299-317, 1986.
    • (1986) J. Classification , vol.3 , pp. 299-317
    • Adams III, E.N.1
  • 2
    • 0001567207 scopus 로고
    • Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
    • A.V. Aho, Y. Sagiv, T.G. Szymanski, and J.D. Ullman, "Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions," SIAM J. Computing, vol. 10, no. 3, pp. 405-421, 1981.
    • (1981) SIAM J. Computing , vol.10 , Issue.3 , pp. 405-421
    • Aho, A.V.1    Sagiv, Y.2    Szymanski, T.G.3    Ullman, J.D.4
  • 3
    • 0001656793 scopus 로고    scopus 로고
    • The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction
    • K. Atteson, "The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction," Algorithmica, vol. 25, pp. 251-278, 1999.
    • (1999) Algorithmica , vol.25 , pp. 251-278
    • Atteson, K.1
  • 5
    • 0002844544 scopus 로고
    • Combining Trees as a Way of Combining Data Sets for Phylogenetic Inference, and the Desirability of Combining Gene Trees
    • B.R. Baum, "Combining Trees as a Way of Combining Data Sets for Phylogenetic Inference, and the Desirability of Combining Gene Trees," Taxon, vol. 41, pp. 3-10, 1992.
    • (1992) Taxon , vol.41 , pp. 3-10
    • Baum, B.R.1
  • 6
    • 0001117764 scopus 로고    scopus 로고
    • Inferring Evolutionary Trees with Strong Combinatorial Evidence
    • V. Berry and O. Gascuel, "Inferring Evolutionary Trees with Strong Combinatorial Evidence," Theoretical Computer Science, vol. 240, pp. 271-298, 2000.
    • (2000) Theoretical Computer Science , vol.240 , pp. 271-298
    • Berry, V.1    Gascuel, O.2
  • 8
    • 0035527411 scopus 로고    scopus 로고
    • Assessment of the Accuracy of Matrix Representation with Parsimony Analysis Supertree Construction
    • O. Bininda-Emonds and M.J. Sanderson, "Assessment of the Accuracy of Matrix Representation with Parsimony Analysis Supertree Construction," Systematic Biology, vol. 50, no. 4, pp. 565-579, 2001.
    • (2001) Systematic Biology , vol.50 , Issue.4 , pp. 565-579
    • Bininda-Emonds, O.1    Sanderson, M.J.2
  • 13
    • 13844250623 scopus 로고    scopus 로고
    • CLANN: Software for Supertree Analysis
    • C.J. Creevey and J.O. Mclnerney, "CLANN: Software for Supertree Analysis," Bioinformatics, vol. 21, pp. 390-392, 2005.
    • (2005) Bioinformatics , vol.21 , pp. 390-392
    • Creevey, C.J.1    Mclnerney, J.O.2
  • 14
    • 33646928341 scopus 로고    scopus 로고
    • Discordance of Species Trees with Their Most Likely Gene Trees
    • DOI: 10.1371/journal.pgen.0020068
    • J.H. Degnan and N.A. Rosenberg, "Discordance of Species Trees with Their Most Likely Gene Trees," PLoS Genetics, vol. 2, no. 5, 2006, e68, DOI: 10.1371/journal.pgen.0020068.
    • (2006) PLoS Genetics , vol.2 , Issue.5
    • Degnan, J.H.1    Rosenberg, N.A.2
  • 18
    • 0003081588 scopus 로고
    • The Steiner Problem in Phylogeny Is NP-Complete
    • L.R. Foulds and R.L. Graham, "The Steiner Problem in Phylogeny Is NP-Complete," Advances in Applied Math., vol. 3, pp. 43-49, 1982.
    • (1982) Advances in Applied Math , vol.3 , pp. 43-49
    • Foulds, L.R.1    Graham, R.L.2
  • 19
    • 59649129667 scopus 로고
    • La Structure Algebrique des Classifications Hierarchiques
    • vols
    • M. Gondran, "La Structure Algebrique des Classifications Hierarchiques," Annales de I'INSEE, vols. 22-23, pp. 181-190, 1976.
    • (1976) Annales de I'INSEE , vol.22-23 , pp. 181-190
    • Gondran, M.1
  • 22
    • 84956992917 scopus 로고    scopus 로고
    • R.D.M. Page, Modified Mincut Supertrees, Proc. Second Int'l Workshop Algorithms in Bioinformatics (WABI'02), R, Guig and D. Gusfield, eds., pp. 537-552, Sept. 2002.
    • R.D.M. Page, "Modified Mincut Supertrees," Proc. Second Int'l Workshop Algorithms in Bioinformatics (WABI'02), R, Guig and D. Gusfield, eds., pp. 537-552, Sept. 2002.
  • 23
    • 17744379783 scopus 로고    scopus 로고
    • The Opisthokonta and the Ecdysozoa May Not Be Clades: Stronger Support for the Grouping of Plant and Animal than for Animal and Fungi and Stronger Support for the Coelomata than Ecdysozoa
    • G.K. Philip, C.J. Creevey, and J.O. McInerney, "The Opisthokonta and the Ecdysozoa May Not Be Clades: Stronger Support for the Grouping of Plant and Animal than for Animal and Fungi and Stronger Support for the Coelomata than Ecdysozoa," Molecular Biology and Evolution, vol. 22, no. 5, pp. 11754184, 2005.
    • (2005) Molecular Biology and Evolution , vol.22 , Issue.5 , pp. 11754184
    • Philip, G.K.1    Creevey, C.J.2    McInerney, J.O.3
  • 24
    • 0026822436 scopus 로고
    • Phylogenetic Inference Based on Matrix Representation of Trees
    • M.A. Ragan, "Phylogenetic Inference Based on Matrix Representation of Trees," Molecular Phylogenetics and Evolution, vol. 1, pp. 53-58, 1992.
    • (1992) Molecular Phylogenetics and Evolution , vol.1 , pp. 53-58
    • Ragan, M.A.1
  • 27
    • 0001541744 scopus 로고    scopus 로고
    • A Supertree Method for Rooted Trees
    • C. Semple and M. Steel, "A Supertree Method for Rooted Trees," Discrete Applied Math., vol. 105, pp. 147-158, 2000.
    • (2000) Discrete Applied Math , vol.105 , pp. 147-158
    • Semple, C.1    Steel, M.2
  • 29
  • 30
    • 0034350430 scopus 로고    scopus 로고
    • Simple but Fundamental Limitations on Supertree and Consensus Tree Methods
    • M. Steel, S. Böcker, and A.W.M. Dress, "Simple but Fundamental Limitations on Supertree and Consensus Tree Methods," Systematic Biology, vol. 49, no. 2, pp. 363-368, 2000.
    • (2000) Systematic Biology , vol.49 , Issue.2 , pp. 363-368
    • Steel, M.1    Böcker, S.2    Dress, A.W.M.3


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