142
click to vote
CPM
15 years 5 months ago
2004 Springer 
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
133
click to vote
COCOON
15 years 5 months ago
2004 Springer 
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
127
click to vote
COCOON
15 years 3 months ago
2004 Springer 
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
116
click to vote
CPM
15 years 5 months ago
2004 Springer
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
114
click to vote
CPM
15 years 5 months ago
2004 Springer
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
|
Combinatorics