281 related articles for article (PubMed ID: 19179698)
41. Adapting simultaneous analysis phylogenomic techniques to study complex disease gene relationships.
Romano JD; Tharp WG; Sarkar IN
J Biomed Inform; 2015 Apr; 54():10-38. PubMed ID: 25592479
[TBL] [Abstract][Full Text] [Related]
42. A new efficient algorithm for inferring explicit hybridization networks following the Neighbor-Joining principle.
Willems M; Tahiri N; Makarenkov V
J Bioinform Comput Biol; 2014 Oct; 12(5):1450024. PubMed ID: 25219384
[TBL] [Abstract][Full Text] [Related]
43. Optimizing phylogenetic networks for circular split systems.
Phipps P; Bereg S
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):535-47. PubMed ID: 21788677
[TBL] [Abstract][Full Text] [Related]
44. Rearrangement moves on rooted phylogenetic networks.
Gambette P; van Iersel L; Jones M; Lafond M; Pardi F; Scornavacca C
PLoS Comput Biol; 2017 Aug; 13(8):e1005611. PubMed ID: 28763439
[TBL] [Abstract][Full Text] [Related]
45. Fast local search for unrooted Robinson-Foulds supertrees.
Chaudhary R; Burleigh JG; Fernández-Baca D
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1004-13. PubMed ID: 22431553
[TBL] [Abstract][Full Text] [Related]
46. Characterization of reticulate networks based on the coalescent with recombination.
Arenas M; Valiente G; Posada D
Mol Biol Evol; 2008 Dec; 25(12):2517-20. PubMed ID: 18927089
[TBL] [Abstract][Full Text] [Related]
47. Phylogenomic networks.
Dagan T
Trends Microbiol; 2011 Oct; 19(10):483-91. PubMed ID: 21820313
[TBL] [Abstract][Full Text] [Related]
48. Inferring phylogenetic networks by the maximum parsimony criterion: a case study.
Jin G; Nakhleh L; Snir S; Tuller T
Mol Biol Evol; 2007 Jan; 24(1):324-37. PubMed ID: 17068107
[TBL] [Abstract][Full Text] [Related]
49. Drawing rooted phylogenetic networks.
Huson DH
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):103-9. PubMed ID: 19179703
[TBL] [Abstract][Full Text] [Related]
50. Efficient algorithms for knowledge-enhanced supertree and supermatrix phylogenetic problems.
Wehe A; Burleigh JG; Eulenstein O
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1432-41. PubMed ID: 24407302
[TBL] [Abstract][Full Text] [Related]
51. Are the duplication cost and Robinson-Foulds distance equivalent?
Zheng Y; Zhang L
J Comput Biol; 2014 Aug; 21(8):578-90. PubMed ID: 24988427
[TBL] [Abstract][Full Text] [Related]
52. The net of life: reconstructing the microbial phylogenetic network.
Kunin V; Goldovsky L; Darzentas N; Ouzounis CA
Genome Res; 2005 Jul; 15(7):954-9. PubMed ID: 15965028
[TBL] [Abstract][Full Text] [Related]
53. 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]
54. On the elusiveness of clusters.
Kelk SM; Scornavacca C; van Iersel L
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):517-34. PubMed ID: 21968961
[TBL] [Abstract][Full Text] [Related]
55. Tree-Based Unrooted Phylogenetic Networks.
Francis A; Huber KT; Moulton V
Bull Math Biol; 2018 Feb; 80(2):404-416. PubMed ID: 29238909
[TBL] [Abstract][Full Text] [Related]
56. A Metric on the Space of kth-order reduced Phylogenetic Networks.
Wang J; Guo M
Sci Rep; 2017 Jun; 7(1):3189. PubMed ID: 28600511
[TBL] [Abstract][Full Text] [Related]
57. An exact algorithm for the geodesic distance between phylogenetic trees.
Kupczok A; von Haeseler A; Klaere S
J Comput Biol; 2008; 15(6):577-91. PubMed ID: 18631022
[TBL] [Abstract][Full Text] [Related]
58. Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution.
Francis A; Moulton V
J Theor Biol; 2018 Jun; 446():160-167. PubMed ID: 29548737
[TBL] [Abstract][Full Text] [Related]
59. 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]
60. A generalized Robinson-Foulds distance for labeled trees.
Briand S; Dessimoz C; El-Mabrouk N; Lafond M; Lobinska G
BMC Genomics; 2020 Nov; 21(Suppl 10):779. PubMed ID: 33208096
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
