Sciweavers

14518 search results - page 272 / 2904
» Two Problems for Sophistication
Sort
View
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
15 years 11 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
192
Voted
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 11 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
124
Voted
ESA
2003
Springer
77views Algorithms» more  ESA 2003»
15 years 10 months ago
An Optimal Algorithm for the Maximum-Density Segment Problem
We address a fundamental problem arising from analysis of biomolecular sequences. The input consists of two numbers wmin and wmax and a sequence S of n number pairs (ai, wi) with ...
Kai-min Chung, Hsueh-I Lu
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 10 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom