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 *

139 related articles for article (PubMed ID: 25061474)

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

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

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

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

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

  • 6. A reconstruction problem for a class of phylogenetic networks with lateral gene transfers.
    Cardona G; Pons JC; Rosselló F
    Algorithms Mol Biol; 2015; 10():28. PubMed ID: 26691555
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. MASTtreedist: visualization of tree space based on maximum agreement subtree.
    Huang H; Li Y
    J Comput Biol; 2013 Jan; 20(1):42-9. PubMed ID: 23294272
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A congruence index for testing topological similarity between trees.
    de Vienne DM; Giraud T; Martin OC
    Bioinformatics; 2007 Dec; 23(23):3119-24. PubMed ID: 17933852
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Treehouse: a user-friendly application to obtain subtrees from large phylogenies.
    Steenwyk JL; Rokas A
    BMC Res Notes; 2019 Aug; 12(1):541. PubMed ID: 31455362
    [TBL] [Abstract][Full Text] [Related]  

  • 12. New techniques for mining frequent patterns in unordered trees.
    Zhang S; Du Z; Wang JT
    IEEE Trans Cybern; 2015 Jun; 45(6):1113-25. PubMed ID: 25137740
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Testing the agreement of trees with internal labels.
    Fernández-Baca D; Liu L
    Algorithms Mol Biol; 2021 Dec; 16(1):22. PubMed ID: 34863219
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Mining significant tree patterns in carbohydrate sugar chains.
    Hashimoto K; Takigawa I; Shiga M; Kanehisa M; Mamitsuka H
    Bioinformatics; 2008 Aug; 24(16):i167-73. PubMed ID: 18689820
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. GIGA: a simple, efficient algorithm for gene tree inference in the genomic age.
    Thomas PD
    BMC Bioinformatics; 2010 Jun; 11():312. PubMed ID: 20534164
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Gene Tree Construction and Correction Using SuperTree and Reconciliation.
    Lafond M; Chauve C; El-Mabrouk N; Ouangraoua A
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(5):1560-1570. PubMed ID: 28678712
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Aggregated Dendrograms for Visual Comparison between Many Phylogenetic Trees.
    Liu Z; Zhan SH; Munzner T
    IEEE Trans Vis Comput Graph; 2020 Sep; 26(9):2732-2747. PubMed ID: 30736000
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Comparing Phylogenetic Trees Side by Side Through iPhyloC, a New Interactive Web-Based Framework.
    Hammoud M; Santos CMD; Gois JP
    J Comput Biol; 2022 Mar; 29(3):292-303. PubMed ID: 35230147
    [TBL] [Abstract][Full Text] [Related]  

  • 20. All galls are divided into three or more parts: recursive enumeration of labeled histories for galled trees.
    Mathur S; Rosenberg NA
    Algorithms Mol Biol; 2023 Feb; 18(1):1. PubMed ID: 36782318
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.