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 *

39 related articles for article (PubMed ID: 32947609)

  • 1. An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees.
    Wu Y
    J Comput Biol; 2013 Oct; 20(10):792-804. PubMed ID: 24093230
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Computing the Bounds of the Number of Reticulations in a Tree-Child Network That Displays a Set of Trees.
    Wu Y; Zhang L
    J Comput Biol; 2024 Apr; 31(4):345-359. PubMed ID: 38285528
    [No Abstract]   [Full Text] [Related]  

  • 3. SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees.
    Hill T; Nordström KJ; Thollesson M; Säfström TM; Vernersson AK; Fredriksson R; Schiöth HB
    BMC Evol Biol; 2010 Feb; 10():42. PubMed ID: 20152048
    [TBL] [Abstract][Full Text] [Related]  

  • 4. PSA: an effective method for predicting horizontal gene transfers through parsimonious phylogenetic networks.
    Zhang Y; Wang J; Yu J
    Cladistics; 2024 Aug; 40(4):443-455. PubMed ID: 38717786
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A heuristic method for solving the Steiner tree problem in graphs using network centralities.
    Fujita M; Shimada Y; Kimura T; Ikeguchi T
    PLoS One; 2024; 19(6):e0303764. PubMed ID: 38843249
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Exploring spaces of semi-directed level-1 networks.
    Linz S; Wicke K
    J Math Biol; 2023 Oct; 87(5):70. PubMed ID: 37831304
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Exactly computing the parsimony scores on phylogenetic networks using dynamic programming.
    Kannan L; Wheeler WC
    J Comput Biol; 2014 Apr; 21(4):303-19. PubMed ID: 24559134
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Constructing phylogenetic networks via cherry picking and machine learning.
    Bernardini G; van Iersel L; Julien E; Stougie L
    Algorithms Mol Biol; 2023 Sep; 18(1):13. PubMed ID: 37717003
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A Fixed-Parameter Tractable Algorithm for Finding Agreement Cherry-Reduced Subnetworks in Level-1 Orchard Networks.
    Landry K; Tremblay-Savard O; Lafond M
    J Comput Biol; 2024 Apr; 31(4):360-379. PubMed ID: 38117611
    [No Abstract]   [Full Text] [Related]  

  • 10. A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees.
    van Iersel L; Kelk S; Lekić N; Scornavacca C
    BMC Bioinformatics; 2014 May; 15():127. PubMed ID: 24884964
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Inferring Phylogenetic Networks from Multifurcating Trees via Cherry Picking and Machine Learning.
    Bernardini G; Iersel L; Julien E; Stougie L
    Mol Phylogenet Evol; 2024 Jul; ():108137. PubMed ID: 39029549
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Phylogenetic network classes through the lens of expanding covers.
    Francis A; Marchei D; Steel M
    J Math Biol; 2024 Apr; 88(5):58. PubMed ID: 38584237
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Counting Phylogenetic Networks with Few Reticulation Vertices: Galled and Reticulation-Visible Networks.
    Chang YS; Fuchs M
    Bull Math Biol; 2024 May; 86(7):76. PubMed ID: 38762579
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Coronavirus phylogeny based on triplets of nucleic acids bases.
    Liao B; Liu Y; Li R; Zhu W
    Chem Phys Lett; 2006 Apr; 421(4):313-318. PubMed ID: 32226086
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A Note on a Nonlinear Minimax Location Problem in Tree Networks.
    Francis RL
    J Res Natl Bur Stand (1977); 1977; 82(1):73-80. PubMed ID: 34565956
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Netcombin: An algorithm for constructing optimal phylogenetic network from rooted triplets.
    Poormohammadi H; Sardari Zarchi M
    PLoS One; 2020; 15(9):e0227842. PubMed ID: 32947609
    [TBL] [Abstract][Full Text] [Related]  

  • 17. NCHB: A method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization.
    Poormohammadi H; Zarchi MS; Ghaneai H
    J Theor Biol; 2020 Mar; 489():110144. PubMed ID: 31911141
    [TBL] [Abstract][Full Text] [Related]  

  • 18. TripNet: a method for constructing rooted phylogenetic networks from rooted triplets.
    Poormohammadi H; Eslahchi C; Tusserkani R
    PLoS One; 2014; 9(9):e106531. PubMed ID: 25208028
    [TBL] [Abstract][Full Text] [Related]  

  • 19. CBTH: A New Algorithm for Maximum Rooted Triplets Consistency Problem.
    Poor Mohammadi H; Sardari Zarchi M
    Iran J Biotechnol; 2020 Jul; 18(3):e2557. PubMed ID: 33850946
    [TBL] [Abstract][Full Text] [Related]  

  • 20.
    ; ; . PubMed ID:
    [No Abstract]   [Full Text] [Related]  

    [Next]    [New Search]
    of 2.