scientific article; zbMATH DE number 910876
From MaRDI portal
Publication:4886050
zbMATH Open0849.68117MaRDI QIDQ4886050FDOQ4886050
Authors: Karen E. Daniels, Victor J. Milenkovic
Publication date: 4 November 1996
Title of this publication is not available (Why is that?)
Recommendations
- Multiple translational containment. I: An approximate algorithm
- Multiple translational containment. II: Exact algorithms
- Approximation algorithms for multiple sequence alignment
- Approximation algorithms for the maximum multiple RNA interaction problem
- Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree
- Approximating the maximum multiple RNA interaction problem
- A fast algorithm for the constrained multiple sequence alignment problem
- scientific article; zbMATH DE number 2243049
- The containment condition and AdapFail algorithms
- Algorithms and Computation
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (9)
- Column-based strip packing using ordered and compliant containment
- The polygonal containment model
- A heuristic algorithm for solving triangle packing problem
- Multiple translational containment. II: Exact algorithms
- Title not available (Why is that?)
- A customized branch-and-bound approach for irregular shape nesting
- A fully general, exact algorithm for nesting irregular shapes
- Computing closely matching upper and lower bounds on textile nesting problems
- Multiple translational containment. I: An approximate algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886050)