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 *

200 related articles for article (PubMed ID: 28650824)

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

  • 22. Minimizing the deep coalescence cost.
    Dąbkowski D; Tabaszewski P; Górecki P
    J Bioinform Comput Biol; 2018 Oct; 16(5):1840021. PubMed ID: 30419782
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Autumn Algorithm-Computation of Hybridization Networks for Realistic Phylogenetic Trees.
    Huson DH; Linz S
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):398-410. PubMed ID: 26955052
    [TBL] [Abstract][Full Text] [Related]  

  • 24. SIESTA: enhancing searches for optimal supertrees and species trees.
    Vachaspati P; Warnow T
    BMC Genomics; 2018 May; 19(Suppl 5):252. PubMed ID: 29745851
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Genetic algorithm for large-scale maximum parsimony phylogenetic analysis of proteins.
    Hill T; Lundgren A; Fredriksson R; Schiöth HB
    Biochim Biophys Acta; 2005 Aug; 1725(1):19-29. PubMed ID: 15990235
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Reconstruction of ancestral genomic sequences using likelihood.
    Elias I; Tuller T
    J Comput Biol; 2007 Mar; 14(2):216-37. PubMed ID: 17456016
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Inferring phylogenetic relationships avoiding forbidden rooted triplets.
    He YJ; Huynh TN; Jansson J; Sung WK
    J Bioinform Comput Biol; 2006 Feb; 4(1):59-74. PubMed ID: 16568542
    [TBL] [Abstract][Full Text] [Related]  

  • 28. On the fixed parameter tractability of agreement-based phylogenetic distances.
    Bordewich M; Scornavacca C; Tokac N; Weller M
    J Math Biol; 2017 Jan; 74(1-2):239-257. PubMed ID: 27221239
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Computing nearest neighbour interchange distances between ranked phylogenetic trees.
    Collienne L; Gavryushkin A
    J Math Biol; 2021 Jan; 82(1-2):8. PubMed ID: 33492606
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem.
    Viana GV; Gomes FA; Ferreira CE; Meneses CN
    Int J Bioinform Res Appl; 2009; 5(2):163-77. PubMed ID: 19324602
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Consensus properties for the deep coalescence problem and their application for scalable tree search.
    Lin HT; Burleigh JG; Eulenstein O
    BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S12. PubMed ID: 22759417
    [TBL] [Abstract][Full Text] [Related]  

  • 32. imPhy: Imputing Phylogenetic Trees with Missing Information Using Mathematical Programming.
    Yasui N; Vogiatzis C; Yoshida R; Fukumizu K
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(4):1222-1230. PubMed ID: 30507538
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Refining phylogenetic trees given additional data: an algorithm based on parsimony.
    Wu T; Moulton V; Steel M
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):118-25. PubMed ID: 19179705
    [TBL] [Abstract][Full Text] [Related]  

  • 34. The metapopulation genetic algorithm: An efficient solution for the problem of large phylogeny estimation.
    Lemmon AR; Milinkovitch MC
    Proc Natl Acad Sci U S A; 2002 Aug; 99(16):10516-21. PubMed ID: 12142465
    [TBL] [Abstract][Full Text] [Related]  

  • 35. An ILP solution for the gene duplication problem.
    Chang WC; Burleigh GJ; Fernández-Baca DF; Eulenstein O
    BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S14. PubMed ID: 21342543
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Computing a smallest multilabeled phylogenetic tree from rooted triplets.
    Guillemot S; Jansson J; Sung WK
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1141-7. PubMed ID: 20733243
    [TBL] [Abstract][Full Text] [Related]  

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

  • 38. Merging Partially Labelled Trees: Hardness and a Declarative Programming Solution.
    Labarre A; Verwer S
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(2):389-97. PubMed ID: 26355785
    [TBL] [Abstract][Full Text] [Related]  

  • 39. On the quality of tree-based protein classification.
    Lazareva-Ulitsky B; Diemer K; Thomas PD
    Bioinformatics; 2005 May; 21(9):1876-90. PubMed ID: 15647305
    [TBL] [Abstract][Full Text] [Related]  

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

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