JCSS 2002 | Sciweavers

11

JCSS
2002

95views more JCSS 2002»

Efficient algorithms for multichromosomal genome rearrangements

13 years 4 months ago

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

claim paper

Read More »

8

click to vote

JCSS
2002

86views more JCSS 2002»

A New Proof of the Weak Pigeonhole Principle

13 years 4 months ago

Download school.maths.uwa.edu.au

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

claim paper

Read More »

12

click to vote

JCSS
2002

95views more JCSS 2002»

Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis

13 years 4 months ago

Download www.csie.ntu.edu.tw

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

claim paper

Read More »

6

click to vote

JCSS
2002

59views more JCSS 2002»

13 years 4 months ago

Finding Similar Regions in Many Sequences

Download www.cs.cityu.edu.hk

Ming Li, Bin Ma, Lusheng Wang

claim paper

Read More »

6

click to vote

JCSS
2002

43views more JCSS 2002»

Querying Incomplete Information in Semistructured Data

13 years 4 months ago

Download lsirwww.epfl.ch

Yaron Kanza, Werner Nutt, Yehoshua Sagiv

claim paper

Read More »

6

click to vote

JCSS
2002

55views more JCSS 2002»

Uniform constant-depth threshold circuits for division and iterated multiplication

13 years 4 months ago

Download ftp.cs.rutgers.edu

William Hesse, Eric Allender, David A. Mix Barring...

claim paper

Read More »

5

click to vote

JCSS
2002

51views more JCSS 2002»

A Framework for Measuring Differences in Data Characteristics

13 years 4 months ago

Download www.cs.cornell.edu

Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishn...

claim paper

Read More »

7

click to vote

JCSS
2002

84views more JCSS 2002»

Output String Languages of Compositions of Deterministic Macro Tree Transducers

13 years 4 months ago

Download www.cse.unsw.edu.au

Joost Engelfriet, Sebastian Maneth

claim paper

Read More »

15

click to vote

JCSS
2002

199views more JCSS 2002»

A Constant-Factor Approximation Algorithm for the k-Median Problem

13 years 4 months ago

Download www.cis.upenn.edu

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...

claim paper

Read More »

10

click to vote

JCSS
2002

94views more JCSS 2002»

Query Strategies for Priced Information

13 years 4 months ago