1215 search results - page 149 / 243 » Combinatorics |
165
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
A single logical entity can be referred to by several different names over a large text corpus. We present our algorithm for finding all suchco-reference sets in a large corpus. Ou...
199
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
162
click to vote
COCOON
1995
Springer
15 years 9 months ago
1995
Springer
A Craig interpolant of two inconsistent theories is a formula which is true in one and false in the other. This paper gives an eificient method for constructing a Craig interpolant...
182
click to vote
COCOON
2006
Springer
15 years 8 months ago
2006
Springer
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
177
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...