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 *

190 related articles for article (PubMed ID: 22286085)

  • 1. A hyper-heuristic for the Longest Common Subsequence problem.
    Tabataba FS; Mousavi SR
    Comput Biol Chem; 2012 Feb; 36():42-54. PubMed ID: 22286085
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Longest common substring in Longest Common Subsequence's solution service: A novel hyper-heuristic.
    Abdi A; Hajsaeedi M; Hooshmand M
    Comput Biol Chem; 2023 Aug; 105():107882. PubMed ID: 37244077
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Deposition and extension approach to find longest common subsequence for thousands of long sequences.
    Ning K
    Comput Biol Chem; 2010 Jun; 34(3):149-57. PubMed ID: 20570215
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm.
    Ning K; Leong HW
    BMC Bioinformatics; 2006 Dec; 7 Suppl 4(Suppl 4):S12. PubMed ID: 17217504
    [TBL] [Abstract][Full Text] [Related]  

  • 6. An improved heuristic for haplotype inference.
    Ramadhani S; Mousavi SR; Talebi M
    Gene; 2012 Oct; 507(2):177-82. PubMed ID: 22776766
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
    Yang J; Xu Y; Shang Y; Chen G
    IEEE Trans Knowl Data Eng; 2014 Nov; 26(11):2599-2609. PubMed ID: 25400485
    [TBL] [Abstract][Full Text] [Related]  

  • 8. An enhanced beam search algorithm for the Shortest Common Supersequence Problem.
    Mousavi SR; Bahri F; Tabataba FS
    Eng Appl Artif Intell; 2012 Apr; 25(3):457-467. PubMed ID: 32288320
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems.
    Sabar NR; Ayob M; Kendall G; Qu R
    IEEE Trans Cybern; 2015 Feb; 45(2):217-28. PubMed ID: 24951713
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A rate distortion optimal ECG coding algorithm.
    Nygaard R; Melnikov G; Katsaggelos AK
    IEEE Trans Biomed Eng; 2001 Jan; 48(1):28-40. PubMed ID: 11235588
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Exemplar longest common subsequence.
    Bonizzoni P; Della Vedova G; Dondi R; Fertin G; Rizzi R; Vialette S
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):535-43. PubMed ID: 17975265
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem.
    Drake JH; Özcan E; Burke EK
    Evol Comput; 2016; 24(1):113-41. PubMed ID: 25635698
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A new approach to population sizing for memetic algorithms: a case study for the multidimensional assignment problem.
    Karapetyan D; Gutin G
    Evol Comput; 2011; 19(3):345-71. PubMed ID: 20868263
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Hyper-heuristics with low level parameter adaptation.
    Ren Z; Jiang H; Xuan J; Luo Z
    Evol Comput; 2012; 20(2):189-227. PubMed ID: 22171917
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Tag SNP selection via a genetic algorithm.
    Mahdevar G; Zahiri J; Sadeghi M; Nowzari-Dalini A; Ahrabian H
    J Biomed Inform; 2010 Oct; 43(5):800-4. PubMed ID: 20546935
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A hybrid metaheuristic for closest string problem.
    Mousavi SR
    Int J Comput Biol Drug Des; 2011; 4(3):245-61. PubMed ID: 21778558
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A new evolutionary algorithm with structure mutation for the maximum balanced biclique problem.
    Yuan B; Li B; Chen H; Yao X
    IEEE Trans Cybern; 2015 May; 45(5):1040-53. PubMed ID: 25137737
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Formal analysis, hardness, and algorithms for extracting internal structure of test-based problems.
    Jaśkowski W; Krawiec K
    Evol Comput; 2011; 19(4):639-71. PubMed ID: 21815770
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Discretized learning automata solutions to the capacity assignment problem for prioritized networks.
    Oommen BJ; Roberts TD
    IEEE Trans Syst Man Cybern B Cybern; 2002; 32(6):821-31. PubMed ID: 18244888
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing.
    Guo M; Chang WL; Ho M; Lu J; Cao J
    Biosystems; 2005 Apr; 80(1):71-82. PubMed ID: 15740836
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.