2 citations · 3 across the 5 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2024
A Three-Stage Algorithm for the Closest String Problem on Artificial and Real Gene Sequences
Alireza Abdi, Marko Djukanovic, Hesam Tahmasebi Boldaji +2
The Closest String Problem is an NP-hard problem that aims to find a string that has the minimum distance from all sequences that belong to the given set of strings. Its applicatio…
cs.AI2022★ 2 cited
Longest Common Substring in Longest Common Subsequence's Solution Service: A Novel Hyper-Heuristic
Alireza Abdi, Masih Hajsaeedi, Mohsen Hooshmand
The Longest Common Subsequence (LCS) is the problem of finding a subsequence among a set of strings that has two properties of being common to all and is the longest. The LCS has a…