Sciweavers

495 search results - page 19 / 99
» Data exchange: computing cores in polynomial time
Sort
View
STOC
1995
ACM
194views Algorithms» more  STOC 1995»
13 years 10 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....
Sridhar Hannenhalli, Pavel A. Pevzner
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
13 years 8 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire
DAM
2006
106views more  DAM 2006»
13 years 6 months ago
Computational complexity of isothermic DNA sequencing by hybridization
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...
Jacek Blazewicz, Marta Kasprzak
RECOMB
2007
Springer
14 years 7 months ago
Rearrangements in Genomes with Centromeres Part I: Translocations
A centromere is a special region in the chromosome that plays a vital role during cell division. Every new chromosome created by a genome rearrangement event must have a centromere...
Michal Ozery-Flato, Ron Shamir
DCC
2007
IEEE
14 years 6 months ago
Algorithms and Hardware Structures for Unobtrusive Real-Time Compression of Instruction and Data Address Traces
Instruction and data address traces are widely used by computer designers for quantitative evaluations of new architectures and workload characterization, as well as by software de...
Milena Milenkovic, Aleksandar Milenkovic, Martin B...