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)

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

  • 2. An annealed chaotic maximum neural network for bipartite subgraph problem.
    Wang J; Tang Z; Wang R
    Int J Neural Syst; 2004 Apr; 14(2):107-16. PubMed ID: 15112368
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A hopfield network learning method for bipartite subgraph problem.
    Wang RL; Tang Z; Cao QP
    IEEE Trans Neural Netw; 2004 Nov; 15(6):1458-65. PubMed ID: 15565773
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Design and analysis of maximum Hopfield networks.
    Galán-Marín G; Muñoz-Pérez J
    IEEE Trans Neural Netw; 2001; 12(2):329-39. PubMed ID: 18244387
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A subgraph problem from restriction maps of DNA.
    Wang C
    J Comput Biol; 1994; 1(3):227-34. PubMed ID: 8790467
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Optimal competitive hopfield network with stochastic dynamics for maximum cut problem.
    Wang J; Tang Z; Cao Q; Wang R
    Int J Neural Syst; 2004 Aug; 14(4):257-65. PubMed ID: 15372703
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 10. Vertex Deletion into Bipartite Permutation Graphs.
    Bożyk Ł; Derbisz J; Krawczyk T; Novotná J; Okrasa K
    Algorithmica; 2022; 84(8):2271-2291. PubMed ID: 35880199
    [TBL] [Abstract][Full Text] [Related]  

  • 11. On Finding and Enumerating Maximal and Maximum
    Phillips CA; Wang K; Baker EJ; Bubier JA; Chesler EJ; Langston MA
    Algorithms; 2019 Jan; 12(1):. PubMed ID: 31448059
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility.
    Calamoneri T; Gastaldello M; Mary A; Sagot MF; Sinaimeri B
    Algorithms Mol Biol; 2020; 15():14. PubMed ID: 32704304
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Graph Simplification-Aided ADMM for Decentralized Composite Optimization.
    Wang B; Fang J; Duan H; Li H
    IEEE Trans Cybern; 2021 Oct; 51(10):5170-5183. PubMed ID: 31831456
    [TBL] [Abstract][Full Text] [Related]  

  • 14. (p,q)-biclique counting and enumeration for large sparse bipartite graphs.
    Yang J; Peng Y; Ouyang D; Zhang W; Lin X; Zhao X
    VLDB J; 2023 Mar; ():1-25. PubMed ID: 37362202
    [TBL] [Abstract][Full Text] [Related]  

  • 15. An optimization algorithm for maximum quasi-clique problem based on information feedback model.
    Liu S; Zhou J; Wang D; Zhang Z; Lei M
    PeerJ Comput Sci; 2024; 10():e2173. PubMed ID: 39145205
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. A near-optimum parallel planarization algorithm.
    Takefuji Y; Lee KC
    Science; 1989 Sep; 245(4923):1221-3. PubMed ID: 17747883
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
    Wang Z; Huang D; Meng H; Tang C
    Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. An approximation algorithm for graph partitioning via deterministic annealing neural network.
    Wu Z; Karimi HR; Dang C
    Neural Netw; 2019 Sep; 117():191-200. PubMed ID: 31174047
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.