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 *

115 related articles for article (PubMed ID: 33850946)

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

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

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

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

  • 5. Using max cut to enhance rooted trees consistency.
    Snir S; Rao S
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(4):323-33. PubMed ID: 17085842
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Do triplets have enough information to construct the multi-labeled phylogenetic tree?
    Hassanzadeh R; Eslahchi C; Sung WK
    PLoS One; 2014; 9(7):e103622. PubMed ID: 25080217
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. Determining the Consistency of Resolved Triplets and Fan Triplets.
    Jansson J; Lingas A; Rajaby R; Sung WK
    J Comput Biol; 2018 Jul; 25(7):740-754. PubMed ID: 29451395
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 11. Quartets MaxCut: a divide and conquer quartets algorithm.
    Snir S; Rao S
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):704-18. PubMed ID: 21030737
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Trinets encode tree-child and level-2 phylogenetic networks.
    van Iersel L; Moulton V
    J Math Biol; 2014 Jun; 68(7):1707-29. PubMed ID: 23680992
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Analysis of a Rapid Evolutionary Radiation Using Ultraconserved Elements: Evidence for a Bias in Some Multispecies Coalescent Methods.
    Meiklejohn KA; Faircloth BC; Glenn TC; Kimball RT; Braun EL
    Syst Biol; 2016 Jul; 65(4):612-27. PubMed ID: 26865273
    [TBL] [Abstract][Full Text] [Related]  

  • 14. On Sackin's original proposal: the variance of the leaves' depths as a phylogenetic balance index.
    M Coronado T; Mir A; Rosselló F; Rotger L
    BMC Bioinformatics; 2020 Apr; 21(1):154. PubMed ID: 32326884
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
    Baste J; Paul C; Sau I; Scornavacca C
    Bull Math Biol; 2017 Apr; 79(4):920-938. PubMed ID: 28247121
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Uniqueness, intractability and exact algorithms: reflections on level-k phylogenetic networks.
    Van Iersel L; Kelk S; Mnich M
    J Bioinform Comput Biol; 2009 Aug; 7(4):597-623. PubMed ID: 19634194
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Applicability of several rooted phylogenetic network algorithms for representing the evolutionary history of SARS-CoV-2.
    Wallin R; van Iersel L; Kelk S; Stougie L
    BMC Ecol Evol; 2021 Dec; 21(1):220. PubMed ID: 34876022
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Fixed-parameter tractability of the maximum agreement supertree problem.
    Guillemot S; Berry V
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):342-53. PubMed ID: 20431153
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance.
    Kannan L; Li H; Mushegian A
    J Comput Biol; 2011 May; 18(5):743-57. PubMed ID: 21166560
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees.
    Jansson J; Rajaby R; Sung WK
    J Comput Biol; 2019 Sep; 26(9):893-907. PubMed ID: 30990336
    [No Abstract]   [Full Text] [Related]  

    [Next]    [New Search]
    of 6.