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 *

149 related articles for article (PubMed ID: 23349711)

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

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

  • 3. Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems.
    Hüffner F; Komusiewicz C; Niedermeier R; Wernicke S
    Methods Mol Biol; 2017; 1526():363-402. PubMed ID: 27896752
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Vertex coloring of graphs via phase dynamics of coupled oscillatory networks.
    Parihar A; Shukla N; Jerry M; Datta S; Raychowdhury A
    Sci Rep; 2017 Apr; 7(1):911. PubMed ID: 28424457
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Assessing statistical significance in causal graphs.
    Chindelevitch L; Loh PR; Enayetallah A; Berger B; Ziemek D
    BMC Bioinformatics; 2012 Feb; 13():35. PubMed ID: 22348444
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 9. A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms.
    Corus D; Lehre PK; Neumann F; Pourhassan M
    Evol Comput; 2016; 24(1):183-203. PubMed ID: 25700147
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Computational complexity of ecological and evolutionary spatial dynamics.
    Ibsen-Jensen R; Chatterjee K; Nowak MA
    Proc Natl Acad Sci U S A; 2015 Dec; 112(51):15636-41. PubMed ID: 26644569
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples.
    Hujdurovic A; Kacar U; Milanic M; Ries B; Tomescu AI
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(1):96-108. PubMed ID: 28113405
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Training Variational Quantum Algorithms Is NP-Hard.
    Bittel L; Kliesch M
    Phys Rev Lett; 2021 Sep; 127(12):120502. PubMed ID: 34597099
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Parameterized Complexity of Eulerian Deletion Problems.
    Cygan M; Marx D; Pilipczuk M; Pilipczuk M; Schlotter I
    Algorithmica; 2014; 68(1):41-61. PubMed ID: 24415818
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. An algebraic geometry approach to protein structure determination from NMR data.
    Wang L; Mettu RR; Donald BR
    Proc IEEE Comput Syst Bioinform Conf; 2005; ():235-46. PubMed ID: 16447981
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Parallelizing Assignment Problem with DNA Strands.
    Khorsand B; Savadi A; Naghibzadeh M
    Iran J Biotechnol; 2020 Jan; 18(1):e2547. PubMed ID: 32884959
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.
    Altarelli F; Braunstein A; Dall'Asta L; De Bacco C; Franz S
    PLoS One; 2015; 10(12):e0145222. PubMed ID: 26710102
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Tractable Cases of (*,2)-Bounded Parsimony Haplotyping.
    Keijsper J; Oosterwijk T
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(1):234-47. PubMed ID: 26357092
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 8.