Exploració per tema "LCS"
Ara es mostren els items 1-3 de 3
-
A hybrid metaheuristic for the longest common subsequence problem
(2010-10)
Article
Accés restringit per política de l'editorialThe longest common subsequence problem is a classical string problem. It has applications, for example, in pattern recognition and bioinformatics. This contribution proposes an integrative hybrid metaheuristic for this ... -
Bounding the expected length of longest common subsequences and forests
(1998-09-01)
Report de recerca
Accés obertWe present improvements to two techniques to find lower and upper bounds for the expected length of longest common subsequences and forests of two random sequences of the same length, over a fixed size, uniformly ... -
Bounding the expected length of longest common subsequences and forests
(1996-05)
Report de recerca
Accés obertSubsumed by LSI-98-50-R