Sciweavers

103 search results - page 2 / 21
» Minimal Separating Sequences for All Pairs of States
Sort
View
BMCBI
2010
183views more  BMCBI 2010»
13 years 10 months ago
SOPRA: Scaffolding algorithm for paired reads via statistical optimization
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
Adel Dayarian, Todd P. Michael, Anirvan M. Sengupt...
FSTTCS
2005
Springer
14 years 3 months ago
The Set Cover with Pairs Problem
Abstract. We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects th...
Refael Hassin, Danny Segev
BMCBI
2006
123views more  BMCBI 2006»
13 years 10 months ago
Characterizing disease states from topological properties of transcriptional regulatory networks
Background: High throughput gene expression experiments yield large amounts of data that can augment our understanding of disease processes, in addition to classifying samples. He...
David Tuck, Harriet Kluger, Yuval Kluger
PR
2000
82views more  PR 2000»
13 years 10 months ago
Holistic recognition of handwritten character pairs
Researchers have thus far focused on the recognition of alpha and numeric characters in isolation as well as in context. In this paper we introduce a new genre of problems where t...
Xian Wang, Venu Govindaraju, Sargur N. Srihari
ENTCS
2007
174views more  ENTCS 2007»
13 years 10 months ago
Quantum Patterns and Types for Entanglement and Separability
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Simon Perdrix