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 *

116 related articles for article (PubMed ID: 12377006)

  • 1. A DNA algorithm for the graph coloring problem.
    Liu W; Zhang F; Xu J
    J Chem Inf Comput Sci; 2002; 42(5):1176-8. PubMed ID: 12377006
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Automatically generated algorithms for the vertex coloring problem.
    Contreras Bolton C; Gatica G; Parada V
    PLoS One; 2013; 8(3):e58551. PubMed ID: 23516506
    [TBL] [Abstract][Full Text] [Related]  

  • 3. An unenumerative DNA computing model for vertex coloring problem.
    Xu J; Qiang X; Yang Y; Wang B; Yang D; Luo L; Pan L; Wang S
    IEEE Trans Nanobioscience; 2011 Jun; 10(2):94-8. PubMed ID: 21742570
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs.
    Liang Z; Wei H
    Comput Intell Neurosci; 2021; 2021():7667656. PubMed ID: 34650606
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Detecting list-colored graph motifs in biological networks using branch-and-bound strategy.
    Huang Y; Zhong C
    Comput Biol Med; 2019 Apr; 107():1-9. PubMed ID: 30738296
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs.
    Fan Y; Zhang Z; Yu Q; Lai Y; Su K; Wang Y; Pan S; Latecki LJ
    Entropy (Basel); 2023 Sep; 25(10):. PubMed ID: 37895498
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Graph coloring using the reduced quantum genetic algorithm.
    Ardelean SM; Udrescu M
    PeerJ Comput Sci; 2022; 8():e836. PubMed ID: 35111921
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Graph automorphism perception algorithms in computer-enhanced structure elucidation.
    Razinger M; Balasubramanian K; Munk ME
    J Chem Inf Comput Sci; 1993; 33(2):197-201. PubMed ID: 8314927
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities.
    Barbu A; Zhu SC
    IEEE Trans Pattern Anal Mach Intell; 2005 Aug; 27(8):1239-53. PubMed ID: 16119263
    [TBL] [Abstract][Full Text] [Related]  

  • 12. An efficient re-indexing algorithm for color-mapped images.
    Battiato S; Gallo G; Impoco G; Stanco F
    IEEE Trans Image Process; 2004 Nov; 13(11):1419-23. PubMed ID: 15540451
    [TBL] [Abstract][Full Text] [Related]  

  • 13. An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations.
    Melckenbeeck I; Audenaert P; Michoel T; Colle D; Pickavet M
    PLoS One; 2016; 11(1):e0147078. PubMed ID: 26797021
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A CLIQUE algorithm using DNA computing techniques based on closed-circle DNA sequences.
    Zhang H; Liu X
    Biosystems; 2011 Jul; 105(1):73-82. PubMed ID: 21511001
    [TBL] [Abstract][Full Text] [Related]  

  • 15. LGH: A Fast and Accurate Algorithm for Single Individual Haplotyping Based on a Two-Locus Linkage Graph.
    Xie M; Wang J; Chen X
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1255-66. PubMed ID: 26671798
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Parameter tuning patterns for random graph coloring with quantum annealing.
    Titiloye O; Crispin A
    PLoS One; 2012; 7(11):e50060. PubMed ID: 23166818
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.
    Nagoor Gani A; Latha SR
    Springerplus; 2016; 5(1):1854. PubMed ID: 27818892
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Characterization of 2-Path Product Signed Graphs with Its Properties.
    Sinha D; Sharma D
    Comput Intell Neurosci; 2017; 2017():1235715. PubMed ID: 28761437
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.