163 related articles for article (PubMed ID: 34348661)
1. Maximum parsimony reconciliation in the DTLOR model.
Liu J; Mawhorter R; Liu N; Santichaivekin S; Bush E; Libeskind-Hadas R
BMC Bioinformatics; 2021 Aug; 22(Suppl 10):394. PubMed ID: 34348661
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. ecceTERA: comprehensive gene tree-species tree reconciliation using parsimony.
Jacox E; Chauve C; Szöllősi GJ; Ponty Y; Scornavacca C
Bioinformatics; 2016 Jul; 32(13):2056-8. PubMed ID: 27153713
[TBL] [Abstract][Full Text] [Related]
4. Reconciliation Reconsidered: In Search of a Most Representative Reconciliation in the Duplication-Transfer-Loss Model.
Grueter M; Duran K; Ramalingam R; Libeskind-Hadas R
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2136-2143. PubMed ID: 31722482
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. On the Complexity of Duplication-Transfer-Loss Reconciliation with Non-Binary Gene Trees.
Kordi M; Bansal MS
IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(3):587-599. PubMed ID: 28055898
[TBL] [Abstract][Full Text] [Related]
7. Efficient algorithms for the reconciliation problem with gene duplication, horizontal transfer and loss.
Bansal MS; Alm EJ; Kellis M
Bioinformatics; 2012 Jun; 28(12):i283-91. PubMed ID: 22689773
[TBL] [Abstract][Full Text] [Related]
8. Deciphering Microbial Gene Family Evolution Using Duplication-Transfer-Loss Reconciliation and RANGER-DTL.
Bansal MS
Methods Mol Biol; 2022; 2569():233-252. PubMed ID: 36083451
[TBL] [Abstract][Full Text] [Related]
9. Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence.
Chaudhary R; Burleigh JG; Eulenstein O
BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S11. PubMed ID: 22759416
[TBL] [Abstract][Full Text] [Related]
10. DTL reconciliation repair.
Ma W; Smirnov D; Libeskind-Hadas R
BMC Bioinformatics; 2017 Mar; 18(Suppl 3):76. PubMed ID: 28361686
[TBL] [Abstract][Full Text] [Related]
11. xenoGI 3: using the DTLOR model to reconstruct the evolution of gene families in clades of microbes.
Liu N; Gonzalez TA; Fischer J; Hong C; Johnson M; Mawhorter R; Mugnatto F; Soh R; Somji S; Wirth JS; Libeskind-Hadas R; Bush EC
BMC Bioinformatics; 2023 Jul; 24(1):295. PubMed ID: 37480009
[TBL] [Abstract][Full Text] [Related]
12. Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models.
Bansal MS; Burleigh JG; Eulenstein O
BMC Bioinformatics; 2010 Jan; 11 Suppl 1(Suppl 1):S42. PubMed ID: 20122216
[TBL] [Abstract][Full Text] [Related]
13. GATC: a genetic algorithm for gene tree construction under the Duplication-Transfer-Loss model of evolution.
Noutahi E; El-Mabrouk N
BMC Genomics; 2018 May; 19(Suppl 2):102. PubMed ID: 29764363
[TBL] [Abstract][Full Text] [Related]
14. Computing the Diameter of the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model.
Haack J; Zupke E; Ramirez A; Wu YC; Libeskind-Hadas R
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):14-22. PubMed ID: 29994484
[TBL] [Abstract][Full Text] [Related]
15. An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model.
Santichaivekin S; Mawhorter R; Libeskind-Hadas R
BMC Bioinformatics; 2019 Dec; 20(Suppl 20):636. PubMed ID: 31842734
[TBL] [Abstract][Full Text] [Related]
16. Inference of Ancient Whole-Genome Duplications and the Evolution of Gene Duplication and Loss Rates.
Zwaenepoel A; Van de Peer Y
Mol Biol Evol; 2019 Jul; 36(7):1384-1404. PubMed ID: 31004147
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. Fast algorithm for the reconciliation of gene trees and LGT networks.
Scornavacca C; Mayol JCP; Cardona G
J Theor Biol; 2017 Apr; 418():129-137. PubMed ID: 28111320
[TBL] [Abstract][Full Text] [Related]
19. Reconciliation with non-binary species trees.
Vernot B; Stolzer M; Goldman A; Durand D
J Comput Biol; 2008 Oct; 15(8):981-1006. PubMed ID: 18808330
[TBL] [Abstract][Full Text] [Related]
20. iGTP: a software package for large-scale gene tree parsimony analysis.
Chaudhary R; Bansal MS; Wehe A; Fernández-Baca D; Eulenstein O
BMC Bioinformatics; 2010 Nov; 11():574. PubMed ID: 21092314
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
