Sciweavers

23 search results - page 4 / 5
» Sorting by Reversals in Subquadratic Time
Sort
View
RECOMB
2010
Springer
13 years 3 months ago
The Problem of Chromosome Reincorporation in DCJ Sorting and Halving
We study two problems in the double cut and join (DCJ) model: sorting – transforming one multilinear genome into another and halving – transforming a duplicated genome into a p...
Jakub Kovác, Marília D. V. Braga, Je...
RECOMB
2008
Springer
14 years 5 months ago
Perfect DCJ Rearrangement
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...
Sèverine Bérard, Annie Chateau, Cedr...
BMCBI
2005
178views more  BMCBI 2005»
13 years 4 months ago
A quantization method based on threshold optimization for microarray short time series
Background: Reconstructing regulatory networks from gene expression profiles is a challenging problem of functional genomics. In microarray studies the number of samples is often ...
Barbara Di Camillo, Fatima Sanchez-Cabo, Gianna To...
PRL
2008
65views more  PRL 2008»
13 years 4 months ago
Matching of quasi-periodic time series patterns by exchange of block-sorting signatures
We propose a novel method for quasi-periodic time series patterns matching, through signature exchange between the two patterns. The signature is obtained through sorting of the t...
Bachir Boucheham
CORR
2010
Springer
135views Education» more  CORR 2010»
12 years 12 months ago
Top-K Color Queries for Document Retrieval
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
Marek Karpinski, Yakov Nekrich