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 *

281 related articles for article (PubMed ID: 30356262)

  • 1. Exploring efficient grouping algorithms in regular expression matching.
    Xu C; Su J; Chen S
    PLoS One; 2018; 13(10):e0206068. PubMed ID: 30356262
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Offset-FA: A Uniform Method to Handle Both Unbounded and Bounded Repetitions in Regular Expression Matching.
    Xu C; Yu K; Xu X; Bao X; Wu S; Zhao B
    Sensors (Basel); 2022 Oct; 22(20):. PubMed ID: 36298132
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Efficient Deterministic Finite Automata Minimization Based on Backward Depth Information.
    Liu D; Huang Z; Zhang Y; Guo X; Su S
    PLoS One; 2016; 11(11):e0165864. PubMed ID: 27806102
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A memory-efficient deterministic finite automaton-based bit-split string matching scheme using pattern uniqueness in deep packet inspection.
    Kim H; Choi KI; Choi SI
    PLoS One; 2015; 10(5):e0126517. PubMed ID: 25938779
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Learning deterministic finite automata with a smart state labeling evolutionary algorithm.
    Lucas SM; Reynolds TJ
    IEEE Trans Pattern Anal Mach Intell; 2005 Jul; 27(7):1063-74. PubMed ID: 16013754
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Stable encoding of large finite-state automata in recurrent neural networks with sigmoid discriminants.
    Omlin CW; Giles CL
    Neural Comput; 1996 May; 8(4):675-96. PubMed ID: 8624958
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Faster exact Markovian probability functions for motif occurrences: a DFA-only approach.
    Ribeca P; Raineri E
    Bioinformatics; 2008 Dec; 24(24):2839-48. PubMed ID: 18845582
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A hybrid learning method for constructing compact rule-based fuzzy models.
    Zhao W; Niu Q; Li K; Irwin GW
    IEEE Trans Cybern; 2013 Dec; 43(6):1807-21. PubMed ID: 23757574
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem.
    Lu Z; Zhou Y; Hao JK
    IEEE Trans Cybern; 2022 Sep; 52(9):9391-9403. PubMed ID: 33635807
    [TBL] [Abstract][Full Text] [Related]  

  • 10. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A forecast-based STDP rule suitable for neuromorphic implementation.
    Davies S; Galluppi F; Rast AD; Furber SB
    Neural Netw; 2012 Aug; 32():3-14. PubMed ID: 22386500
    [TBL] [Abstract][Full Text] [Related]  

  • 12. The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.
    Altarelli F; Braunstein A; Dall'Asta L; De Bacco C; Franz S
    PLoS One; 2015; 10(12):e0145222. PubMed ID: 26710102
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Heuristic search in constrained bipartite matching with applications to protein NMR backbone resonance assignment.
    Lin G; Tegos T; Chen ZZ
    J Bioinform Comput Biol; 2005 Dec; 3(6):1331-50. PubMed ID: 16374910
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A path following algorithm for the graph matching problem.
    Zaslavskiy M; Bach F; Vert JP
    IEEE Trans Pattern Anal Mach Intell; 2009 Dec; 31(12):2227-42. PubMed ID: 19834143
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A deterministic annealing algorithm for approximating a solution of the min-bisection problem.
    Dang C; Ma W; Liang J
    Neural Netw; 2009 Jan; 22(1):58-66. PubMed ID: 18995985
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Greedy rule generation from discrete data and its use in neural network rule extraction.
    Odajima K; Hayashi Y; Tianxia G; Setiono R
    Neural Netw; 2008 Sep; 21(7):1020-8. PubMed ID: 18442894
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Learning graph matching.
    Caetano TS; McAuley JJ; Cheng L; Le QV; Smola AJ
    IEEE Trans Pattern Anal Mach Intell; 2009 Jun; 31(6):1048-58. PubMed ID: 19372609
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Multi-GPU implementation of a VMAT treatment plan optimization algorithm.
    Tian Z; Peng F; Folkerts M; Tan J; Jia X; Jiang SB
    Med Phys; 2015 Jun; 42(6):2841-52. PubMed ID: 26127037
    [TBL] [Abstract][Full Text] [Related]  

  • 19. RMHIL: A Rule Matching Algorithm Based on Heterogeneous Integrated Learning in Software Defined Network.
    Guo Y; Hu G; Shao D
    Sensors (Basel); 2022 Jun; 22(13):. PubMed ID: 35808236
    [TBL] [Abstract][Full Text] [Related]  

  • 20. The k partition-distance problem.
    Chen YH
    J Comput Biol; 2012 Apr; 19(4):404-17. PubMed ID: 22468708
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 15.