Sciweavers

297 search results - page 41 / 60
» Every Sequence Is Decompressible from a Random One
Sort
View
ALGORITHMICA
2007
89views more  ALGORITHMICA 2007»
14 years 11 months ago
The Complexity of the Single Individual SNP Haplotyping Problem
— We present several new results pertaining to haplotyping. These results concern the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfectly sequen...
Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John ...
ICCV
2007
IEEE
16 years 29 days ago
Non-rigid Photometric Stereo with Colored Lights
We present an algorithm and the associated capture methodology to acquire and track the detailed 3D shape, bends, and wrinkles of deforming surfaces. Moving 3D data has been diffi...
Björn Stenger, Carlos Hernández, Gabri...
FOCS
1990
IEEE
15 years 3 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
CIBCB
2006
IEEE
15 years 2 months ago
Efficient Probe Selection in Microarray Design
Abstract-- The DNA microarray technology, originally developed to measure the level of gene expression, had become one of the most widely used tools in genomic study. Microarrays h...
Leszek Gasieniec, Cindy Y. Li, Paul Sant, Prudence...
BMCBI
2004
126views more  BMCBI 2004»
14 years 11 months ago
A probabilistic model for the evolution of RNA structure
Background: For the purposes of finding and aligning noncoding RNA gene- and cis-regulatory elements in multiple-genome datasets, it is useful to be able to derive multi-sequence ...
Ian Holmes