138 related articles for article (PubMed ID: 30956378)
1. On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems.
van Iersel L; Kelk S; Stamoulis G; Stougie L; Boes O
Algorithmica; 2018; 80(11):2993-3022. PubMed ID: 30956378
[TBL] [Abstract][Full Text] [Related]
2. SPR distance computation for unrooted trees.
Hickey G; Dehne F; Rau-Chaplin A; Blouin C
Evol Bioinform Online; 2008 Feb; 4():17-27. PubMed ID: 19204804
[TBL] [Abstract][Full Text] [Related]
3. Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network.
Shi F; Li H; Rong G; Zhang Z; Wang J
IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(6):3539-3552. PubMed ID: 34506290
[TBL] [Abstract][Full Text] [Related]
4. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
Baste J; Paul C; Sau I; Scornavacca C
Bull Math Biol; 2017 Apr; 79(4):920-938. PubMed ID: 28247121
[TBL] [Abstract][Full Text] [Related]
5. On the fixed parameter tractability of agreement-based phylogenetic distances.
Bordewich M; Scornavacca C; Tokac N; Weller M
J Math Biol; 2017 Jan; 74(1-2):239-257. PubMed ID: 27221239
[TBL] [Abstract][Full Text] [Related]
6. Inferring rooted species trees from unrooted gene trees using approximate Bayesian computation.
Alanzi ARA; Degnan JH
Mol Phylogenet Evol; 2017 Nov; 116():13-24. PubMed ID: 28780022
[TBL] [Abstract][Full Text] [Related]
7. Genomic duplication problems for unrooted gene trees.
Paszek J; Górecki P
BMC Genomics; 2016 Jan; 17 Suppl 1(Suppl 1):15. PubMed ID: 26818591
[TBL] [Abstract][Full Text] [Related]
8. Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable.
Bordewich M; Semple C
IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(3):458-466. PubMed ID: 17666765
[TBL] [Abstract][Full Text] [Related]
9. Exact median-tree inference for unrooted reconciliation costs.
Górecki P; Markin A; Eulenstein O
BMC Evol Biol; 2020 Oct; 20(Suppl 1):136. PubMed ID: 33115401
[TBL] [Abstract][Full Text] [Related]
10. On cherry and pitchfork distributions of random rooted and unrooted phylogenetic trees.
Choi KP; Thompson A; Wu T
Theor Popul Biol; 2020 Apr; 132():92-104. PubMed ID: 32135170
[TBL] [Abstract][Full Text] [Related]
11. Tree-based unrooted nonbinary phylogenetic networks.
Hendriksen M
Math Biosci; 2018 Aug; 302():131-138. PubMed ID: 29932953
[TBL] [Abstract][Full Text] [Related]
12. Identifying the rooted species tree from the distribution of unrooted gene trees under the coalescent.
Allman ES; Degnan JH; Rhodes JA
J Math Biol; 2011 Jun; 62(6):833-62. PubMed ID: 20652704
[TBL] [Abstract][Full Text] [Related]
13. A strict upper bound for the partition distance and the cluster distance of phylogenetic trees for each fixed pair of topological trees.
Middendorf M; Wieseke N
PLoS One; 2018; 13(9):e0204907. PubMed ID: 30265723
[TBL] [Abstract][Full Text] [Related]
14. Inferring Optimal Species Trees in the Presence of Gene Duplication and Loss: Beyond Rooted Gene Trees.
Bayzid MS
J Comput Biol; 2023 Feb; 30(2):161-175. PubMed ID: 36251762
[TBL] [Abstract][Full Text] [Related]
15. Reconstructing Unrooted Phylogenetic Trees from Symbolic Ternary Metrics.
Grünewald S; Long Y; Wu Y
Bull Math Biol; 2018 Jun; 80(6):1563-1577. PubMed ID: 29524097
[TBL] [Abstract][Full Text] [Related]
16. Finding a most parsimonious or likely tree in a network with respect to an alignment.
Kelk S; Pardi F; Scornavacca C; van Iersel L
J Math Biol; 2019 Jan; 78(1-2):527-547. PubMed ID: 30121824
[TBL] [Abstract][Full Text] [Related]
17. Leaping through Tree Space: Continuous Phylogenetic Inference for Rooted and Unrooted Trees.
Penn MJ; Scheidwasser N; Penn J; Donnelly CA; Duchêne DA; Bhatt S
Genome Biol Evol; 2023 Dec; 15(12):. PubMed ID: 38085949
[TBL] [Abstract][Full Text] [Related]
18. Quantifying hybridization in realistic time.
Collins J; Linz S; Semple C
J Comput Biol; 2011 Oct; 18(10):1305-18. PubMed ID: 21210735
[TBL] [Abstract][Full Text] [Related]
19. Autumn Algorithm-Computation of Hybridization Networks for Realistic Phylogenetic Trees.
Huson DH; Linz S
IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):398-410. PubMed ID: 26955052
[TBL] [Abstract][Full Text] [Related]
20. An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees.
Wu Y
J Comput Biol; 2013 Oct; 20(10):792-804. PubMed ID: 24093230
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
