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 *

237 related articles for article (PubMed ID: 16568542)

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

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

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

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

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

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

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

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

  • 9. Drawing rooted phylogenetic networks.
    Huson DH
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(1):103-9. PubMed ID: 19179703
    [TBL] [Abstract][Full Text] [Related]  

  • 10. On the elusiveness of clusters.
    Kelk SM; Scornavacca C; van Iersel L
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):517-34. PubMed ID: 21968961
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Finding a most parsimonious or likely tree in a network with respect to an alignment.
    Kelk S; Pardi F; Scornavacca C; van Iersel L
    J Math Biol; 2019 Jan; 78(1-2):527-547. PubMed ID: 30121824
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 15. A practical algorithm for reconstructing level-1 phylogenetic networks.
    Huber KT; van Iersel L; Kelk S; Suchecki R
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(3):635-49. PubMed ID: 21393651
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Do Branch Lengths Help to Locate a Tree in a Phylogenetic Network?
    Gambette P; van Iersel L; Kelk S; Pardi F; Scornavacca C
    Bull Math Biol; 2016 Sep; 78(9):1773-1795. PubMed ID: 27659024
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Reconstruction of certain phylogenetic networks from their tree-average distances.
    Willson SJ
    Bull Math Biol; 2013 Oct; 75(10):1840-78. PubMed ID: 23864219
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

    [Next]    [New Search]
    of 12.