Sciweavers

817 search results - page 33 / 164
» An Optimal Linear Time Algorithm for Quasi-Monotonic Segment...
Sort
View
ICCV
2009
IEEE
15 years 1 months ago
Beyond Connecting the Dots: A Polynomial-time Algorithm for Segmentation and Boundary Estimation with Imprecise User Input
We propose a polynomial-time algorithm for segmentation and (open) boundary estimation which takes into account a series of user-specified attraction points. In contrast to exis...
Thomas Windheuser, Thomas Schoenemann, Daniel Crem...
WABI
2010
Springer
160views Bioinformatics» more  WABI 2010»
13 years 7 months ago
Genomic Distance with DCJ and Indels
The double cut and join (DCJ) operation, introduced by Yancopoulos, Attie and Friedberg in 2005, allows one to represent most rearrangement events in genomes. However, a DCJ cannot...
Marília D. V. Braga, Eyla Willing, Jens Sto...
TCBB
2008
113views more  TCBB 2008»
13 years 8 months ago
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...
Alexander Schliep, Roland Krause
CORR
2008
Springer
105views Education» more  CORR 2008»
13 years 8 months ago
On Full Diversity Space-Time Block Codes with Partial Interference Cancellation Group Decoding
In this paper, we propose a partial interference cancellation (PIC) group decoding strategy/scheme for linear dispersive space-time block codes (STBC) and a design criterion for th...
Xiaoyong Guo, Xiang-Gen Xia
RECOMB
2000
Springer
14 years 7 days ago
Sequencing-by-hybridization at the information-theory bound: an optimal algorithm
In a recent paper (Preparata et al., 1999) we introduced a novel probing scheme for DNA sequencing by hybridization (SBH). The new gapped-probe scheme combines natural and univers...
Franco P. Preparata, Eli Upfal