Sciweavers

134 search results - page 1 / 27
» A New Tight Upper Bound on the Transposition Distance
Sort
View
HICSS
2008
IEEE
143views Biometrics» more  HICSS 2008»
14 years 7 days ago
Bounding Prefix Transposition Distance for Strings and Permutations
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
Bhadrachalam Chitturi, Ivan Hal Sudborough
ICC
2009
IEEE
165views Communications» more  ICC 2009»
14 years 16 days ago
Arbitrarily Tight Upper and Lower Bounds on the Gaussian Q-Function and Related Functions
—We present a new family of tight lower and upper bounds on the Gaussian Q-function Q(x). It is first shown that, for any x, the integrand ϕ(θ; x) of the Craig representation ...
Giuseppe Thadeu Freitas de Abreu
CIBCB
2007
IEEE
14 years 4 days ago
An Experimental Evaluation of Inversion-and Transposition-Based Genomic Distances through Simulations
— Rearrangements of genes and other syntenic blocks have become a topic of intensive study by phylogenists, comparative genomicists, and computational biologists: they are a feat...
Moulik Kothari, Bernard M. E. Moret
CORR
2008
Springer
58views Education» more  CORR 2008»
13 years 5 months ago
Tight Bounds on Minimum Maximum Pointwise Redundancy
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
Michael Baer