1421 search results - page 31 / 285 » Algorithms for subsequence combinatorics |
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
71
Voted
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn , m n}) time and O(max{m, n}) s...
67
Voted
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
CPM
2006
Springer
15 years 1 months ago
2006
Springer
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...