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 *

163 related articles for article (PubMed ID: 27190753)

  • 21. The backtracking survey propagation algorithm for solving random K-SAT problems.
    Marino R; Parisi G; Ricci-Tersenghi F
    Nat Commun; 2016 Oct; 7():12996. PubMed ID: 27694952
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Factoring semi-primes with (quantum) SAT-solvers.
    Mosca M; Verschoor SR
    Sci Rep; 2022 May; 12(1):7982. PubMed ID: 35568707
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Optimization by quantum annealing: lessons from hard satisfiability problems.
    Battaglia DA; Santoro GE; Tosatti E
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Jun; 71(6 Pt 2):066707. PubMed ID: 16089911
    [TBL] [Abstract][Full Text] [Related]  

  • 24. A clustering metaheuristic for large orienteering problems.
    Elzein A; Di Caro GA
    PLoS One; 2022; 17(7):e0271751. PubMed ID: 35867693
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Circumspect descent prevails in solving random constraint satisfaction problems.
    Alava M; Ardelius J; Aurell E; Kaski P; Krishnamurthy S; Orponen P; Seitz S
    Proc Natl Acad Sci U S A; 2008 Oct; 105(40):15253-7. PubMed ID: 18832149
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Model abstraction for discrete-event systems by binary linear programming with applications to manufacturing systems.
    Cheng L; Feng L; Li Z
    Sci Prog; 2021; 104(3):368504211030833. PubMed ID: 34292845
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Theory of Nonequilibrium Local Search on Random Satisfaction Problems.
    Aurell E; Domínguez E; Machado D; Mulet R
    Phys Rev Lett; 2019 Dec; 123(23):230602. PubMed ID: 31868433
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random satisfiability problem, and its application to stop-and-restart resolutions.
    Cocco S; Monasson R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2002 Sep; 66(3 Pt 2B):037101. PubMed ID: 12366297
    [TBL] [Abstract][Full Text] [Related]  

  • 29. A multilevel memetic algorithm for large SAT-encoded problems.
    Bouhmala N
    Evol Comput; 2012; 20(4):641-64. PubMed ID: 22540191
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Effective haplotype assembly via maximum Boolean satisfiability.
    Mousavi SR; Mirabolghasemi M; Bargesteh N; Talebi M
    Biochem Biophys Res Commun; 2011 Jan; 404(2):593-8. PubMed ID: 21144826
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Order-to-chaos transition in the hardness of random Boolean satisfiability problems.
    Varga M; Sumi R; Toroczkai Z; Ercsey-Ravasz M
    Phys Rev E; 2016 May; 93(5):052211. PubMed ID: 27300884
    [TBL] [Abstract][Full Text] [Related]  

  • 32. A multiobjective multi-view cluster ensemble technique: Application in patient subclassification.
    Mitra S; Saha S
    PLoS One; 2019; 14(5):e0216904. PubMed ID: 31120942
    [TBL] [Abstract][Full Text] [Related]  

  • 33. An improved satisfiability algorithm for nested canalyzing functions and its application to determining a singleton attractor of a Boolean network.
    Melkman AA; Akutsu T
    J Comput Biol; 2013 Dec; 20(12):958-69. PubMed ID: 24073923
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Fault detection and therapeutic intervention in gene regulatory networks using SAT solvers.
    Deshpande A; Layek RK
    Biosystems; 2019 May; 179():55-62. PubMed ID: 30831179
    [TBL] [Abstract][Full Text] [Related]  

  • 35. A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form.
    Zhang Z; Xu D; Zhou J
    Entropy (Basel); 2021 Mar; 23(3):. PubMed ID: 33806451
    [TBL] [Abstract][Full Text] [Related]  

  • 36. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem.
    Lim WL; Wibowo A; Desa MI; Haron H
    Comput Intell Neurosci; 2016; 2016():5803893. PubMed ID: 26819585
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Random K-satisfiability problem: from an analytic solution to an efficient algorithm.
    Mézard M; Zecchina R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2002 Nov; 66(5 Pt 2):056126. PubMed ID: 12513575
    [TBL] [Abstract][Full Text] [Related]  

  • 38. DNA computing using single-molecule hybridization detection.
    Schmidt KA; Henkel CV; Rozenberg G; Spaink HP
    Nucleic Acids Res; 2004; 32(17):4962-8. PubMed ID: 15388798
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Witness of unsatisfiability for a random 3-satisfiability formula.
    Wu LL; Zhou HJ; Alava M; Aurell E; Orponen P
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 May; 87(5):052807. PubMed ID: 23767584
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Solving satisfiability problems using a novel microarray-based DNA computer.
    Lin CH; Cheng HP; Yang CB; Yang CN
    Biosystems; 2007; 90(1):242-52. PubMed ID: 17029765
    [TBL] [Abstract][Full Text] [Related]  

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