Computing all hybridization networks for multiple binary phylogenetic input trees

被引：0
|
作者：
Benjamin Albrecht
机构：
[1] Ludwig-Maximilians-Universität,Institut für Informatik
来源：
BMC Bioinformatics | / 16卷
关键词：
Hybridization networks; Maximum acyclic agreement forests; Phylogenetics;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] Computing phylogenetic trees using topologically related minimum spanning trees
    Kalaghatgi P.
    Lengauer T.
    1600, Brown University (21): : 1003 - 1025
  • [22] Folding and unfolding phylogenetic trees and networks
    Katharina T. Huber
    Vincent Moulton
    Mike Steel
    Taoyang Wu
    Journal of Mathematical Biology, 2016, 73 : 1761 - 1780
  • [23] Folding and unfolding phylogenetic trees and networks
    Huber, Katharina T.
    Moulton, Vincent
    Steel, Mike
    Wu, Taoyang
    JOURNAL OF MATHEMATICAL BIOLOGY, 2016, 73 (6-7) : 1761 - 1780
  • [24] Constructing phylogenetic networks from trees
    Bereg, S
    Bean, K
    BIBE 2005: 5th IEEE Symposium on Bioinformatics and Bioengineering, 2005, : 299 - 305
  • [25] Tanglegrams for rooted phylogenetic trees and networks
    Scornavacca, Celine
    Zickmann, Franziska
    Huson, Daniel H.
    BIOINFORMATICS, 2011, 27 (13) : I248 - I256
  • [26] Computing contour trees in all dimensions
    Carr, H
    Snoeyink, J
    Axen, U
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 918 - 926
  • [27] Computing contour trees in all dimensions
    Carr, H
    Snoeyink, J
    Axen, U
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2003, 24 (02): : 75 - 94
  • [28] ENUMERATING PHYLOGENETIC TREES WITH MULTIPLE LABELS
    FOULDS, LR
    ROBINSON, RW
    DISCRETE MATHEMATICS, 1988, 72 (1-3) : 129 - 139
  • [29] ARE ALL COMPLETE BINARY TREES GRACEFUL
    CAHIT, I
    AMERICAN MATHEMATICAL MONTHLY, 1976, 83 (01): : 35 - 36
  • [30] COMMENTS ON COMPUTING THE SIMILARITY OF BINARY-TREES
    JARVIS, JP
    LUEDEMAN, JK
    SHIER, DR
    JOURNAL OF THEORETICAL BIOLOGY, 1983, 100 (03) : 427 - 433
12345