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 *

83 related articles for article (PubMed ID: 18282845)

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

  • 2. Comments on ;parallel algorithms for finding a near-maximum independent set of a circle graph' [with reply].
    Steeg EW; Takefuji Y; Lee KC
    IEEE Trans Neural Netw; 1991; 2(2):328-9. PubMed ID: 18276390
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Neural computing in discovering RNA interactions.
    Takefuji Y; Ben-Alon D; Zaritsky A
    Biosystems; 1992; 27(2):85-96. PubMed ID: 1281006
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 7. A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences.
    Ji Y; Xu X; Stormo GD
    Bioinformatics; 2004 Jul; 20(10):1591-602. PubMed ID: 14962926
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers.
    Chang WL; Chen JC; Chung WY; Hsiao CY; Wong R; Vasilakos AV
    IEEE Trans Nanobioscience; 2021 Jul; 20(3):354-376. PubMed ID: 33900920
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 11. Efficient conversion of RNA pseudoknots to knot-free structures using a graphical model.
    Chiu JK; Chen YP
    IEEE Trans Biomed Eng; 2015 May; 62(5):1265-71. PubMed ID: 25474805
    [TBL] [Abstract][Full Text] [Related]  

  • 12. BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.
    Vorburger RS; Reischauer C; Boesiger P
    Neuroimage; 2013 Feb; 66():426-35. PubMed ID: 23110883
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Approximating the maximum weight clique using replicator dynamics.
    Bomze IR; Pelillo M; Stix V
    IEEE Trans Neural Netw; 2000; 11(6):1228-41. PubMed ID: 18249849
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. RANGI: a fast list-colored graph motif finding algorithm.
    Rudi AG; Shahrivari S; Jalili S; Moghadam Kashani ZR
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(2):504-13. PubMed ID: 23929873
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Classification of RNA secondary structures using the techniques of cluster analysis.
    Nakaya A; Yonezawa A; Yamamoto K
    J Theor Biol; 1996 Nov; 183(1):105-17. PubMed ID: 8959113
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Intrinsic graph structure estimation using graph Laplacian.
    Noda A; Hino H; Tatsuno M; Akaho S; Murata N
    Neural Comput; 2014 Jul; 26(7):1455-83. PubMed ID: 24708372
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Fitting a geometric graph to a protein-protein interaction network.
    Higham DJ; Rasajski M; Przulj N
    Bioinformatics; 2008 Apr; 24(8):1093-9. PubMed ID: 18344248
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An efficient approximation algorithm for finding a maximum clique using Hopfield network learning.
    Wang RL; Tang Z; Cao QP
    Neural Comput; 2003 Jul; 15(7):1605-19. PubMed ID: 12816568
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.