986 search results - page 128 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
142
Voted
RECOMB
2008
Springer
16 years 4 months ago
2008
Springer
Since the discovery of the "Philadelphia chromosome" in chronic myelogenous leukemia in 1960, there is an ongoing intensive research of chromosomal aberrations in cancer....
167
click to vote
CCECE
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
207
click to vote
ISLPED
1996
ACM
15 years 8 months ago
1996
ACM
In this paper, we study the simultaneous buffer and wire sizing (SBWS) problem for delay and power dissipation minimization. We prove the BS/WS relation for optimal SBWS solutions...
144
click to vote
RECOMB
2009
Springer
15 years 10 months ago
2009
Springer
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
107
click to vote
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...