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 *

107 related articles for article (PubMed ID: 21243102)

  • 1. Summarizing Documents by Measuring the Importance of a Subset of Vertices within a Graph.
    Chen S; Huang M; Lu Z
    Proc IEEE WIC ACM Int Conf Web Intell Intell Agent Technol; 2009 Oct; 1(2009):267-272. PubMed ID: 21243102
    [TBL] [Abstract][Full Text] [Related]  

  • 2. On the centrality of vertices of molecular graphs.
    Randić M; Novič M; Vračko M; Plavšić D
    J Comput Chem; 2013 Nov; 34(29):2514-23. PubMed ID: 23955387
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Seeing the results of a mutation with a vertex weighted hierarchical graph.
    Knisley DJ; Knisley JR
    BMC Proc; 2014; 8(Suppl 2 Proceedings of the 3rd Annual Symposium on Biologica):S7. PubMed ID: 25237394
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Evolutionary Algorithm based Ensemble Extractive Summarization for Developing Smart Medical System.
    Mallick C; Das AK; Nayak J; Pelusi D; Vimal S
    Interdiscip Sci; 2021 Jun; 13(2):229-259. PubMed ID: 33576956
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.
    Nagoor Gani A; Latha SR
    Springerplus; 2016; 5(1):1854. PubMed ID: 27818892
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Improving extractive document summarization with sentence centrality.
    Gong S; Zhu Z; Qi J; Tong C; Lu Q; Wu W
    PLoS One; 2022; 17(7):e0268278. PubMed ID: 35867732
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Contextual Correlation Preserving Multiview Featured Graph Clustering.
    He T; Liu Y; Ko TH; Chan KCC; Ong YS
    IEEE Trans Cybern; 2020 Oct; 50(10):4318-4331. PubMed ID: 31329151
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Clone temporal centrality measures for incomplete sequences of graph snapshots.
    Hanke M; Foraita R
    BMC Bioinformatics; 2017 May; 18(1):261. PubMed ID: 28511665
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Graph-based biomedical text summarization: An itemset mining and sentence clustering approach.
    Nasr Azadani M; Ghadiri N; Davoodijam E
    J Biomed Inform; 2018 Aug; 84():42-58. PubMed ID: 29906584
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Faster heuristics for graph burning.
    Gautam RK; Kare AS; S DB
    Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602
    [TBL] [Abstract][Full Text] [Related]  

  • 11. DHPV: a distributed algorithm for large-scale graph partitioning.
    Adoni WYH; Nahhal T; Krichen M; El Byed A; Assayad I
    J Big Data; 2020; 7(1):76. PubMed ID: 32953386
    [TBL] [Abstract][Full Text] [Related]  

  • 12. AGRNet: Adaptive Graph Representation Learning and Reasoning for Face Parsing.
    Te G; Hu W; Liu Y; Shi H; Mei T
    IEEE Trans Image Process; 2021; 30():8236-8250. PubMed ID: 34559650
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Centrality-based identification of important edges in complex networks.
    Bröhl T; Lehnertz K
    Chaos; 2019 Mar; 29(3):033115. PubMed ID: 30927842
    [TBL] [Abstract][Full Text] [Related]  

  • 14. LGH: A Fast and Accurate Algorithm for Single Individual Haplotyping Based on a Two-Locus Linkage Graph.
    Xie M; Wang J; Chen X
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1255-66. PubMed ID: 26671798
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Graph Energies of Egocentric Networks and Their Correlation with Vertex Centrality Measures.
    Morzy M; Kajdanowicz T
    Entropy (Basel); 2018 Nov; 20(12):. PubMed ID: 33266640
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Exactly solvable model of a coalescing random graph.
    Lushnikov AA
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Feb; 91(2):022119. PubMed ID: 25768470
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A graph exploration method for identifying influential spreaders in complex networks.
    Salamanos N; Voudigari E; Yannakoudakis EJ
    Appl Netw Sci; 2017; 2(1):26. PubMed ID: 30443581
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Growing Super Stable Tensegrity Frameworks.
    Yang Q; Cao M; Anderson BDO
    IEEE Trans Cybern; 2019 Jul; 49(7):2524-2535. PubMed ID: 29994042
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Analysis of Critical and Redundant Vertices in Controlling Directed Complex Networks Using Feedback Vertex Sets.
    Bao Y; Hayashida M; Liu P; Ishitsuka M; Nacher JC; Akutsu T
    J Comput Biol; 2018 Oct; 25(10):1071-1090. PubMed ID: 30074414
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A Simple Algorithm for Finding All k-Edge-Connected Components.
    Wang T; Zhang Y; Chin FY; Ting HF; Tsin YH; Poon SH
    PLoS One; 2015; 10(9):e0136264. PubMed ID: 26368134
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.