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 *

458 related articles for article (PubMed ID: 31057194)

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

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

  • 3. A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.
    Dinh H; Rajasekaran S
    Bioinformatics; 2011 Jul; 27(14):1901-7. PubMed ID: 21636593
    [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. Connectivity of Triangulation Flip Graphs in the Plane.
    Wagner U; Welzl E
    Discrete Comput Geom; 2022; 68(4):1227-1284. PubMed ID: 36466128
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. New algorithms for maximum disjoint paths based on tree-likeness.
    Fleszar K; Mnich M; Spoerhase J
    Math Program; 2018; 171(1):433-461. PubMed ID: 30956356
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Equivalence classes and conditional hardness in massively parallel computations.
    Nanongkai D; Scquizzato M
    Distrib Comput; 2022; 35(2):165-183. PubMed ID: 35300185
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Faster algorithms for counting subgraphs in sparse graphs.
    Bressan M
    Algorithmica; 2021; 83(8):2578-2605. PubMed ID: 34720296
    [TBL] [Abstract][Full Text] [Related]  

  • 10. The Complexity of Optimal Design of Temporally Connected Graphs.
    Akrida EC; Gąsieniec L; Mertzios GB; Spirakis PG
    Theory Comput Syst; 2017; 61(3):907-944. PubMed ID: 32025196
    [TBL] [Abstract][Full Text] [Related]  

  • 11. New Tools and Connections for Exponential-Time Approximation.
    Bansal N; Chalermsook P; Laekhanukit B; Nanongkai D; Nederlof J
    Algorithmica; 2019; 81(10):3993-4009. PubMed ID: 31496549
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.
    Azam NA; Shurbevski A; Nagamochi H
    Entropy (Basel); 2020 Aug; 22(9):. PubMed ID: 33286692
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Factorization and pseudofactorization of weighted graphs.
    Sheridan K; Berleant J; Bathe M; Condon A; Williams VV
    Discrete Appl Math; 2023 Oct; 337():81-105. PubMed ID: 37213330
    [TBL] [Abstract][Full Text] [Related]  

  • 15. The Connected
    Bai C; Zhou J; Liang Z
    Comput Intell Neurosci; 2021; 2021():3533623. PubMed ID: 34992643
    [TBL] [Abstract][Full Text] [Related]  

  • 16. USNAP: fast unique dense region detection and its application to lung cancer.
    Wong SWH; Pastrello C; Kotlyar M; Faloutsos C; Jurisica I
    Bioinformatics; 2023 Aug; 39(8):. PubMed ID: 37527019
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Faster Cut Sparsification of Weighted Graphs.
    Forster S; de Vos T
    Algorithmica; 2023; 85(4):929-964. PubMed ID: 37008076
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Bit-parallel sequence-to-graph alignment.
    Rautiainen M; Mäkinen V; Marschall T
    Bioinformatics; 2019 Oct; 35(19):3599-3607. PubMed ID: 30851095
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 23.