Sciweavers

128
Voted
JCSS
2002
95views more  JCSS 2002»
15 years 2 months ago
Efficient algorithms for multichromosomal genome rearrangements
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
Glenn Tesler
121
Voted
JCSS
2002
86views more  JCSS 2002»
15 years 2 months ago
A New Proof of the Weak Pigeonhole Principle
The exact complexity of the weak pigeonhole principle is an old and fundamental problem in proof complexity. Using a diagonalization argument, Paris, Wilkieand Woods 16] showed ho...
Alexis Maciel, Toniann Pitassi, Alan R. Woods
143
Voted
JCSS
2002
95views more  JCSS 2002»
15 years 2 months ago
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao
114
Voted
JCSS
2002
59views more  JCSS 2002»
15 years 2 months ago
Finding Similar Regions in Many Sequences
Ming Li, Bin Ma, Lusheng Wang
JCSS
2002
43views more  JCSS 2002»
15 years 2 months ago
Querying Incomplete Information in Semistructured Data
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
106
Voted
JCSS
2002
55views more  JCSS 2002»
15 years 2 months ago
Uniform constant-depth threshold circuits for division and iterated multiplication
William Hesse, Eric Allender, David A. Mix Barring...
JCSS
2002
51views more  JCSS 2002»
15 years 2 months ago
A Framework for Measuring Differences in Data Characteristics
Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishn...
101
Voted
JCSS
2002
84views more  JCSS 2002»
15 years 2 months ago
Output String Languages of Compositions of Deterministic Macro Tree Transducers
Joost Engelfriet, Sebastian Maneth
143
Voted
JCSS
2002
199views more  JCSS 2002»
15 years 2 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
106
Voted
JCSS
2002
94views more  JCSS 2002»
15 years 2 months ago
Query Strategies for Priced Information
Moses Charikar, Ronald Fagin, Venkatesan Guruswami...