1421 search results - page 52 / 285 » Algorithms for subsequence combinatorics |
107
Voted
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
104
click to vote
CPM
2006
Springer
15 years 6 months ago
2006
Springer
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
136
click to vote
COCOON
2010
Springer
15 years 6 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
112
click to vote
STOC
2001
ACM
16 years 3 months ago
2001
ACM
Let G = (V, E) be an undirected weighted graph with |V | = n and |E| = m. Let k 1 be an integer. We show that G = (V, E) can be preprocessed in O(kmn1/k ) expected time, construc...
125
click to vote
ICIAP
2001
Springer
16 years 3 months ago
2001
Springer
We describe an algorithm for the automatic features detection in 2D color images of human faces. The algorithm proceeds with subsequent refinements. First, it identifies the sub-i...