Sciweavers

1200 search results - page 11 / 240
» Marked Ancestor Problems
Sort
View
WSC
1998
13 years 11 months ago
Warehouse Design through Dynamic Simulation
Intel's new processors in mid-1997 were a dramatic increased in speed and size over their ancestors. The increased size caused box volume to increase beyond the capacity of t...
Mark Kosfeld
JAIR
2008
94views more  JAIR 2008»
13 years 9 months ago
The Ultrametric Constraint and its Application to Phylogenetics
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phyl...
Neil C. A. Moore, Patrick Prosser
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
14 years 3 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
EVOW
2008
Springer
13 years 11 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...
ISAAC
2009
Springer
127views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
Laurent Bulteau, Guillaume Fertin, Irena Rusu