메뉴 건너뛰기




Volumn 6, Issue 4, 2009, Pages 552-569

Comparison of tree-child phylogenetic networks

Author keywords

Network alignment; Partition distance; Phylogenetic network; Phylogenetic tree; Tree child phylogenetic network

Indexed keywords

ALIGNMENT METHODS; BIPARTITION; DISTANCE MEASURE; EVOLUTIONARY EVENTS; JAVA APPLET; MULTI-SETS; NATURAL NUMBER; PATH MULTIPLICITY; PHYLOGENETIC NETWORKS; PHYLOGENETIC TREE; PHYLOGENETIC TREES; POLYNOMIAL ALGORITHM; PRACTICAL ALGORITHMS; REGULAR NETWORKS; ROBINSON-FOULDS DISTANCE;

EID: 75449092462     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2007.70270     Document Type: Article
Times cited : (191)

References (48)
  • 1
    • 0347512294 scopus 로고    scopus 로고
    • Subtree transfer operations and their induced metrics on evolutionary trees
    • B.L. Allen and M.A. Steel, "Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees," Annals of Combinatorics, vol.5, no.1, pp. 1-13, 2001.
    • (2001) Annals of Combinatorics , vol.5 , Issue.1 , pp. 1-13
    • Allen, B.L.1    Steel, M.A.2
  • 2
    • 10944231221 scopus 로고    scopus 로고
    • The number of recombination events in a sample history: Conflict graph and lower bounds
    • Apr.-June
    • V. Bafna and V. Bansal, "The Number of Recombination Events in a Sample History: Conflict Graph and Lower Bounds," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol.1, no.2, pp. 78-90, Apr.-June 2004.
    • (2004) IEEE/ACM Trans. Computational Biology and Bioinformatics , vol.1 , Issue.2 , pp. 78-90
    • Bafna, V.1    Bansal, V.2
  • 4
    • 13844296576 scopus 로고    scopus 로고
    • A framework for representing reticulate evolution
    • M. Baroni, C. Semple, and M. Steel, "A Framework for Representing Reticulate Evolution," Annals of Combinatorics, vol.8, no.4, pp. 391-408, 2004.
    • (2004) Annals of Combinatorics , vol.8 , Issue.4 , pp. 391-408
    • Baroni, M.1    Semple, C.2    Steel, M.3
  • 7
    • 33947231094 scopus 로고    scopus 로고
    • Computing the minimum number of hybridization events for a consistent evolutionary history
    • M. Bordewich and C. Semple, "Computing the Minimum Number of Hybridization Events for a Consistent Evolutionary History," Discrete Applied Math., vol.155, no.8, pp. 914-928, 2007.
    • (2007) Discrete Applied Math. , vol.155 , Issue.8 , pp. 914-928
    • Bordewich, M.1    Semple, C.2
  • 8
    • 42549152927 scopus 로고    scopus 로고
    • A perl package and an alignment tool for phylogenetic networks
    • G. Cardona, F. Rosselló , and G. Valiente, "A Perl Package and an Alignment Tool for Phylogenetic Networks," BMC Boinformatics, vol.9, p. 175, 2008.
    • (2008) BMC Boinformatics , vol.9 , pp. 175
    • Cardona, G.1    Rosselló, F.2    Valiente, G.3
  • 9
    • 38349011199 scopus 로고    scopus 로고
    • Tripartitions do not always discriminate phylogenetic networks
    • G. Cardona, F. Rosselló , and G. Valiente, "Tripartitions Do Not Always Discriminate Phylogenetic Networks," Math. Biosciences, vol.211, no.2, pp. 356-370, 2008.
    • (2008) Math. Biosciences , vol.211 , Issue.2 , pp. 356-370
    • Cardona, G.1    Rosselló, F.2    Valiente, G.3
  • 10
    • 0030311519 scopus 로고    scopus 로고
    • The triples distance for rooted bifurcating phylogenetic trees
    • D.E. Critchlow, D.K. Pearl, and C. Qian, "The Triples Distance for Rooted Bifurcating Phylogenetic Trees," Systematic Biology, vol.45, no.3, pp. 323-334, 1996.
    • (1996) Systematic Biology , vol.45 , Issue.3 , pp. 323-334
    • Critchlow, D.E.1    Pearl, D.K.2    Qian, C.3
  • 12
    • 10044254311 scopus 로고    scopus 로고
    • The fine structure of galls in phylogenetic networks
    • D. Gusfield, S. Eddhu, and C. Langley, "The Fine Structure of Galls in Phylogenetic Networks," INFORMS J. Computing, vol.16, no.4, pp. 459-469, 2004.
    • (2004) INFORMS J. Computing , vol.16 , Issue.4 , pp. 459-469
    • Gusfield, D.1    Eddhu, S.2    Langley, C.3
  • 13
    • 3242876395 scopus 로고    scopus 로고
    • Optimal, efficient reconstruction of phylogenetic networks with constrained recombination
    • D. Gusfield, S. Eddhu, and C. Langley, "Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination," J. Bioinformatics and Computational Biology, vol.2, no.1, pp. 173-213, 2004.
    • (2004) J. Bioinformatics and Computational Biology , vol.2 , Issue.1 , pp. 173-213
    • Gusfield, D.1    Eddhu, S.2    Langley, C.3
  • 15
    • 46249116117 scopus 로고    scopus 로고
    • Split networks and reticulate networks
    • O. Gascuel and M. Steel, eds., Oxford Univ. Press
    • D.H. Huson, "Split Networks and Reticulate Networks," Reconstructing Evolution: New Math. and Computational Advances, O. Gascuel and M. Steel, eds., pp. 247-276, Oxford Univ. Press, 2007.
    • (2007) Reconstructing Evolution: New Math. and Computational Advances , pp. 247-276
    • Huson, D.H.1
  • 16
    • 30744470609 scopus 로고    scopus 로고
    • Application of phylogenetic networks in evolutionary studies
    • D.H. Huson and D. Bryant, "Application of Phylogenetic Networks in Evolutionary Studies," Molecular Biology and Evolution, vol.23, no.2, pp. 254-267, 2006.
    • (2006) Molecular Biology and Evolution , vol.23 , Issue.2 , pp. 254-267
    • Huson, D.H.1    Bryant, D.2
  • 17
    • 33750418625 scopus 로고    scopus 로고
    • Maximum likelihood of phylogenetic networks
    • G. Jin, L. Nakhleh, S. Snir, and T. Tuller, "Maximum Likelihood of Phylogenetic Networks," Bioinformatics, vol.22, no.21, pp. 2604-2611, 2006.
    • (2006) Bioinformatics , vol.22 , Issue.21 , pp. 2604-2611
    • Jin, G.1    Nakhleh, L.2    Snir, S.3    Tuller, T.4
  • 18
    • 33846654919 scopus 로고    scopus 로고
    • Efficient parsimony-based methods for phylogenetic network reconstruction
    • G. Jin, L. Nakhleh, S. Snir, and T. Tuller, "Efficient Parsimony-Based Methods for Phylogenetic Network Reconstruction," Bioinformatics, vol.23, no.2, pp. 123-128, 2007.
    • (2007) Bioinformatics , vol.23 , Issue.2 , pp. 123-128
    • Jin, G.1    Nakhleh, L.2    Snir, S.3    Tuller, T.4
  • 19
    • 0002719797 scopus 로고
    • The hungarian method for the assignment problem
    • H.W. Kuhn, "The Hungarian Method for the Assignment Problem," Naval Research Logistics Quarterly, vol.2, pp. 83-97, 1955.
    • (1955) Naval Research Logistics Quarterly , vol.2 , pp. 83-97
    • Kuhn, H.W.1
  • 22
    • 0031504952 scopus 로고    scopus 로고
    • Gene trees in species trees
    • W.P. Maddison, "Gene Trees in Species Trees," Systematic Biology, vol.46, no.3, pp. 523-536, 1997.
    • (1997) Systematic Biology , vol.46 , Issue.3 , pp. 523-536
    • Maddison, W.P.1
  • 26
    • 0002223982 scopus 로고
    • Algorithms for the assignment and transportation problems
    • J. Munkres, "Algorithms for the Assignment and Transportation Problems," J. SIAM, vol.5, no.1, pp. 32-38, 1957.
    • (1957) J. SIAM , vol.5 , Issue.1 , pp. 32-38
    • Munkres, J.1
  • 27
    • 14344251246 scopus 로고    scopus 로고
    • TreeJuxtaposer: Scalable tree comparison using focus+context with guaranteed visibility
    • T. Munzner, F. Guimbretière, S. Tasiran, L. Zhang, and Y. Zhou, "TreeJuxtaposer: Scalable Tree Comparison Using Focus+Context with Guaranteed Visibility," ACM Trans. Graphics, vol.22, no.3, pp. 453-462, 2003.
    • (2003) ACM Trans. Graphics , vol.22 , Issue.3 , pp. 453-462
    • Munzner, T.1    Guimbretière, F.2    Tasiran, S.3    Zhang, L.4    Zhou, Y.5
  • 28
    • 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, vol.163, no.1, pp. 375-394, 2003.
    • (2003) Genetics , vol.163 , Issue.1 , pp. 375-394
    • Myers, S.R.1    Griffiths, R.C.2
  • 29
    • 33746931382 scopus 로고    scopus 로고
    • PhD dissertation, Univ. of Texas, Austin
    • L. Nakhleh, "Phylogenetic Networks," PhD dissertation, Univ. of Texas, Austin, 2004.
    • (2004) Phylogenetic Networks
    • Nakhleh, L.1
  • 32
    • 23844438866 scopus 로고    scopus 로고
    • Reconstructing reticulate evolution in species: Theory and practice
    • L. Nakhleh, T. Warnow, C.R. Linder, and K.S. John, "Reconstructing Reticulate Evolution in Species: Theory and Practice," J. Computational Biology, vol.12, no.6, pp. 796-811, 2005.
    • (2005) J. Computational Biology , vol.12 , Issue.6 , pp. 796-811
    • Nakhleh, L.1    Warnow, T.2    Linder, C.R.3    John, K.S.4
  • 33
    • 30344473638 scopus 로고    scopus 로고
    • A novel algorithm and web-based tool for comparing two alternative phylogenetic trees
    • T.M. Nye, P. Lio, and W.R. Gilks, "A Novel Algorithm and Web-Based Tool for Comparing Two Alternative Phylogenetic Trees," Bioinformatics, vol.22, no.1, pp. 117-119, 2006.
    • (2006) Bioinformatics , vol.22 , Issue.1 , pp. 117-119
    • Nye, T.M.1    Lio, P.2    Gilks, W.R.3
  • 34
    • 0028681223 scopus 로고
    • Parallel phylogenies: Reconstructing the history of host-parasite assemblages
    • R.D.M. Page, "Parallel Phylogenies: Reconstructing the History of Host-Parasite Assemblages," Cladistics, vol.10, no.2, pp. 155-173, 1995.
    • (1995) Cladistics , vol.10 , Issue.2 , pp. 155-173
    • Page, R.D.M.1
  • 35
    • 33646746331 scopus 로고    scopus 로고
    • Phyloinformatics: Toward a phylogenetic database
    • J.T.-L. Wang, M.J. Zaki, H. Toivonen, and D. Shasha, eds., Springer
    • R.D.M. Page, "Phyloinformatics: Toward a Phylogenetic Database," Data Mining in Bioinformatics, J.T.-L. Wang, M.J. Zaki, H. Toivonen, and D. Shasha, eds., pp. 219-241, Springer, 2005.
    • (2005) Data Mining in Bioinformatics , pp. 219-241
    • Page, R.D.M.1
  • 36
    • 25444519441 scopus 로고    scopus 로고
    • An edit script for taxonomic classifications
    • R.D.M. Page and G. Valiente, "An Edit Script for Taxonomic Classifications," BMC Bioinformatics, vol.6, p. 208, 2005.
    • (2005) BMC Bioinformatics , vol.6 , pp. 208
    • Page, R.D.M.1    Valiente, G.2
  • 37
    • 34547844062 scopus 로고    scopus 로고
    • TOPD/FMTS: A new software to compare phylogenetic trees
    • P. Puigbò , S. Garcia-Vallvé, and J.O. McInerney, "TOPD/FMTS: A New Software to Compare Phylogenetic Trees," Bioinformatics, vol.23, no.12, pp. 1556-1558, 2007.
    • (2007) Bioinformatics , vol.23 , Issue.12 , pp. 1556-1558
    • Puigbò, P.1    Garcia-Vallvé, S.2    McInerney, J.O.3
  • 38
    • 0019424782 scopus 로고
    • Comparison of phylogenetic trees
    • D.F. Robinson and L.R. Foulds, "Comparison of Phylogenetic Trees," Math. Biosciences, vol. 53, no. 1/2, pp. 131-147, 1981.
    • (1981) Math. Biosciences , vol.53 , Issue.1-2 , pp. 131-147
    • Robinson, D.F.1    Foulds, L.R.2
  • 40
    • 15944363058 scopus 로고    scopus 로고
    • Constructing minimal ancestral recombination graphs
    • Y.S. Song, J. Hein, "Constructing Minimal Ancestral Recombination Graphs," J. Computational Biology, vol.12, no.2, pp. 147-169, 2005.
    • (2005) J. Computational Biology , vol.12 , Issue.2 , pp. 147-169
    • Song, Y.S.1    Hein, J.2
  • 41
    • 0034088330 scopus 로고    scopus 로고
    • Likelihood analysis of phylogenetic networks using directed graphical models
    • K. Strimmer and V. Moulton, "Likelihood Analysis of Phylogenetic Networks Using Directed Graphical Models," Molecular Biology and Evolution, vol.17, no.6, pp. 875-881, 2000.
    • (2000) Molecular Biology and Evolution , vol.17 , Issue.6 , pp. 875-881
    • Strimmer, K.1    Moulton, V.2
  • 42
    • 0035151371 scopus 로고    scopus 로고
    • Recombination analysis using directed graphical models
    • K. Strimmer, C. Wiuf, and V. Moulton, "Recombination Analysis Using Directed Graphical Models," Molecular Biology and Evolution, vol.18, no.1, pp. 97-99, 2001.
    • (2001) Molecular Biology and Evolution , vol.18 , Issue.1 , pp. 97-99
    • Strimmer, K.1    Wiuf, C.2    Moulton, V.3
  • 43
    • 0034913468 scopus 로고    scopus 로고
    • Perfect phylogenetic networks with recombination
    • L. Wang, K. Zhang, and L. Zhang, "Perfect Phylogenetic Networks with Recombination," J. Computational Biology, vol.8, no.1, pp. 69-78, 2001.
    • (2001) J. Computational Biology , vol.8 , Issue.1 , pp. 69-78
    • Wang, L.1    Zhang, K.2    Zhang, L.3
  • 44
    • 0018117949 scopus 로고
    • On the similarity of dendograms
    • M.S. Waterman and T.F. Smith, "On the Similarity of Dendograms," J. Theoretical Biology, vol.73, no.4, pp. 789-800, 1978.
    • (1978) J. Theoretical Biology , vol.73 , Issue.4 , pp. 789-800
    • Waterman, M.S.1    Smith, T.F.2
  • 45
    • 33745475103 scopus 로고    scopus 로고
    • Unique solvability of certain hybrid networks from their distances
    • S.J. Willson, "Unique Solvability of Certain Hybrid Networks from Their Distances," Annals of Combinatorics, vol.10, no.1, pp. 165-178, 2006.
    • (2006) Annals of Combinatorics , vol.10 , Issue.1 , pp. 165-178
    • Willson, S.J.1
  • 46
    • 35648967624 scopus 로고    scopus 로고
    • Reconstruction of some hybrid phylogenetic networks with homoplasies from distances
    • S.J. Willson, "Reconstruction of Some Hybrid Phylogenetic Networks with Homoplasies from Distances," Bull. of Math. Biology, vol.69, no.8, pp. 2561-2590, 2007.
    • (2007) Bull. of Math. Biology , vol.69 , Issue.8 , pp. 2561-2590
    • Willson, S.J.1
  • 48
    • 34250754966 scopus 로고    scopus 로고
    • Unique determination of some homoplasies at hybridization events
    • S.J. Willson, "Unique Determination of Some Homoplasies at Hybridization Events," Bull. of Math. Biology, vol.69, no.5, pp. 1709-1725, 2007.
    • (2007) Bull. of Math. Biology , vol.69 , Issue.5 , pp. 1709-1725
    • Willson, S.J.1


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