Sciweavers

134 search results - page 1 / 27
» A New Tight Upper Bound on the Transposition Distance
Sort
View
95
Voted
WABI
2005
Springer
15 years 9 months ago
A New Tight Upper Bound on the Transposition Distance
Anthony Labarre
109
Voted
HICSS
2008
IEEE
143views Biometrics» more  HICSS 2008»
15 years 10 months 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
120
Voted
ICC
2009
IEEE
165views Communications» more  ICC 2009»
15 years 10 months 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
120
Voted
CIBCB
2007
IEEE
15 years 10 months 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
98
Voted
CORR
2008
Springer
58views Education» more  CORR 2008»
15 years 3 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