BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

137 related articles for article (PubMed ID: 31842734)

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

  • 2. Hierarchical clustering of maximum parsimony reconciliations.
    Mawhorter R; Libeskind-Hadas R
    BMC Bioinformatics; 2019 Nov; 20(1):612. PubMed ID: 31775628
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 5. Reconciliation revisited: handling multiple optima when reconciling with duplication, transfer, and loss.
    Bansal MS; Alm EJ; Kellis M
    J Comput Biol; 2013 Oct; 20(10):738-54. PubMed ID: 24033262
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 8. An efficient method for exploring the space of gene tree/species tree reconciliations in a probabilistic framework.
    Doyon JP; Hamel S; Chauve C
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(1):26-39. PubMed ID: 21464510
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 11. Structural properties of the reconciliation space and their applications in enumerating nearly-optimal reconciliations between a gene tree and a species tree.
    Wu T; Zhang L
    BMC Bioinformatics; 2011 Oct; 12 Suppl 9(Suppl 9):S7. PubMed ID: 22151151
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Exploring the space of gene/species reconciliations with transfers.
    Chan YB; Ranwez V; Scornavacca C
    J Math Biol; 2015 Nov; 71(5):1179-209. PubMed ID: 25502987
    [TBL] [Abstract][Full Text] [Related]  

  • 13. DTL-RnB: Algorithms and Tools for Summarizing the Space of DTL Reconciliations.
    Ma W; Smirnov D; Forman J; Schweickart A; Slocum C; Srinivasan S; Libeskind-Hadas R
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):411-421. PubMed ID: 26955051
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 17. Inferring incomplete lineage sorting, duplications, transfers and losses with reconciliations.
    Chan YB; Ranwez V; Scornavacca C
    J Theor Biol; 2017 Nov; 432():1-13. PubMed ID: 28801222
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Pareto-optimal phylogenetic tree reconciliation.
    Libeskind-Hadas R; Wu YC; Bansal MS; Kellis M
    Bioinformatics; 2014 Jun; 30(12):i87-95. PubMed ID: 24932009
    [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. Representing a set of reconciliations in a compact way.
    Scornavacca C; Paprotny W; Berry V; Ranwez V
    J Bioinform Comput Biol; 2013 Apr; 11(2):1250025. PubMed ID: 23600816
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.