Sciweavers

3320 search results - page 43 / 664
» Heuristics for the Phylogeny Problem
Sort
View
SOFSEM
2004
Springer
14 years 3 months ago
Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
14 years 2 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
IJFCS
2006
70views more  IJFCS 2006»
13 years 10 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
DAC
2004
ACM
14 years 11 months ago
Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions
This paper presents the Quantum-Dot Cellular Automata (QCA) physical design problem, in the context of the VLSI physical design problem. The problem is divided into three subprobl...
Dominic A. Antonelli, Danny Z. Chen, Timothy J. Dy...
CIMCA
2005
IEEE
14 years 3 months ago
A GRASP with Adaptive Memory for a Period Vehicle Routing Problem
We present some proposals to approximately solve a period vehicle routing problem used to model the extraction of oil from a set of onshore oil wells in Brazil. This problem diffe...
Luciana B. Goncalves, Luiz Satoru Ochi, Simone L. ...