Sciweavers

5165 search results - page 721 / 1033
» Consistency of the Neighbor-Net Algorithm
Sort
View
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
15 years 6 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
138
Voted
STRINGOLOGY
2008
15 years 6 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
130
Voted
AAAI
2004
15 years 6 months ago
Hiding Satisfying Assignments: Two Are Better than One
The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
Dimitris Achlioptas, Haixia Jia, Cristopher Moore
AAAI
2006
15 years 6 months ago
Efficient Haplotype Inference with Boolean Satisfiability
One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technolo...
Inês Lynce, João Marques-Silva
ACID
2006
236views Algorithms» more  ACID 2006»
15 years 6 months ago
Kernelization for Convex Recoloring
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....