Sciweavers

1632 search results - page 182 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
DIS
2004
Springer
16 years 6 days ago
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance
We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is...
Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö,...
RECOMB
2006
Springer
16 years 7 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
HIS
2008
15 years 8 months ago
Hybrid Approach for Machine Scheduling Optimization in Custom Furniture Industry
Machine scheduling is a critical problem in industries where products are custom-designed. The wide range of products, the lack of previous experiences in manufacturing, and the s...
Juan Carlos Vidal, Manuel Mucientes, Alberto Bugar...
SPIRE
2005
Springer
16 years 9 days ago
An Edit Distance Between RNA Stem-Loops
We introduce the notion of conservative edit distance and mapping between two RNA stem-loops. We show that unlike the general edit distance between RNA secondary structures, the co...
Valentin Guignon, Cedric Chauve, Sylvie Hamel
COMGEO
2011
ACM
15 years 1 months ago
Stabbers of line segments in the plane
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the follo...
Mercè Claverol, Delia Garijo, Clara I. Grim...