BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

109 related articles for article (PubMed ID: 33038778)

  • 1. Minimizing genomic duplication episodes.
    Paszek J; Tiuryn J; Górecki P
    Comput Biol Chem; 2020 Dec; 89():107260. PubMed ID: 33038778
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 4. Efficient Algorithms for Genomic Duplication Models.
    Paszek J; Gorecki P
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(5):1515-1524. PubMed ID: 28541223
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Linear-time algorithms for the multiple gene duplication problems.
    Luo CW; Chen MC; Chen YC; Yang RW; Liu HF; Chao KM
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(1):260-5. PubMed ID: 21071814
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 11. A Note on the Fixed Parameter Tractability of the Gene-Duplication Problem.
    Bansal MS; Shamir R
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(3):848-50. PubMed ID: 20733245
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Gene family evolution by duplication, speciation, and loss.
    Chauve C; Doyon JP; El-Mabrouk N
    J Comput Biol; 2008 Oct; 15(8):1043-62. PubMed ID: 18781833
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Locating large-scale gene duplication events through reconciled trees: implications for identifying ancient polyploidy events in plants.
    Burleigh JG; Bansal MS; Wehe A; Eulenstein O
    J Comput Biol; 2009 Aug; 16(8):1071-83. PubMed ID: 19689214
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Consensus properties and their large-scale applications for the gene duplication problem.
    Moon J; Lin HT; Eulenstein O
    J Bioinform Comput Biol; 2016 Jun; 14(3):1642005. PubMed ID: 27122201
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Reconstructing a SuperGeneTree minimizing reconciliation.
    Lafond M; Ouangraoua A; El-Mabrouk N
    BMC Bioinformatics; 2015; 16 Suppl 14(Suppl 14):S4. PubMed ID: 26451911
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 18. Cubic time algorithms of amalgamating gene trees and building evolutionary scenarios.
    Lyubetsky VA; Rubanov LI; Rusin LY; Gorbunov KY
    Biol Direct; 2012 Dec; 7():48. PubMed ID: 23259766
    [TBL] [Abstract][Full Text] [Related]  

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

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