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.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

244 related articles for article (PubMed ID: 30767052)

  • 21. Inferring duplications, losses, transfers and incomplete lineage sorting with nonbinary species trees.
    Stolzer M; Lai H; Xu M; Sathaye D; Vernot B; Durand D
    Bioinformatics; 2012 Sep; 28(18):i409-i415. PubMed ID: 22962460
    [TBL] [Abstract][Full Text] [Related]  

  • 22. 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]  

  • 23. 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]  

  • 24. Space of gene/species trees reconciliations and parsimonious models.
    Doyon JP; Chauve C; Hamel S
    J Comput Biol; 2009 Oct; 16(10):1399-418. PubMed ID: 19754270
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Models, algorithms and programs for phylogeny reconciliation.
    Doyon JP; Ranwez V; Daubin V; Berry V
    Brief Bioinform; 2011 Sep; 12(5):392-400. PubMed ID: 21949266
    [TBL] [Abstract][Full Text] [Related]  

  • 26. From gene trees to species trees II: species tree inference by minimizing deep coalescence events.
    Zhang L
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(6):1685-91. PubMed ID: 21576759
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Maximum likelihood models and algorithms for gene tree evolution with duplications and losses.
    Górecki P; Burleigh GJ; Eulenstein O
    BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S15. PubMed ID: 21342544
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Gene tree and species tree reconciliation with endosymbiotic gene transfer.
    Anselmetti Y; El-Mabrouk N; Lafond M; Ouangraoua A
    Bioinformatics; 2021 Jul; 37(Suppl_1):i120-i132. PubMed ID: 34252921
    [TBL] [Abstract][Full Text] [Related]  

  • 29. 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]  

  • 30. 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]  

  • 31. Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model.
    Mawhorter R; Liu N; Libeskind-Hadas R; Wu YC
    BMC Bioinformatics; 2019 Dec; 20(Suppl 20):639. PubMed ID: 31842732
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Reconciliation feasibility in the presence of gene duplication, loss, and coalescence with multiple individuals per species.
    Rogers J; Fishberg A; Youngs N; Wu YC
    BMC Bioinformatics; 2017 Jun; 18(1):292. PubMed ID: 28583091
    [TBL] [Abstract][Full Text] [Related]  

  • 33. 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]  

  • 34. 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]  

  • 35. Reconciliation with non-binary species trees.
    Vernot B; Stolzer M; Goldman A; Durand D
    Comput Syst Bioinformatics Conf; 2007; 6():441-52. PubMed ID: 17951846
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model.
    Du H; Ong YS; Knittel M; Mawhorter R; Liu N; Gross G; Tojo R; Libeskind-Hadas R; Wu YC
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(6):2144-2156. PubMed ID: 31199267
    [TBL] [Abstract][Full Text] [Related]  

  • 37. A fast method for calculating reliable event supports in tree reconciliations via Pareto optimality.
    To TH; Jacox E; Ranwez V; Scornavacca C
    BMC Bioinformatics; 2015 Nov; 16():384. PubMed ID: 26573665
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Simultaneous identification of duplications, losses, and lateral gene transfers.
    Chen ZZ; Deng F; Wang L
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(5):1515-28. PubMed ID: 22641711
    [TBL] [Abstract][Full Text] [Related]  

  • 39. 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]  

  • 40. Reconciliation and local gene tree rearrangement can be of mutual profit.
    Nguyen TH; Ranwez V; Pointet S; Chifolleau AM; Doyon JP; Berry V
    Algorithms Mol Biol; 2013 Apr; 8(1):12. PubMed ID: 23566548
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 13.