1421 search results - page 25 / 285 » Algorithms for subsequence combinatorics |
146
click to vote
CCO
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...
CPM
2009
Springer
15 years 4 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
CPM
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
COMBINATORICS
2006
14 years 9 months ago
2006
Existing tables of constant weight codes are mainly confined to codes of length n 28. This paper presents tables of codes of lengths 29 n 63. The motivation for creating these ...
COMBINATORICS
2006
14 years 9 months ago
2006
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...