152 related articles for article (PubMed ID: 23929875)
1. Unrooted tree reconciliation: a unified approach.
Górecki P; Eulenstein O; Tiuryn J
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(2):522-36. PubMed ID: 23929875
[TBL] [Abstract][Full Text] [Related]
2. On the impact of uncertain gene tree rooting on duplication-transfer-loss reconciliation.
Kundu S; Bansal MS
BMC Bioinformatics; 2018 Aug; 19(Suppl 9):290. PubMed ID: 30367593
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. Inferring phylogeny from whole genomes.
Górecki P; Tiuryn J
Bioinformatics; 2007 Jan; 23(2):e116-22. PubMed ID: 17237078
[TBL] [Abstract][Full Text] [Related]
5. Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem.
Górecki P; Eulenstein O
BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S14. PubMed ID: 22759419
[TBL] [Abstract][Full Text] [Related]
6. Inferring duplication episodes from unrooted gene trees.
Paszek J; Górecki P
BMC Genomics; 2018 May; 19(Suppl 5):288. PubMed ID: 29745844
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. Refining discordant gene trees.
Górecki P; Eulenstein O
BMC Bioinformatics; 2014; 15 Suppl 13(Suppl 13):S3. PubMed ID: 25434729
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. Species Tree Estimation from Genome-Wide Data with guenomu.
de Oliveira Martins L; Posada D
Methods Mol Biol; 2017; 1525():461-478. PubMed ID: 27896732
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. 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]
13. Synthesizing large-scale species trees using the strict consensus approach.
Moon J; Eulenstein O
J Bioinform Comput Biol; 2017 Jun; 15(3):1740002. PubMed ID: 28513253
[TBL] [Abstract][Full Text] [Related]
14. Anomalous unrooted gene trees.
Degnan JH
Syst Biol; 2013 Jul; 62(4):574-90. PubMed ID: 23576318
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. 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]
17. URec: a system for unrooted reconciliation.
Górecki P; Tiuryn J
Bioinformatics; 2007 Feb; 23(4):511-2. PubMed ID: 17182699
[TBL] [Abstract][Full Text] [Related]
18. Exact Algorithms for Duplication-Transfer-Loss Reconciliation with Non-Binary Gene Trees.
Kordi M; Bansal MS
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1077-1090. PubMed ID: 28622673
[TBL] [Abstract][Full Text] [Related]
19. Assessing the accuracy of phylogenetic rooting methods on prokaryotic gene families.
Wade T; Rangel LT; Kundu S; Fournier GP; Bansal MS
PLoS One; 2020; 15(5):e0232950. PubMed ID: 32413061
[TBL] [Abstract][Full Text] [Related]
20. The Unconstrained Diameters of the Duplication-Loss Cost and the Loss Cost.
Gorecki P; Eulenstein O; Tiuryn J
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2125-2135. PubMed ID: 31150345
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
