Výsledky vyhledávání - "ABDI, ALIREZA"

Report

A Three-Stage Algorithm for the Closest String Problem on Artificial and Real Gene Sequences

Autor: Abdi, Alireza, Djukanovic, Marko, Boldaji, Hesam Tahmasebi, Salehi, Hadis, Kartelj, Aleksandar

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 applications can be found in coding theory, computational biology, and designing

Externí odkaz: http://arxiv.org/abs/2407.13023

Zobrazit plný text záznamu

Report

Longest Common Substring in Longest Common Subsequence's Solution Service: A Novel Hyper-Heuristic

Autor: Abdi, Alireza, Hajsaeedi, Masih, Hooshmand, Mohsen

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 applications in computational biology and text editing, among many othe

Externí odkaz: http://arxiv.org/abs/2212.03178

Zobrazit plný text záznamu

Report

Longest Common Subsequence: Tabular vs. Closed-Form Equation Computation of Subsequence Probability

Autor: Abdi, Alireza, Hooshmand, Mohsen

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 for lots of effort to find a better solution with heuristics methods.

Externí odkaz: http://arxiv.org/abs/2206.11726

Zobrazit plný text záznamu