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 *

111 related articles for article (PubMed ID: 18276415)

  • 21. On approximating a new generalization of traveling salesman problem.
    Huang Z; Liao X; Naik PA; Lu X
    Heliyon; 2024 May; 10(10):e31297. PubMed ID: 38818174
    [TBL] [Abstract][Full Text] [Related]  

  • 22. A neural network model to minimize the connected dominating set for self-configuration of wireless sensor networks.
    He H; Zhu Z; Mäkinen E
    IEEE Trans Neural Netw; 2009 Jun; 20(6):973-82. PubMed ID: 19398401
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Parallel algorithms for finding a near-maximum independent set of a circle graph.
    Takefuji Y; Chen LL; Lee KC; Huffman J
    IEEE Trans Neural Netw; 1990; 1(3):263-7. PubMed ID: 18282845
    [TBL] [Abstract][Full Text] [Related]  

  • 24. A neural-network algorithm for a graph layout problem.
    Cimikowski A; Shope P
    IEEE Trans Neural Netw; 1996; 7(2):341-5. PubMed ID: 18255588
    [TBL] [Abstract][Full Text] [Related]  

  • 25. A deterministic annealing algorithm for approximating a solution of the min-bisection problem.
    Dang C; Ma W; Liang J
    Neural Netw; 2009 Jan; 22(1):58-66. PubMed ID: 18995985
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Sensible method for updating motif instances in an increased biological network.
    Kim WY; Kurmar S
    Methods; 2015 Jul; 83():71-9. PubMed ID: 25869675
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Energy function-based approaches to graph coloring.
    Di Blas A; Jagota A; Hughey R
    IEEE Trans Neural Netw; 2002; 13(1):81-91. PubMed ID: 18244411
    [TBL] [Abstract][Full Text] [Related]  

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

  • 29. The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees.
    Demeyer S; Michoel T; Fostier J; Audenaert P; Pickavet M; Demeester P
    PLoS One; 2013; 8(4):e61183. PubMed ID: 23620730
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Cell tracking in microscopic video using matching and linking of bipartite graphs.
    Chatterjee R; Ghosh M; Chowdhury AS; Ray N
    Comput Methods Programs Biomed; 2013 Dec; 112(3):422-31. PubMed ID: 24016861
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Efficient Activity Detection in Untrimmed Video with Max-Subgraph Search.
    Chao Yeh Chen ; Grauman K
    IEEE Trans Pattern Anal Mach Intell; 2017 May; 39(5):908-921. PubMed ID: 28113697
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Fast Manifold Ranking With Local Bipartite Graph.
    Chen X; Ye Y; Wu Q; Nie F
    IEEE Trans Image Process; 2021; 30():6744-6756. PubMed ID: 34264827
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Boosting for multi-graph classification.
    Wu J; Pan S; Zhu X; Cai Z
    IEEE Trans Cybern; 2015 Mar; 45(3):430-43. PubMed ID: 25014984
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Energy-Efficient Algorithm for Multicasting in Duty-Cycled Sensor Networks.
    Chen Q; Cheng S; Gao H; Li J; Cai Z
    Sensors (Basel); 2015 Dec; 15(12):31224-43. PubMed ID: 26690446
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Identifying HIV-induced subgraph patterns in brain networks with side information.
    Cao B; Kong X; Zhang J; Yu PS; Ragin AB
    Brain Inform; 2015 Dec; 2(4):211-223. PubMed ID: 27747563
    [TBL] [Abstract][Full Text] [Related]  

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

  • 37. Computing atom mappings for biochemical reactions without subgraph isomorphism.
    Heinonen M; Lappalainen S; Mielikäinen T; Rousu J
    J Comput Biol; 2011 Jan; 18(1):43-58. PubMed ID: 21210731
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Connectivity problems on heterogeneous graphs.
    Wu J; Khodaverdian A; Weitz B; Yosef N
    Algorithms Mol Biol; 2019; 14():5. PubMed ID: 30899321
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Maximum symmetrical split of molecular graphs. Application to organic synthesis design.
    Vismara P; Tognetti Y; Laurenço C
    J Chem Inf Model; 2005; 45(3):685-95. PubMed ID: 15921458
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Co-Clustering on Bipartite Graphs for Robust Model Fitting.
    Lin S; Luo H; Yan Y; Xiao G; Wang H
    IEEE Trans Image Process; 2022; 31():6605-6620. PubMed ID: 36256709
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 6.