These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
6. Co-divergence and tree topology. Calamoneri T; Monti A; Sinaimeri B J Math Biol; 2019 Aug; 79(3):1149-1167. PubMed ID: 31203388 [TBL] [Abstract][Full Text] [Related]
7. 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]
8. 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]
9. Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models. Chauve C; Ponty Y; Wallner M J Math Biol; 2020 Apr; 80(5):1353-1388. PubMed ID: 32060618 [TBL] [Abstract][Full Text] [Related]
11. Gene tree species tree reconciliation with gene conversion. Hasić D; Tannier E J Math Biol; 2019 May; 78(6):1981-2014. PubMed ID: 30767052 [TBL] [Abstract][Full Text] [Related]
12. 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]
13. Gene Tree Construction and Correction Using SuperTree and Reconciliation. Lafond M; Chauve C; El-Mabrouk N; Ouangraoua A IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(5):1560-1570. PubMed ID: 28678712 [TBL] [Abstract][Full Text] [Related]
14. 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]
15. Reconciling event-labeled gene trees with MUL-trees and species networks. Hellmuth M; Huber KT; Moulton V J Math Biol; 2019 Oct; 79(5):1885-1925. PubMed ID: 31410552 [TBL] [Abstract][Full Text] [Related]
16. 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]
17. Parameter Estimation and Species Tree Rooting Using ALE and GeneRax. Williams TA; Davín AA; Morel B; Szánthó LL; Spang A; Stamatakis A; Hugenholtz P; Szöllősi GJ Genome Biol Evol; 2023 Jul; 15(7):. PubMed ID: 37463417 [TBL] [Abstract][Full Text] [Related]
18. Isometric gene tree reconciliation revisited. Brejová B; Gafurov A; Pardubská D; Sabo M; Vinař T Algorithms Mol Biol; 2017; 12():17. PubMed ID: 28630644 [TBL] [Abstract][Full Text] [Related]
19. Reconciliation of gene and species trees. Rusin LY; Lyubetskaya EV; Gorbunov KY; Lyubetsky VA Biomed Res Int; 2014; 2014():642089. PubMed ID: 24800245 [TBL] [Abstract][Full Text] [Related]
20. 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] [Next] [New Search]