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 *

220 related articles for article (PubMed ID: 25725643)

  • 1. Hierarchical clustering in minimum spanning trees.
    Yu M; Hillebrand A; Tewarie P; Meier J; van Dijk B; Van Mieghem P; Stam CJ
    Chaos; 2015 Feb; 25(2):023107. PubMed ID: 25725643
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Parallel clustering algorithm for large data sets with applications in bioinformatics.
    Olman V; Mao F; Wu H; Xu Y
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(2):344-52. PubMed ID: 19407357
    [TBL] [Abstract][Full Text] [Related]  

  • 3. The minimum spanning tree: an unbiased method for brain network analysis.
    Tewarie P; van Dellen E; Hillebrand A; Stam CJ
    Neuroimage; 2015 Jan; 104():177-88. PubMed ID: 25451472
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Functional grouping of similar genes using eigenanalysis on minimum spanning tree based neighborhood graph.
    Jothi R; Mohanty SK; Ojha A
    Comput Biol Med; 2016 Apr; 71():135-48. PubMed ID: 26945461
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Functional brain network analysis using minimum spanning trees in Multiple Sclerosis: an MEG source-space study.
    Tewarie P; Hillebrand A; Schoonheim MM; van Dijk BW; Geurts JJ; Barkhof F; Polman CH; Stam CJ
    Neuroimage; 2014 Mar; 88():308-18. PubMed ID: 24161625
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Not seeing the forest for the trees: size of the minimum spanning trees (MSTs) forest and branch significance in MST-based phylogenetic analysis.
    Teixeira AS; Monteiro PT; Carriço JA; Ramirez M; Francisco AP
    PLoS One; 2015; 10(3):e0119315. PubMed ID: 25799056
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Minimum spanning trees for gene expression data clustering.
    Xu Y; Olman V; Xu D
    Genome Inform; 2001; 12():24-33. PubMed ID: 11791221
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Theory of minimum spanning trees. I. Mean-field theory and strongly disordered spin-glass model.
    Jackson TS; Read N
    Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Feb; 81(2 Pt 1):021130. PubMed ID: 20365553
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees.
    Xu Y; Olman V; Xu D
    Bioinformatics; 2002 Apr; 18(4):536-45. PubMed ID: 12016051
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Hierarchical link clustering algorithm in networks.
    Bodlaj J; Batagelj V
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Jun; 91(6):062814. PubMed ID: 26172761
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Classification of transport backbones of complex networks.
    Choi W; Chae H; Yook SH; Kim Y
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Dec; 88(6):060802. PubMed ID: 24483375
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Identification of regulatory binding sites using minimum spanning trees.
    Olman V; Xu D; Xu Y
    Pac Symp Biocomput; 2003; ():327-38. PubMed ID: 12603039
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Growing trees in child brains: graph theoretical analysis of electroencephalography-derived minimum spanning tree in 5- and 7-year-old children reflects brain maturation.
    Boersma M; Smit DJ; Boomsma DI; De Geus EJ; Delemarre-van de Waal HA; Stam CJ
    Brain Connect; 2013; 3(1):50-60. PubMed ID: 23106635
    [TBL] [Abstract][Full Text] [Related]  

  • 14. An approach based on two-dimensional graph theory for structural cluster detection and its histopathological application.
    Kayser K; Sandau K; Paul J; Weisse G
    J Microsc; 1992 Feb; 165(Pt 2):281-8. PubMed ID: 1564724
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Selection of informative clusters from hierarchical cluster tree with gene classes.
    Toronen P
    BMC Bioinformatics; 2004 Mar; 5():32. PubMed ID: 15043761
    [TBL] [Abstract][Full Text] [Related]  

  • 16. HAMSTER: visualizing microarray experiments as a set of minimum spanning trees.
    Wan R; Kiseleva L; Harada H; Mamitsuka H; Horton P
    Source Code Biol Med; 2009 Nov; 4():8. PubMed ID: 19925686
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Inadequacies of minimum spanning trees in molecular epidemiology.
    Salipante SJ; Hall BG
    J Clin Microbiol; 2011 Oct; 49(10):3568-75. PubMed ID: 21849692
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Weighted graph cuts without eigenvectors a multilevel approach.
    Dhillon IS; Guan Y; Kulis B
    IEEE Trans Pattern Anal Mach Intell; 2007 Nov; 29(11):1944-57. PubMed ID: 17848776
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Identification of hierarchical and overlapping functional modules in PPI networks.
    Wang J; Ren J; Li M; Wu FX
    IEEE Trans Nanobioscience; 2012 Dec; 11(4):386-93. PubMed ID: 22955967
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A new algorithm for comparing and visualizing relationships between hierarchical and flat gene expression data clusterings.
    Torrente A; Kapushesky M; Brazma A
    Bioinformatics; 2005 Nov; 21(21):3993-9. PubMed ID: 16141251
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 11.