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 *

268 related articles for article (PubMed ID: 26353260)

  • 1. Dense Subgraph Partition of Positive Hypergraphs.
    Liu H; Latecki LJ; Yan S
    IEEE Trans Pattern Anal Mach Intell; 2015 Mar; 37(3):541-54. PubMed ID: 26353260
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A New Augmentation Based Algorithm for Extracting Maximal Chordal Subgraphs.
    Bhowmick S; Chen TY; Halappanavar M
    J Parallel Distrib Comput; 2015 Feb; 76():132-144. PubMed ID: 25767331
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Fast detection of dense subgraphs with iterative shrinking and expansion.
    Liu H; Latecki LJ; Yan S
    IEEE Trans Pattern Anal Mach Intell; 2013 Sep; 35(9):2131-42. PubMed ID: 23868775
    [TBL] [Abstract][Full Text] [Related]  

  • 4. [A retrieval method of drug molecules based on graph collapsing].
    Qu JW; Lv XQ; Liu ZM; Liao Y; Sun PH; Wang B; Tang Z
    Beijing Da Xue Xue Bao Yi Xue Ban; 2018 Apr; 50(2):368-374. PubMed ID: 29643542
    [TBL] [Abstract][Full Text] [Related]  

  • 5. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Doubly Nonnegative and Semidefinite Relaxations for the Densest
    Guo CH; Guo Y; Liu BB
    Entropy (Basel); 2019 Jan; 21(2):. PubMed ID: 33266824
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Coupling Graphs, Efficient Algorithms and B-Cell Epitope Prediction.
    Liang Zhao ; Hoi SC; Li Z; Wong L; Nguyen H; Li J
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(1):7-16. PubMed ID: 26355502
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Discriminative Feature Selection for Uncertain Graph Classification.
    Kong X; Yu PS; Wang X; Ragin AB
    Proc SIAM Int Conf Data Min; 2013; 2013():82-93. PubMed ID: 25949925
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Partition Independent Set and Reduction-Based Approach for Partition Coloring Problem.
    Zhu E; Jiang F; Liu C; Xu J
    IEEE Trans Cybern; 2022 Jun; 52(6):4960-4969. PubMed ID: 33108304
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Maximal prime subgraph decomposition of Bayesian networks.
    Olesen KG; Madsen AL
    IEEE Trans Syst Man Cybern B Cybern; 2002; 32(1):21-31. PubMed ID: 18238100
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A parallel improvement algorithm for the bipartite subgraph problem.
    Lee KC; Funabiki N; Takefuji Y
    IEEE Trans Neural Netw; 1992; 3(1):139-45. PubMed ID: 18276415
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A Two-Phase Algorithm for Differentially Private Frequent Subgraph Mining.
    Cheng X; Su S; Xu S; Xiong L; Xiao K; Zhao M
    IEEE Trans Knowl Data Eng; 2018 Aug; 30(8):1411-1425. PubMed ID: 33223776
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Differentially Private Frequent Subgraph Mining.
    Xu S; Su S; Xiong L; Cheng X; Xiao K
    Proc Int Conf Data Eng; 2016 May; 2016():229-240. PubMed ID: 27616876
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A linear delay algorithm for enumerating all connected induced subgraphs.
    Alokshiya M; Salem S; Abed F
    BMC Bioinformatics; 2019 Jun; 20(Suppl 12):319. PubMed ID: 31216984
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Using Gaussian Boson Sampling to Find Dense Subgraphs.
    Arrazola JM; Bromley TR
    Phys Rev Lett; 2018 Jul; 121(3):030503. PubMed ID: 30085825
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3.
    Carletti V; Foggia P; Saggese A; Vento M
    IEEE Trans Pattern Anal Mach Intell; 2018 Apr; 40(4):804-818. PubMed ID: 28436848
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Mining the Enriched Subgraphs for Specific Vertices in a Biological Graph.
    Meysman P; Saeys Y; Sabaghian E; Bittremieux W; Van de Peer Y; Goethals B; Laukens K
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(5):1496-1507. PubMed ID: 27295680
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Hypergraphs with edge-dependent vertex weights:
    Zhu Y; Segarra S
    Front Big Data; 2023; 6():1020173. PubMed ID: 36896444
    [TBL] [Abstract][Full Text] [Related]  

  • 19. MISAGA: An Algorithm for Mining Interesting Subgraphs in Attributed Graphs.
    He T; Chan KCC
    IEEE Trans Cybern; 2018 May; 48(5):1369-1382. PubMed ID: 28459699
    [TBL] [Abstract][Full Text] [Related]  

  • 20. k-Partite cliques of protein interactions: A novel subgraph topology for functional coherence analysis on PPI networks.
    Liu Q; Chen YP; Li J
    J Theor Biol; 2014 Jan; 340():146-54. PubMed ID: 24056214
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 14.