140
Voted
CPM
15 years 5 months ago
2008 Springer  153
Voted
COCOON
15 years 5 months ago
2008 Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
143
Voted
CPM
15 years 5 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...
132
Voted
CPM
15 years 5 months ago
2008 Springer 
Let G be an unweighted and undirected graph of n nodes, and let D be the n
130
Voted
CPM
15 years 5 months ago
2008 Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
|
Combinatorics