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 *

121 related articles for article (PubMed ID: 23033843)

  • 1. A scalable method for identifying frequent subtrees in sets of large phylogenetic trees.
    Ramu A; Kahveci T; Burleigh JG
    BMC Bioinformatics; 2012 Oct; 13():256. PubMed ID: 23033843
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Enumerating all maximal frequent subtrees in collections of phylogenetic trees.
    Deepak A; Fernández-Baca D
    Algorithms Mol Biol; 2014; 9():16. PubMed ID: 25061474
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A Faster Algorithm for Computing the Kernel of Maximum Agreement Subtrees.
    Wang BF; Swenson KM
    IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(2):416-430. PubMed ID: 31217125
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Stability analysis of phylogenetic trees.
    Sheikh SI; Kahveci T; Ranka S; Gordon Burleigh J
    Bioinformatics; 2013 Jan; 29(2):166-74. PubMed ID: 23162082
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Performance of flip supertree construction with a heuristic algorithm.
    Eulenstein O; Chen D; Burleigh JG; Fernández-Baca D; Sanderson MJ
    Syst Biol; 2004 Apr; 53(2):299-308. PubMed ID: 15205054
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. Improved parameterized complexity of the maximum agreement subtree and maximum compatible tree problems.
    Berry V; Nicolas F
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(3):289-302. PubMed ID: 17048466
    [TBL] [Abstract][Full Text] [Related]  

  • 9. SuperFine: fast and accurate supertree estimation.
    Swenson MS; Suri R; Linder CR; Warnow T
    Syst Biol; 2012 Mar; 61(2):214-27. PubMed ID: 21934137
    [TBL] [Abstract][Full Text] [Related]  

  • 10. The Kernel of Maximum Agreement Subtrees.
    Swenson KM; Chen E; Pattengale ND; Sankoff D
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(4):1023-31. PubMed ID: 22231622
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Characterizing the phylogenetic tree-search problem.
    Money D; Whelan S
    Syst Biol; 2012 Mar; 61(2):228-39. PubMed ID: 22076302
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Summarizing a posterior distribution of trees using agreement subtrees.
    Cranston KA; Rannala B
    Syst Biol; 2007 Aug; 56(4):578-90. PubMed ID: 17654363
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Towards improving searches for optimal phylogenies.
    Ford E; St John K; Wheeler WC
    Syst Biol; 2015 Jan; 64(1):56-65. PubMed ID: 25164916
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Calculation, visualization, and manipulation of MASTs (Maximum Agreement Subtrees).
    Dong S; Kraemer E
    Proc IEEE Comput Syst Bioinform Conf; 2004; ():405-14. PubMed ID: 16448033
    [TBL] [Abstract][Full Text] [Related]  

  • 15. SATe-II: very fast and accurate simultaneous estimation of multiple sequence alignments and phylogenetic trees.
    Liu K; Warnow TJ; Holder MT; Nelesen SM; Yu J; Stamatakis AP; Linder CR
    Syst Biol; 2012 Jan; 61(1):90-106. PubMed ID: 22139466
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Amalgamating source trees with different taxonomic levels.
    Berry V; Bininda-Emonds OR; Semple C
    Syst Biol; 2013 Mar; 62(2):231-49. PubMed ID: 23179602
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle.
    Desper R; Gascuel O
    J Comput Biol; 2002; 9(5):687-705. PubMed ID: 12487758
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Reconstructing (super)trees from data sets with missing distances: not all is lost.
    Kettleborough G; Dicks J; Roberts IN; Huber KT
    Mol Biol Evol; 2015 Jun; 32(6):1628-42. PubMed ID: 25657329
    [TBL] [Abstract][Full Text] [Related]  

  • 19. NJML: a hybrid algorithm for the neighbor-joining and maximum-likelihood methods.
    Ota S; Li WH
    Mol Biol Evol; 2000 Sep; 17(9):1401-9. PubMed ID: 10958856
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Pruning rogue taxa improves phylogenetic accuracy: an efficient algorithm and webservice.
    Aberer AJ; Krompass D; Stamatakis A
    Syst Biol; 2013 Jan; 62(1):162-6. PubMed ID: 22962004
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.