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 *

119 related articles for article (PubMed ID: 12377006)

  • 21. A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem.
    García-Arnau M; Manrique D; Rodríguez-Patón A; Sosík P
    Biosystems; 2007; 90(3):687-97. PubMed ID: 17418940
    [TBL] [Abstract][Full Text] [Related]  

  • 22. A structural approach to the graceful coloring of a subclass of trees.
    D L; S DY
    Heliyon; 2023 Sep; 9(9):e19563. PubMed ID: 37809615
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
    Nishiyama Y; Shurbevski A; Nagamochi H; Akutsu T
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):77-90. PubMed ID: 29994050
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Discrimination of direct and indirect interactions in a network of regulatory effects.
    Tresch A; Beissbarth T; Sültmann H; Kuner R; Poustka A; Buness A
    J Comput Biol; 2007 Nov; 14(9):1217-28. PubMed ID: 17990974
    [TBL] [Abstract][Full Text] [Related]  

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

  • 26. Comments on "the 1993 DIMACS graph coloring challenge" and "energy function-based approaches to graph coloring".
    Liu J; Zhong W; Jiao L
    IEEE Trans Neural Netw; 2006 Mar; 17(2):533. PubMed ID: 16566482
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Phase transitions in the coloring of random graphs.
    Zdeborová L; Krzakała F
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Sep; 76(3 Pt 1):031131. PubMed ID: 17930223
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing.
    Guo M; Chang WL; Ho M; Lu J; Cao J
    Biosystems; 2005 Apr; 80(1):71-82. PubMed ID: 15740836
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Rainbow connections of bioriented graphs.
    Wang L; Liu S; Jiang H
    Heliyon; 2024 May; 10(10):e31426. PubMed ID: 38831833
    [TBL] [Abstract][Full Text] [Related]  

  • 30. CeFunMO: A centrality based method for discovering functional motifs with application in biological networks.
    Kouhsar M; Razaghi-Moghadam Z; Mousavian Z; Masoudi-Nejad A
    Comput Biol Med; 2016 Sep; 76():154-9. PubMed ID: 27454243
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Graph-based normalization and whitening for non-linear data analysis.
    Aaron C
    Neural Netw; 2006; 19(6-7):864-76. PubMed ID: 16797921
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Structural information content of networks: graph entropy based on local vertex functionals.
    Dehmer M; Emmert-Streib F
    Comput Biol Chem; 2008 Apr; 32(2):131-8. PubMed ID: 18243802
    [TBL] [Abstract][Full Text] [Related]  

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

  • 34. Solving hard computational problems efficiently: asymptotic parametric complexity 3-coloring algorithm.
    Martín H JA
    PLoS One; 2013; 8(1):e53437. PubMed ID: 23349711
    [TBL] [Abstract][Full Text] [Related]  

  • 35. GOlorize: a Cytoscape plug-in for network visualization with Gene Ontology-based layout and coloring.
    Garcia O; Saveanu C; Cline M; Fromont-Racine M; Jacquier A; Schwikowski B; Aittokallio T
    Bioinformatics; 2007 Feb; 23(3):394-6. PubMed ID: 17127678
    [TBL] [Abstract][Full Text] [Related]  

  • 36. The Moran process on 2-chromatic graphs.
    Kaveh K; McAvoy A; Chatterjee K; Nowak MA
    PLoS Comput Biol; 2020 Nov; 16(11):e1008402. PubMed ID: 33151935
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Detecting the solution space of vertex cover by mutual determinations and backbones.
    Wei W; Zhang R; Guo B; Zheng Z
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Jul; 86(1 Pt 2):016112. PubMed ID: 23005496
    [TBL] [Abstract][Full Text] [Related]  

  • 38. A parallel algorithm for error correction in high-throughput short-read data on CUDA-enabled graphics hardware.
    Shi H; Schmidt B; Liu W; Müller-Wittig W
    J Comput Biol; 2010 Apr; 17(4):603-15. PubMed ID: 20426693
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Coloring random graphs and maximizing local diversity.
    Bounkong S; van Mourik J; Saad D
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Nov; 74(5 Pt 2):057101. PubMed ID: 17280022
    [TBL] [Abstract][Full Text] [Related]  

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

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