108 related articles for article (PubMed ID: 20660951)
1. Comparison of galled trees.
Cardona G; Llabrés M; Rosselló F; Valiente G
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(2):410-27. PubMed ID: 20660951
[TBL] [Abstract][Full Text] [Related]
2. A concise necessary and sufficient condition for the existence of a galled-tree.
Song YS
IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(2):186-91. PubMed ID: 17048404
[TBL] [Abstract][Full Text] [Related]
3. Metrics for phylogenetic networks I: generalizations of the Robinson-Foulds metric.
Cardona G; Llabrés M; Rosselló F; Valiente G
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):46-61. PubMed ID: 19179698
[TBL] [Abstract][Full Text] [Related]
4. Reconstruction of certain phylogenetic networks from their tree-average distances.
Willson SJ
Bull Math Biol; 2013 Oct; 75(10):1840-78. PubMed ID: 23864219
[TBL] [Abstract][Full Text] [Related]
5. Optimal, efficient reconstruction of phylogenetic networks with constrained recombination.
Gusfield D; Eddhu S; Langley C
J Bioinform Comput Biol; 2004 Mar; 2(1):173-213. PubMed ID: 15272438
[TBL] [Abstract][Full Text] [Related]
6. All that glisters is not galled.
Rosselló F; Valiente G
Math Biosci; 2009 Sep; 221(1):54-9. PubMed ID: 19576908
[TBL] [Abstract][Full Text] [Related]
7. A metric on the space of reduced phylogenetic networks.
Nakhleh L
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):218-22. PubMed ID: 20431142
[TBL] [Abstract][Full Text] [Related]
8. Matching split distance for unrooted binary phylogenetic trees.
Bogdanowicz D; Giaro K
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(1):150-60. PubMed ID: 21383415
[TBL] [Abstract][Full Text] [Related]
9. Fast Construction of Near Parsimonious Hybridization Networks for Multiple Phylogenetic Trees.
Mirzaei S; Wu Y
IEEE/ACM Trans Comput Biol Bioinform; 2016; 13(3):565-70. PubMed ID: 27295640
[TBL] [Abstract][Full Text] [Related]
10. Hybridization in nonbinary trees.
Linz S; Semple C
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):30-45. PubMed ID: 19179697
[TBL] [Abstract][Full Text] [Related]
11. Efficient reconstruction of phylogenetic networks with constrained recombination.
Gusfield D; Eddhu S; Langley C
Proc IEEE Comput Soc Bioinform Conf; 2003; 2():363-74. PubMed ID: 16452812
[TBL] [Abstract][Full Text] [Related]
12. Algorithm for haplotype inference via galled-tree networks with simple galls.
Gupta A; Maňuch J; Stacho L; Zhao X
J Comput Biol; 2012 Apr; 19(4):439-54. PubMed ID: 22468709
[TBL] [Abstract][Full Text] [Related]
13. Metrics on multilabeled trees: interrelationships and diameter bounds.
Huber KT; Spillner A; Suchecki R; Moulton V
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1029-40. PubMed ID: 21116046
[TBL] [Abstract][Full Text] [Related]
14. An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees.
Jansson J; Rajaby R; Sung WK
J Comput Biol; 2019 Sep; 26(9):893-907. PubMed ID: 30990336
[No Abstract] [Full Text] [Related]
15. Coalescent Histories for Lodgepole Species Trees.
Disanto F; Rosenberg NA
J Comput Biol; 2015 Oct; 22(10):918-29. PubMed ID: 25973633
[TBL] [Abstract][Full Text] [Related]
16. Phylogenetic networks: modeling, reconstructibility, and accuracy.
Moret BM; Nakhleh L; Warnow T; Linder CR; Tholse A; Padolina A; Sun J; Timme R
IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(1):13-23. PubMed ID: 17048405
[TBL] [Abstract][Full Text] [Related]
17. Nonbinary Tree-Based Phylogenetic Networks.
Jetten L; van Iersel L
IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(1):205-217. PubMed ID: 27723601
[TBL] [Abstract][Full Text] [Related]
18. Fast recovery of evolutionary trees with thousands of nodes.
Csurös M
J Comput Biol; 2002; 9(2):277-97. PubMed ID: 12015882
[TBL] [Abstract][Full Text] [Related]
19. Comparison of tree-child phylogenetic networks.
Cardona G; Rosselló F; Valiente G
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):552-69. PubMed ID: 19875855
[TBL] [Abstract][Full Text] [Related]
20. Constructing splits graphs.
Dress AW; Huson DH
IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(3):109-15. PubMed ID: 17048386
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
