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 *

148 related articles for article (PubMed ID: 24955135)

  • 21. Efficient enumeration of stereoisomers of outerplanar chemical graphs using dynamic programming.
    Imada T; Ota S; Nagamochi H; Akutsu T
    J Chem Inf Model; 2011 Nov; 51(11):2788-807. PubMed ID: 21848281
    [TBL] [Abstract][Full Text] [Related]  

  • 22. An Inverse QSAR Method Based on a Two-Layered Model and Integer Programming.
    Shi Y; Zhu J; Azam NA; Haraguchi K; Zhao L; Nagamochi H; Akutsu T
    Int J Mol Sci; 2021 Mar; 22(6):. PubMed ID: 33799613
    [TBL] [Abstract][Full Text] [Related]  

  • 23. The Steiner cycle and path cover problem on interval graphs.
    Ćustić A; Lendl S
    J Comb Optim; 2022; 43(1):226-234. PubMed ID: 35125930
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 26. An extended dual graph library and partitioning algorithm applicable to pseudoknotted RNA structures.
    Jain S; Saju S; Petingi L; Schlick T
    Methods; 2019 Jun; 162-163():74-84. PubMed ID: 30928508
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
    Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
    BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
    [TBL] [Abstract][Full Text] [Related]  

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

  • 29. On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types.
    Zhang Y; Phillips CA; Rogers GL; Baker EJ; Chesler EJ; Langston MA
    BMC Bioinformatics; 2014 Apr; 15():110. PubMed ID: 24731198
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Unicyclic networks: compatibility and enumeration.
    Semple C; Steel M
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(1):84-91. PubMed ID: 17048395
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Parallelization of enumerating tree-like chemical compounds by breadth-first search order.
    Hayashida M; Jindalertudomdee J; Zhao Y; Akutsu T
    BMC Med Genomics; 2015; 8 Suppl 2(Suppl 2):S15. PubMed ID: 26044861
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Discriminative Feature Selection for Uncertain Graph Classification.
    Kong X; Yu PS; Wang X; Ragin AB
    Proc SIAM Int Conf Data Min; 2013; 2013():82-93. PubMed ID: 25949925
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Reaction route graphs. III. Non-minimal kinetic mechanisms.
    Fishtik I; Callaghan CA; Datta R
    J Phys Chem B; 2005 Feb; 109(7):2710-22. PubMed ID: 16851279
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Getting new algorithmic results by extending distance-hereditary graphs via split composition.
    Cicerone S; Di Stefano G
    PeerJ Comput Sci; 2021; 7():e627. PubMed ID: 34307866
    [TBL] [Abstract][Full Text] [Related]  

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

  • 36. Multi-way association extraction and visualization from biological text documents using hyper-graphs: applications to genetic association studies for diseases.
    Mukhopadhyay S; Palakal M; Maddu K
    Artif Intell Med; 2010 Jul; 49(3):145-54. PubMed ID: 20382004
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Enumerating all possible biosynthetic pathways in metabolic networks.
    Ravikrishnan A; Nasre M; Raman K
    Sci Rep; 2018 Jul; 8(1):9932. PubMed ID: 29967471
    [TBL] [Abstract][Full Text] [Related]  

  • 38. A Branch-and-Bound Approach for Tautomer Enumeration.
    Thalheim T; Wagner B; Kühne R; Middendorf M; Schüürmann G
    Mol Inform; 2015 May; 34(5):263-75. PubMed ID: 27490272
    [TBL] [Abstract][Full Text] [Related]  

  • 39. The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.
    Ganian R; Ordyniak S
    Algorithmica; 2021; 83(2):726-752. PubMed ID: 33707803
    [TBL] [Abstract][Full Text] [Related]  

  • 40. The maximum clique enumeration problem: algorithms, applications, and implementations.
    Eblen JD; Phillips CA; Rogers GL; Langston MA
    BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S5. PubMed ID: 22759429
    [TBL] [Abstract][Full Text] [Related]  

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