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 *

112 related articles for article (PubMed ID: 36883187)

  • 21. Exact and approximation algorithms for DNA tag set design.
    Măndoiu II; Trincă D
    J Comput Biol; 2006 Apr; 13(3):732-44. PubMed ID: 16706722
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Dynamics of neural networks over undirected graphs.
    Goles E; Ruz GA
    Neural Netw; 2015 Mar; 63():156-69. PubMed ID: 25544654
    [TBL] [Abstract][Full Text] [Related]  

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

  • 24. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
    Novotná J; Okrasa K; Pilipczuk M; Rzążewski P; van Leeuwen EJ; Walczak B
    Algorithmica; 2021; 83(8):2634-2650. PubMed ID: 34720297
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Classes of tree-based networks.
    Fischer M; Galla M; Herbst L; Long Y; Wicke K
    Vis Comput Ind Biomed Art; 2020 May; 3(1):12. PubMed ID: 32415350
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Dynamic Graph Stream Algorithms in
    Huang Z; Peng P
    Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194
    [TBL] [Abstract][Full Text] [Related]  

  • 27. A Clustering-Enhanced Memetic Algorithm for the Quadratic Minimum Spanning Tree Problem.
    Zhang S; Mao J; Wang N; Li D; Ju C
    Entropy (Basel); 2022 Dec; 25(1):. PubMed ID: 36673228
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Approximating maximum clique with a Hopfield network.
    Jagota A
    IEEE Trans Neural Netw; 1995; 6(3):724-35. PubMed ID: 18263357
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Querying graphs in protein-protein interactions networks using feedback vertex set.
    Blin G; Sikora F; Vialette S
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):628-35. PubMed ID: 20498512
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Counting Linear Extensions: Parameterizations by Treewidth.
    Eiben E; Ganian R; Kangas K; Ordyniak S
    Algorithmica; 2019; 81(4):1657-1683. PubMed ID: 31007326
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Cluster definition by the optimization of simple measures.
    Bailey T; Cowles J
    IEEE Trans Pattern Anal Mach Intell; 1984 May; 6(5):645-52. PubMed ID: 21869234
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Energy-Efficient Algorithm for Multicasting in Duty-Cycled Sensor Networks.
    Chen Q; Cheng S; Gao H; Li J; Cai Z
    Sensors (Basel); 2015 Dec; 15(12):31224-43. PubMed ID: 26690446
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Exactly computing the parsimony scores on phylogenetic networks using dynamic programming.
    Kannan L; Wheeler WC
    J Comput Biol; 2014 Apr; 21(4):303-19. PubMed ID: 24559134
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Network Pollution Games.
    Anastasiadis E; Deng X; Krysta P; Li M; Qiao H; Zhang J
    Algorithmica; 2019; 81(1):124-166. PubMed ID: 30872881
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Connectivity problems on heterogeneous graphs.
    Wu J; Khodaverdian A; Weitz B; Yosef N
    Algorithms Mol Biol; 2019; 14():5. PubMed ID: 30899321
    [TBL] [Abstract][Full Text] [Related]  

  • 36. On a greedy approach for genome scaffolding.
    Davot T; Chateau A; Fossé R; Giroudeau R; Weller M
    Algorithms Mol Biol; 2022 Oct; 17(1):16. PubMed ID: 36309685
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Faster heuristics for graph burning.
    Gautam RK; Kare AS; S DB
    Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Estimation and marginalization using the Kikuchi approximation methods.
    Pakzad P; Anantharam V
    Neural Comput; 2005 Aug; 17(8):1836-73. PubMed ID: 15969920
    [TBL] [Abstract][Full Text] [Related]  

  • 39. It is difficult to tell if there is a Condorcet spanning tree.
    Darmann A
    Math Methods Oper Res (Heidelb); 2016; 84():93-104. PubMed ID: 27563279
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Transduction on Directed Graphs via Absorbing Random Walks.
    De J; Zhang X; Lin F; Cheng L; De J; Xiaowei Zhang ; Feng Lin ; Li Cheng ; De J; Cheng L; Zhang X; Lin F
    IEEE Trans Pattern Anal Mach Intell; 2018 Jul; 40(7):1770-1784. PubMed ID: 28809671
    [TBL] [Abstract][Full Text] [Related]  

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