2 citations · 3 across the 5 of their papers we have counts for
5 papers
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…
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…
Longest Common Subsequence: Tabular vs. Closed-Form Equation Computation of Subsequence Probability
Alireza Abdi, Mohsen Hooshmand
The Longest Common Subsequence Problem (LCS) deals with finding the longest subsequence among a given set of strings. The LCS problem is an NP-hard problem which makes it a target…
Lower Bounds for Cover-Free Families
Ali Z. Abdi, Nader H. Bshouty
Let be a set of blocks of a -set . is called -cover-free family (CFF) provided that, the intersection of any blocks in …
Learning Boolean Halfspaces with Small Weights from Membership Queries
Hasan Abasi, Ali Z. Abdi, Nader H. Bshouty
We consider the problem of proper learning a Boolean Halfspace with integer weights from membership queries only. The best known algorithm for this problem is an…