Sciweavers

8431 search results - page 275 / 1687
» Algorithmically Independent Sequences
Sort
View
BMCBI
2007
153views more  BMCBI 2007»
15 years 6 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar
HPDC
2006
IEEE
16 years 22 days ago
Exploring I/O Strategies for Parallel Sequence-Search Tools with S3aSim
Parallel sequence-search tools are rising in popularity among computational biologists. With the rapid growth of sequence databases, database segmentation is the trend of the futu...
Avery Ching, Wu-chun Feng, Heshan Lin, Xiaosong Ma...
COR
2007
106views more  COR 2007»
15 years 6 months ago
On a stochastic sequencing and scheduling problem
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
Antonio Alonso-Ayuso, Laureano F. Escudero, M. Ter...
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
16 years 24 days ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
16 years 6 months ago
Space-Efficient Online Computation of Quantile Summaries
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
Michael Greenwald, Sanjeev Khanna