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 *

131 related articles for article (PubMed ID: 37023163)

  • 1. Splitting Vertices in 2-Layer Graph Drawings.
    Ahmed R; Angelini P; Bekos MA; Battista GD; Kaufmann M; Kindermann P; Kobourov S; Nollenburg M; Symvonis A; Villedieu A; Wallinger M
    IEEE Comput Graph Appl; 2023; 43(3):24-35. PubMed ID: 37023163
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Vertex Deletion into Bipartite Permutation Graphs.
    Bożyk Ł; Derbisz J; Krawczyk T; Novotná J; Okrasa K
    Algorithmica; 2022; 84(8):2271-2291. PubMed ID: 35880199
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Minimizing the Number of Edges via Edge Concentration in Dense Layered Graphs.
    Onoue Y; Kukimoto N; Sakamoto N; Koyamada K
    IEEE Trans Vis Comput Graph; 2016 Jun; 22(6):1652-1661. PubMed ID: 26955033
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs.
    Aichholzer O; García A; Tejel J; Vogtenhuber B; Weinberger A
    Discrete Comput Geom; 2024; 71(1):40-66. PubMed ID: 38192902
    [TBL] [Abstract][Full Text] [Related]  

  • 5. An improved neural network model for the two-page crossing number problem.
    He H; Sýkora O; Mäkinen E
    IEEE Trans Neural Netw; 2006 Nov; 17(6):1642-6. PubMed ID: 17131678
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO
    Day MC; Hawthorne FC
    Acta Crystallogr A Found Adv; 2022 May; 78(Pt 3):212-233. PubMed ID: 35502713
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Seeing the results of a mutation with a vertex weighted hierarchical graph.
    Knisley DJ; Knisley JR
    BMC Proc; 2014; 8(Suppl 2 Proceedings of the 3rd Annual Symposium on Biologica):S7. PubMed ID: 25237394
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Pointed drawings of planar graphs.
    Aichholzer O; Rote G; Schulz A; Vogtenhuber B
    Comput Geom; 2012 Nov; 45(9):482-494. PubMed ID: 23471372
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Tangled piecewise-linear embeddings of trivalent graphs.
    O'Keeffe M; Treacy MMJ
    Acta Crystallogr A Found Adv; 2022 Mar; 78(Pt 2):128-138. PubMed ID: 35230268
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A radial adaptation of the Sugiyama framework for visualizing hierarchical information.
    Bachmaier C
    IEEE Trans Vis Comput Graph; 2007; 13(3):583-94. PubMed ID: 17356223
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A neural-network algorithm for a graph layout problem.
    Cimikowski A; Shope P
    IEEE Trans Neural Netw; 1996; 7(2):341-5. PubMed ID: 18255588
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Genus Ranges of 4-Regular Rigid Vertex Graphs.
    Buck D; Dolzhenko E; Jonoska N; Saito M; Valencia K
    Electron J Comb; 2015; 22(3):. PubMed ID: 27807395
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Relative timing information and orthology in evolutionary scenarios.
    Schaller D; Hartmann T; Lafond M; Stadler PF; Wieseke N; Hellmuth M
    Algorithms Mol Biol; 2023 Nov; 18(1):16. PubMed ID: 37940998
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Total Irregularity Strengths of an Arbitrary Disjoint Union of (3,6)- Fullerenes.
    Shabbir A; Nadeem MF; Ovais A; Ashraf F; Nasir S
    Comb Chem High Throughput Screen; 2022; 25(3):500-509. PubMed ID: 33297913
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Bounds on the Partition Dimension of Convex Polytopes.
    Liu JB; Nadeem MF; Azeem M
    Comb Chem High Throughput Screen; 2022; 25(3):547-553. PubMed ID: 33280591
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Untangling tanglegrams: comparing trees by their drawings.
    Venkatachalam B; Apple J; St John K; Gusfield D
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):588-97. PubMed ID: 20530818
    [TBL] [Abstract][Full Text] [Related]  

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

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

    [Next]    [New Search]
    of 7.