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 *

285 related articles for article (PubMed ID: 29994050)

  • 21. SING: subgraph search in non-homogeneous graphs.
    Di Natale R; Ferro A; Giugno R; Mongiovì M; Pulvirenti A; Shasha D
    BMC Bioinformatics; 2010 Feb; 11():96. PubMed ID: 20170516
    [TBL] [Abstract][Full Text] [Related]  

  • 22. A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance.
    Kannan L; Li H; Mushegian A
    J Comput Biol; 2011 May; 18(5):743-57. PubMed ID: 21166560
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A dynamic programming algorithm to predict synthesis processes of tree-structured compounds with graph grammar.
    Zhao Y; Tamura T; Hayashida M; Akutsu T
    Genome Inform; 2010; 24():218-29. PubMed ID: 22081602
    [TBL] [Abstract][Full Text] [Related]  

  • 24. The combinatorics of discrete time-trees: theory and open problems.
    Gavryushkin A; Whidden C; Matsen FA
    J Math Biol; 2018 Apr; 76(5):1101-1121. PubMed ID: 28756523
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Heuristics for chemical compound matching.
    Hattori M; Okuno Y; Goto S; Kanehisa M
    Genome Inform; 2003; 14():144-53. PubMed ID: 15706529
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Enumeration Method for Structural Isomers Containing User-Defined Structures Based on Breadth-First Search Approach.
    Jindalertudomdee J; Hayashida M; Akutsu T
    J Comput Biol; 2016 Aug; 23(8):625-40. PubMed ID: 27348756
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Minimally colored trees.
    Rinsma I; Hendy M; Penny D
    Math Biosci; 1990 Mar; 98(2):201-10. PubMed ID: 2134502
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Enumeration method for tree-like chemical compounds with benzene rings and naphthalene rings by breadth-first search order.
    Jindalertudomdee J; Hayashida M; Zhao Y; Akutsu T
    BMC Bioinformatics; 2016 Mar; 17():113. PubMed ID: 26932529
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Constructing splits graphs.
    Dress AW; Huson DH
    IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(3):109-15. PubMed ID: 17048386
    [TBL] [Abstract][Full Text] [Related]  

  • 30. The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures.
    Gao W; Wang W
    Comput Math Methods Med; 2015; 2015():418106. PubMed ID: 26640513
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Designing an A* algorithm for calculating edit distance between rooted-unordered trees.
    Horesh Y; Mehr R; Unger R
    J Comput Biol; 2006; 13(6):1165-76. PubMed ID: 16901235
    [TBL] [Abstract][Full Text] [Related]  

  • 32. BrownieAligner: accurate alignment of Illumina sequencing data to de Bruijn graphs.
    Heydari M; Miclotte G; Van de Peer Y; Fostier J
    BMC Bioinformatics; 2018 Sep; 19(1):311. PubMed ID: 30180801
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Graph automorphism perception algorithms in computer-enhanced structure elucidation.
    Razinger M; Balasubramanian K; Munk ME
    J Chem Inf Comput Sci; 1993; 33(2):197-201. PubMed ID: 8314927
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Exact parallel maximum clique algorithm for general and protein graphs.
    Depolli M; Konc J; Rozman K; Trobec R; Janežič D
    J Chem Inf Model; 2013 Sep; 53(9):2217-28. PubMed ID: 23965016
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Algorithms for reticulate networks of multiple phylogenetic trees.
    Chen ZZ; Wang L
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):372-84. PubMed ID: 22025766
    [TBL] [Abstract][Full Text] [Related]  

  • 36. A Fiedler Vector Scoring Approach for Novel RNA Motif Selection.
    Zhu Q; Schlick T
    J Phys Chem B; 2021 Feb; 125(4):1144-1155. PubMed ID: 33471540
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Enumerating consistent sub-graphs of directed acyclic graphs: an insight into biomedical ontologies.
    Peng Y; Jiang Y; Radivojac P
    Bioinformatics; 2018 Jul; 34(13):i313-i322. PubMed ID: 29949985
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 40. Mining the Enriched Subgraphs for Specific Vertices in a Biological Graph.
    Meysman P; Saeys Y; Sabaghian E; Bittremieux W; Van de Peer Y; Goethals B; Laukens K
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(5):1496-1507. PubMed ID: 27295680
    [TBL] [Abstract][Full Text] [Related]  

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