Sciweavers

175 search results - page 23 / 35
» Bounds for Permutation Rate-Distortion
Sort
View
DAM
2008
116views more  DAM 2008»
13 years 7 months ago
Expected number of breakpoints after t random reversals in genomes with duplicate genes
In comparative genomics, one wishes to deduce the evolutionary distance between dierent species by studying their genomes. Using gene order information, we seek the number of time...
Niklas Eriksen
FFA
2007
56views more  FFA 2007»
13 years 7 months ago
Optical orthogonal codes and arcs in PG(d, q)
We present a new construction for (n, w, λ)-optical orthogonal codes (OOCs). The construction is pleasingly simple, where codewords correspond to arcs, specifically normal ratio...
T. L. Alderson
CORR
2004
Springer
83views Education» more  CORR 2004»
13 years 7 months ago
A proof of Alon's second eigenvalue conjecture and related problems
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...
Joel Friedman
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 8 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
SC
1994
ACM
13 years 11 months ago
The range test: a dependence test for symbolic, non-linear expressions
Most current data dependence tests cannot handle loop bounds or array subscripts that are symbolic, nonlinear expressions e.g. Ani+j, where 0 j n. In this paper, we describe a d...
William Blume, Rudolf Eigenmann