Sciweavers

CPM
2007
Springer
98views Combinatorics» more  CPM 2007»
13 years 9 months ago
Space-Efficient Algorithms for Document Retrieval
Niko Välimäki, Veli Mäkinen
COCOON
2007
Springer
13 years 9 months ago
Efficient Testing of Forecasts
Each day a weather forecaster predicts a probability of each type of weather for the next day. After n days, all the predicted probabilities and the real weather data are sent to a...
Ching-Lueh Chang, Yuh-Dauh Lyuu
COCOON
2007
Springer
13 years 9 months ago
Improved Exact Algorithms for Counting 3- and 4-Colorings
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh
COCOON
2007
Springer
13 years 9 months ago
An Improved Algorithm for Online Unit Clustering
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
Hamid Zarrabi-Zadeh, Timothy M. Chan
COCOON
2007
Springer
13 years 9 months ago
Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
This paper deals with problems which fall into the domain of selfish scheduling: a protocol is in charge of building a schedule for a set of tasks without directly knowing their l...
George Christodoulou, Laurent Gourvès, Fann...
CPM
1992
Springer
200views Combinatorics» more  CPM 1992»
13 years 9 months ago
Heaviest Increasing/Common Subsequence Problems
Guy Jacobson, Kiem-Phong Vo
CPM
1992
Springer
97views Combinatorics» more  CPM 1992»
13 years 9 months ago
From Regular Expressions to DFA's Using Compressed NFA's
Chia-Hsiang Chang, Robert Paige
CPM
1994
Springer
97views Combinatorics» more  CPM 1994»
13 years 9 months ago
The Parameterized Complexity of Sequence Alignment and Consensus
Hans L. Bodlaender, Rodney G. Downey, Michael R. F...
CPM
1994
Springer
123views Combinatorics» more  CPM 1994»
13 years 9 months ago
Computing all Suboptimal Alignments in Linear Space
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
Kun-Mao Chao
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
13 years 9 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag