Sciweavers

516 search results - page 29 / 104
» Sets of k-Independent Strings
Sort
View
VECPAR
2000
Springer
13 years 11 months ago
A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows
A parallel implementation of the specialized interior-point algorithm for multicommodity network flows introduced in [5] is presented. In this algorithm, the positive definite syst...
Jordi Castro, Antonio Frangioni
BMCBI
2008
114views more  BMCBI 2008»
13 years 7 months ago
Identifying a few foot-and-mouth disease virus signature nucleotide strings for computational genotyping
Background: Serotypes of the Foot-and-Mouth disease viruses (FMDVs) were generally determined by biological experiments. The computational genotyping is not well studied even with...
Guohui Lin, Zhipeng Cai, Junfeng Wu, Xiu-Feng Wan,...
ORDER
2010
110views more  ORDER 2010»
13 years 6 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
14 years 27 days ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
STACS
2007
Springer
14 years 1 months ago
On the Complexity of Unary Tiling-Recognizable Picture Languages
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
Alberto Bertoni, Massimiliano Goldwurm, Violetta L...