Results 1 - 10 of 127

Inheritance of Burrow Building in Peromyscm

by Wallace D. Dawson, Cynthia E. Lake, Sharon S. Schumpert , 1987
"... Burrow construction abilities of laboratory-reared oldfield mice (Pero-myscus polionotus), deermice (P. maniculatus), and their FI hybrids were compared using a spacious earth-filled test chamber. Mated pairs with nursing litters were individually introduced into the chamber for 4 days in each test. ..."
Abstract - Add to MetaCart
is principally genetic in origin, and during 20-25 generations in captivity no substantial loss of this ability occurred. F \ data indicate that the more complex burrow building exhibits genetic dominance, and backcross results show that at least two and probably more gene loci strongly influence the trait. KEY

Dynamic Burrows-Wheeler Transform

by Mikaël Salson, Thierry Lecroq, Martine Léonard, Laurent Mouchard , 2008
"... The Burrows-Wheeler Transform is a building block for many text compression applications and self-index data structures. It reorders the letters of a text T to obtain a new text bwt(T) which can be better compressed. This forward transform has been intensively studied over the years, but a major pro ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
The Burrows-Wheeler Transform is a building block for many text compression applications and self-index data structures. It reorders the letters of a text T to obtain a new text bwt(T) which can be better compressed. This forward transform has been intensively studied over the years, but a major

Improvements to Burrows-Wheeler Compression Algorithm

by Sebastian Deorowicz , 2000
"... In 1994 Burrows and Wheeler presented a new algorithm for lossless data compression. The compression ratio that can be achieved using their algorithm is comparable with the best known other algorithms, whilst its complexity is relatively small. In this paper we explain the internals of this algorith ..."
Abstract - Cited by 14 (3 self) - Add to MetaCart
In 1994 Burrows and Wheeler presented a new algorithm for lossless data compression. The compression ratio that can be achieved using their algorithm is comparable with the best known other algorithms, whilst its complexity is relatively small. In this paper we explain the internals

Universal Lossless Source Coding With the Burrows Wheeler Transform

by Michelle Effros, Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio Verdú - IEEE TRANSACTIONS ON INFORMATION THEORY , 2002
"... The Burrows Wheeler Transform (BWT) is a reversible sequence transformation used in a variety of practical lossless source-coding algorithms. In each, the BWT is followed by a lossless source code that attempts to exploit the natural ordering of the BWT coefficients. BWT-based compression schemes ar ..."
Abstract - Cited by 44 (4 self) - Add to MetaCart
The Burrows Wheeler Transform (BWT) is a reversible sequence transformation used in a variety of practical lossless source-coding algorithms. In each, the BWT is followed by a lossless source code that attempts to exploit the natural ordering of the BWT coefficients. BWT-based compression schemes

Attacking Scrambled Burrows-Wheeler Transform

by Martin Stanek
"... Scrambled Burrows-Wheeler transform [6] is an attempt to combine privacy (encryption) and data compression. We show that the proposed approach is insecure. We present chosen plaintext and known plaintext attacks and estimate their complexity in various scenarios. 1 ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Scrambled Burrows-Wheeler transform [6] is an attempt to combine privacy (encryption) and data compression. We show that the proposed approach is insecure. We present chosen plaintext and known plaintext attacks and estimate their complexity in various scenarios. 1

Burrows Wheeler - Alternatives to Move to Front

by Peter Fenwick, Mark Titchener, Michelle Lorenz - Data Compression Conference (DCC , 2003
"... The Burrows Wheeler Transform, first published in 1994 [2], is a relatively new approach to text compression and has already proven to produce excellent results. However, there has been much research directed towards improving the efficiency of the Move to Front algorithm[7, 1, 4] with varying degre ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
degrees of complexity. This paper examines a relatively simple technique using a cached modeling system and achieves very promising results. In- formation loss during the Burrows Wheeler Transform is also examined using Deterministic Information Theory measuring techniques. This provides an interesting

Spatial variation in burrow morphology of the mud shore crab Helograpsus haswellianus (Brachyura, Grapsidae) in South Australian saltmarshes

by A,C G Katrak , S Dittmann , L Seuront
"... Abstract. Burrowing by crabs is an important component of their functional role in mangrove and saltmarsh habitats. The grapsid crab Helograpsus haswellianus (Whitelegge, 1889) is one of the more conspicuous burrowing organisms in the saltmarshes of southern Australia. To evaluate intraspecific dif ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
, number and diameter of the burrow openings), and the overall 3D burrow complexity was described using a single parameter, the fractal dimension D. Apart from the number of shafts, all morphological characters of the burrows differed significantly among sites. Analyses of the fractal dimensions lead

Modifications of the Burrows and Wheeler Data Compression Algorithm

by Bernhard Balkenhol, Stefan Kurtz, Yuri M. Shtarkov - Proceedings of the ieee Data Compression Conference , 1999
"... this paper we improve upon these previous results on the BW-algorithm. Based on the context tree model, we consider the specific statistical properties of the data at the output of the BWT. We describe six important properties, three of which have not been described elsewhere. These considerations l ..."
Abstract - Cited by 28 (4 self) - Add to MetaCart
lead to modifications of the coding method, which in turn improve the coding efficiency. We shortly describe how to compute the BWT with low complexity in time and space, using suffix trees in two different representations. Finally, we present experimental results about the compression rate and running

Burrowing by common voles (Microtus arvalis) in various social environments

by Alexandre Dobly, Francine M. Rozenfeld - Behaviour , 2000
"... Female common voles live in groups in large burrows whereas males are probably solitary and promiscuous. At high population density, when burrows become a limiting factor, some females are forced to emigrate from their group. To investigate whether these emigrants could share new common burrows with ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
their burrows in response to social nesting and had more complex burrows than solitary females or intolerant males. We may conclude that in common voles at least unrelated non breeding females may contribute to the formation of social groups. To investigate whether, within a matriarchal group, females may co

An FPGA-based Parallel Sorting Architecture for the Burrows Wheeler

by Transform Jos Martnez, José Martínez, René Cumplido, Claudia Feregrino
"... Burrows-Wheeler transform (BWT) has received special attention due to its effectiveness in lossless data compression algorithms. However, implementations of BWT-based algorithms have been limited due to the complexity of the suffix sorting process applied to the input string. Proposed solutions invo ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
Burrows-Wheeler transform (BWT) has received special attention due to its effectiveness in lossless data compression algorithms. However, implementations of BWT-based algorithms have been limited due to the complexity of the suffix sorting process applied to the input string. Proposed solutions
Results 1 - 10 of 127