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 *

365 related articles for article (PubMed ID: 26451911)

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

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

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

  • 4. Reconstructing protein and gene phylogenies using reconciliation and soft-clustering.
    Kuitche E; Lafond M; Ouangraoua A
    J Bioinform Comput Biol; 2017 Dec; 15(6):1740007. PubMed ID: 29169277
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 7. Split-based computation of majority-rule supertrees.
    Kupczok A
    BMC Evol Biol; 2011 Jul; 11():205. PubMed ID: 21752249
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. COSPEDTree: COuplet Supertree by Equivalence Partitioning of Taxa Set and DAG Formation.
    Bhattacharyya S; Mukherjee J
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(3):590-603. PubMed ID: 26357270
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Minimum-flip supertrees: complexity and algorithms.
    Chen D; Eulenstein O; Fernandez-Baca D; Sanderson M
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(2):165-73. PubMed ID: 17048402
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Exact median-tree inference for unrooted reconciliation costs.
    Górecki P; Markin A; Eulenstein O
    BMC Evol Biol; 2020 Oct; 20(Suppl 1):136. PubMed ID: 33115401
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Efficient algorithms for knowledge-enhanced supertree and supermatrix phylogenetic problems.
    Wehe A; Burleigh JG; Eulenstein O
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1432-41. PubMed ID: 24407302
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Triplet supertree heuristics for the tree of life.
    Lin HT; Burleigh JG; Eulenstein O
    BMC Bioinformatics; 2009 Jan; 10 Suppl 1(Suppl 1):S8. PubMed ID: 19208181
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Bad Clade Deletion Supertrees: A Fast and Accurate Supertree Algorithm.
    Fleischauer M; Böcker S
    Mol Biol Evol; 2017 Sep; 34(9):2408-2421. PubMed ID: 28873954
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Exact solutions for species tree inference from discordant gene trees.
    Chang WC; Górecki P; Eulenstein O
    J Bioinform Comput Biol; 2013 Oct; 11(5):1342005. PubMed ID: 24131054
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Efficient Local Search for Euclidean Path-Difference Median Trees.
    Markin A; Eulenstein O
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1374-1385. PubMed ID: 29035224
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Robustness of topological supertree methods for reconciling dense incompatible data.
    Willson SJ
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):62-75. PubMed ID: 19179699
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Fast local search for unrooted Robinson-Foulds supertrees.
    Chaudhary R; Burleigh JG; Fernández-Baca D
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1004-13. PubMed ID: 22431553
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 19.