Beam search for the longest common subsequence problem
The longest common subsequence problem is a classical string problem that concerns
finding the common part of a set of strings. It has several important applications, for example …
finding the common part of a set of strings. It has several important applications, for example …
Finding longest common subsequences: new anytime A∗ search results
Abstract The Longest Common Subsequence (LCS) problem aims at finding a longest string
that is a subsequence of each string from a given set of input strings. This problem has …
that is a subsequence of each string from a given set of input strings. This problem has …
A beam search for the longest common subsequence problem guided by a novel approximate expected length calculation
The longest common subsequence problem (LCS) aims at finding a longest string that
appears as subsequence in each of a given set of input strings. This is a well known NP …
appears as subsequence in each of a given set of input strings. This is a well known NP …
An improved algorithm for the longest common subsequence problem
SR Mousavi, F Tabataba - Computers & Operations Research, 2012 - Elsevier
Abstract The Longest Common Subsequence problem seeks a longest subsequence of
every member of a given set of strings. It has applications, among others, in data …
every member of a given set of strings. It has applications, among others, in data …
Learning beam search: Utilizing machine learning to guide beam search for solving combinatorial optimization problems
Beam search (BS) is a well-known incomplete breadth-first-search variant frequently used to
find heuristic solutions to hard combinatorial optimization problems. Its key ingredient is a …
find heuristic solutions to hard combinatorial optimization problems. Its key ingredient is a …
Chemical reaction optimization for solving longest common subsequence problem for multiple string
Longest common subsequence (LCS) is a well-known NP-hard optimization problem that
finds out the longest subsequence of each member of a given set of strings. In computational …
finds out the longest subsequence of each member of a given set of strings. In computational …
Solving the longest common subsequence problem concerning non-uniform distributions of letters in input strings
The longest common subsequence (LCS) problem is a prominent NP–hard optimization
problem where, given an arbitrary set of input strings, the aim is to find a longest …
problem where, given an arbitrary set of input strings, the aim is to find a longest …
A space-bounded anytime algorithm for the multiple longest common subsequence problem
The multiple longest common subsequence (MLCS) problem, related to the identification of
sequence similarity, is an important problem in many fields. As an NP-hard problem, its …
sequence similarity, is an important problem in many fields. As an NP-hard problem, its …
Longest common substring in Longest Common Subsequence's solution service: A novel hyper-heuristic
A Abdi, M Hajsaeedi, M Hooshmand - Computational Biology and …, 2023 - Elsevier
Abstract 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 the …
subsequence among a set of strings that has two properties of being common to all and the …
A hyper-heuristic for the longest common subsequence problem
FS Tabataba, SR Mousavi - Computational biology and chemistry, 2012 - Elsevier
The Longest Common Subsequence Problem is the problem of finding a longest string that
is a subsequence of every member of a given set of strings. It has applications in FPGA …
is a subsequence of every member of a given set of strings. It has applications in FPGA …