Sciweavers

293 search results - page 21 / 59
» Fixed-Parameter Algorithms in Phylogenetics
Sort
View
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
16 years 3 days ago
Optimal phylogenetic reconstruction
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
Constantinos Daskalakis, Elchanan Mossel, Sé...
CIAC
2010
Springer
281views Algorithms» more  CIAC 2010»
14 years 8 months ago
Parameterized Complexity of Even/Odd Subgraph Problems
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
Leizhen Cai, Boting Yang
EVOW
2008
Springer
15 years 1 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...
ICISC
2004
112views Cryptology» more  ICISC 2004»
15 years 1 months ago
Improvement on Ha-Moon Randomized Exponentiation Algorithm
Randomized recoding on the exponent of an exponentiation computation into a signed-digit representation has been a well known countermeasure against some side-channel attacks. Howe...
Sung-Ming Yen, Chien-Ning Chen, Sang-Jae Moon, Jae...
CIAC
2010
Springer
251views Algorithms» more  CIAC 2010»
15 years 9 months ago
A parameterized algorithm for Chordal Sandwich
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
Pinar Heggernes, Federico Mancini, Jesper Nederlof...