Sciweavers

400 search results - page 7 / 80
» On some Properties of DNA Graphs
Sort
View
DAM
2006
61views more  DAM 2006»
13 years 7 months ago
On error-tolerant DNA screening
Given n clones with some positive ones, the problem of DNA screening is to identify all positive clones with a set of tests each on a subset of clones, called a pool and the outco...
Weili Wu, Yaochun Huang, Xiao Huang, Yingshu Li
BMCBI
2010
82views more  BMCBI 2010»
13 years 8 months ago
Genome-wide estimation of firing efficiencies of origins of DNA replication from time-course copy number variation data
Background: DNA replication is a fundamental biological process during S phase of cell division. It is initiated from several hundreds of origins along whole chromosome with diffe...
Huaien Luo, Juntao Li, Majid Eshaghi, Jianhua Liu,...
DISOPT
2007
93views more  DISOPT 2007»
13 years 7 months ago
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak...
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
14 years 1 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze
JCO
2006
126views more  JCO 2006»
13 years 7 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li