1395 search results - page 269 / 279 » (k, )-Distance-Hereditary Graphs |
SODA
2003
ACM
13 years 9 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
JCB
2008
13 years 8 months ago
2008
A novel approach to the detection of genomic repeats is presented in this paper. The technique, dubbed SAGRI (Spectrum Assisted Genomic Repeat Identifier), is based on the spectru...
MST
2006
13 years 8 months ago
2006
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
BMCBI
2008
13 years 8 months ago
2008
Since the publication of our article (Roth, Gonnet, and Dessimoz: BMC Bioinformatics 2008 9: 518), we have noticed several errors, which we correct in the following. Correction We...
Publication
Surface reconstruction from gradient fields is an important
final step in several applications involving gradient manipulations
and estimation. Typically, the resulting gradient
...