Sciweavers

122 search results - page 5 / 25
» A Short Cut to Optimal Sequences
Sort
View
EOR
2006
73views more  EOR 2006»
14 years 9 months ago
Enforcing minimum run length in the cutting stock problem
Deckling, cutting stock or trim loss problems arise when small units are to be fitted into large ones. One aims to reduce stock usage and setups, then favors long runs, surplus ov...
Adolf Diegel, Garth Miller, Edouard Montocchio, Si...
SCIA
2007
Springer
119views Image Analysis» more  SCIA 2007»
15 years 3 months ago
Watertight Multi-view Reconstruction Based on Volumetric Graph-Cuts
This paper proposes a fast 3D reconstruction approach for efficiently generating watertight 3D models from multiple short baseline views. Our method is based on the combination of...
Mario Sormann, Christopher Zach, Joachim Bauer, Ko...
AAAI
2000
14 years 11 months ago
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
Richard E. Korf, Weixiong Zhang
BIBM
2010
IEEE
156views Bioinformatics» more  BIBM 2010»
14 years 7 months ago
Truncation of protein sequences for fast profile alignment with application to subcellular localization
We have recently found that the computation time of homology-based subcellular localization can be substantially reduced by aligning profiles up to the cleavage site positions of s...
Man-Wai Mak, Wei Wang, Sun-Yuan Kung
BIBE
2007
IEEE
128views Bioinformatics» more  BIBE 2007»
15 years 3 months ago
QOMA2: Optimizing the alignment of many sequences
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
Xu Zhang, Tamer Kahveci