Sciweavers

COCOON
2004
Springer
13 years 10 months ago
An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs
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...
Yong Zhang, Hong Zhu
CPM
2004
Springer
168views Combinatorics» more  CPM 2004»
13 years 10 months ago
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
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...
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robe...
CPM
2004
Springer
156views Combinatorics» more  CPM 2004»
13 years 10 months ago
A Computational Model for RNA Multiple Structural Alignment.
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...
Eugene Davydov, Serafim Batzoglou
CPM
2004
Springer
145views Combinatorics» more  CPM 2004»
13 years 10 months ago
Compressed Index for a Dynamic Collection of Texts
Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam
CPM
2004
Springer
145views Combinatorics» more  CPM 2004»
13 years 10 months ago
Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs
The perfect phylogeny model for haplotype evolution has been successfully applied to haplotype resolution from genotype data. In this study we explore the application of the perfe...
Tamar Barzuza, Jacques S. Beckmann, Ron Shamir, It...
Combinatorics
Top of PageReset Settings