Sciweavers

1332 search results - page 176 / 267
» Combinatorial Algorithms
Sort
View
CPM
2005
Springer
97views Combinatorics» more  CPM 2005»
14 years 2 months ago
On the Complexity of Sparse Exon Assembly
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
DGCI
2005
Springer
14 years 2 months ago
Increasing Interconnection Network Connectivity for Reducing Operator Complexity in Asynchronous Vision Systems
Due to the restriction of SIMD mode to local operations in VLSI massively parallel vision chips, using programmable connections and asynchronous communications are key ingredients ...
Valentin Gies, Thierry M. Bernard
DNA
2005
Springer
132views Bioinformatics» more  DNA 2005»
14 years 2 months ago
DNA Recombination by XPCR
The first step of the Adleman-Lipton extract model in DNA computing is the combinatorial generation of libraries. In this paper a new method is proposed for generating a initial p...
Giuditta Franco, Vincenzo Manca, Cinzia Giagulli, ...
WG
2005
Springer
14 years 2 months ago
Algebraic Operations on PQ Trees and Modular Decomposition Trees
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
Ross M. McConnell, Fabien de Montgolfier
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
14 years 2 months ago
Relativized NP Search Problems and Propositional Proof Systems
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
Josh Buresh-Oppenheim, Tsuyoshi Morioka