139 related articles for article (PubMed ID: 37244077)
1. 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]
2. 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]
3. Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints.
Wang X; Wang L; Zhu D
J Comput Biol; 2019 Sep; 26(9):938-947. PubMed ID: 30958704
[No Abstract] [Full Text] [Related]
4. 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]
5. 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]
6. 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]
7. 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]
8. EHHR: an efficient evolutionary hyper-heuristic based recommender framework for short-text classifier selection.
Almas B; Mujtaba H; Khan KU
Cluster Comput; 2023; 26(2):1425-1446. PubMed ID: 36247806
[TBL] [Abstract][Full Text] [Related]
9. Automatic ICD-10 coding algorithm using an improved longest common subsequence based on semantic similarity.
Chen Y; Lu H; Li L
PLoS One; 2017; 12(3):e0173410. PubMed ID: 28306739
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. A Hidden Markov Model Approach to the Problem of Heuristic Selection in Hyper-Heuristics with a Case Study in High School Timetabling Problems.
Kheiri A; Keedwell E
Evol Comput; 2017; 25(3):473-501. PubMed ID: 27258841
[TBL] [Abstract][Full Text] [Related]
12. An alignment-free heuristic for fast sequence comparisons with applications to phylogeny reconstruction.
Chockalingam SP; Pannu J; Hooshmand S; Thankachan SV; Aluru S
BMC Bioinformatics; 2020 Nov; 21(Suppl 6):404. PubMed ID: 33203364
[TBL] [Abstract][Full Text] [Related]
13. Improved algorithms for approximate string matching (extended abstract).
Papamichail D; Papamichail G
BMC Bioinformatics; 2009 Jan; 10 Suppl 1(Suppl 1):S10. PubMed ID: 19208109
[TBL] [Abstract][Full Text] [Related]
14. A new algorithm for "the LCS problem" with application in compressing genome resequencing data.
Beal R; Afrin T; Farheen A; Adjeroh D
BMC Genomics; 2016 Aug; 17 Suppl 4(Suppl 4):544. PubMed ID: 27556803
[TBL] [Abstract][Full Text] [Related]
15. An OpenMP-based tool for finding longest common subsequence in bioinformatics.
Shikder R; Thulasiraman P; Irani P; Hu P
BMC Res Notes; 2019 Apr; 12(1):220. PubMed ID: 30971295
[TBL] [Abstract][Full Text] [Related]
16. Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes
Lissovoi A; Oliveto PS; Warwicker JA
Evol Comput; 2020; 28(3):437-461. PubMed ID: 31120773
[TBL] [Abstract][Full Text] [Related]
17. A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling.
Hart E; Sim K
Evol Comput; 2016; 24(4):609-635. PubMed ID: 27120113
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. Offline Learning with a Selection Hyper-Heuristic: An Application to Water Distribution Network Optimisation.
Yates WB; Keedwell EC
Evol Comput; 2021 Jun; 29(2):187-210. PubMed ID: 32567958
[TBL] [Abstract][Full Text] [Related]
20. Fast exact algorithms for the closest string and substring problems with application to the planted (L, d)-motif model.
Chen ZZ; Wang L
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1400-10. PubMed ID: 21282867
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
