BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

160 related articles for article (PubMed ID: 31911141)

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

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

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

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

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

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

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

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

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

  • 11. BIMLR: a method for constructing rooted phylogenetic networks from rooted phylogenetic trees.
    Wang J; Guo M; Xing L; Che K; Liu X; Wang C
    Gene; 2013 Sep; 527(1):344-51. PubMed ID: 23816409
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Constructing level-2 phylogenetic networks from triplets.
    van Iersel L; Keijsper J; Kelk S; Stougie L; Hagen F; Boekhout T
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):667-81. PubMed ID: 19875864
    [TBL] [Abstract][Full Text] [Related]  

  • 13. LNETWORK: an efficient and effective method for constructing phylogenetic networks.
    Wang J; Guo M; Liu X; Liu Y; Wang C; Xing L; Che K
    Bioinformatics; 2013 Sep; 29(18):2269-76. PubMed ID: 23811095
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable.
    Bordewich M; Semple C
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(3):458-466. PubMed ID: 17666765
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Exploring the Tiers of Rooted Phylogenetic Network Space Using Tail Moves.
    Janssen R; Jones M; Erdős PL; van Iersel L; Scornavacca C
    Bull Math Biol; 2018 Aug; 80(8):2177-2208. PubMed ID: 29948885
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks.
    Bordewich M; Linz S; Semple C
    J Theor Biol; 2017 Jun; 423():1-12. PubMed ID: 28414085
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network.
    Shi F; Li H; Rong G; Zhang Z; Wang J
    IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(6):3539-3552. PubMed ID: 34506290
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 8.