Sciweavers

415 search results - page 1 / 83
» New Results for the 2-Interval Pattern Problem
Sort
View
CPM
2004
Springer
97views Combinatorics» more  CPM 2004»
14 years 1 months ago
New Results for the 2-Interval Pattern Problem
Guillaume Blin, Guillaume Fertin, Stéphane ...
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
14 years 1 months ago
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
Hao Yuan, Linji Yang, Erdong Chen
AAIM
2007
Springer
145views Algorithms» more  AAIM 2007»
14 years 2 months ago
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
We study three closely related problems motivated by the prediction of RNA secondary structures with arbitrary pseudoknots: the MAXIMUM BASE PAIR STACKINGS problem proposed by Ieon...
Minghui Jiang
FCT
2005
Springer
14 years 1 months ago
A New Linearizing Restriction in the Pattern Matching Problem
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
Yo-Sub Han, Derick Wood
COMPGEOM
1999
ACM
14 years 6 days ago
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
Erik D. Demaine, Martin L. Demaine, Joseph S. B. M...