Search results for "Burrow"
showing 10 items of 53 documents
Pullneyocoris dentatus gen. et sp. nov. (Hemiptera: Pentatomoidea: Cydnidae), the third representative of the subfamily Amnestinae from mid-Cretaceou…
2020
Abstract A new genus and species of burrower bug, Pullneyocoris dentatus gen. et sp. nov. (Hemiptera: Cydnidae: Amnestinae), is described from amber of northern Myanmar. It is the third representative of this family known from Burmese amber, and besides its autapomorphies, it presents a mixture of characters relevant to the extant Parachilocoris Horvath, 1919 and Pullneya Horvath, 1919. A comparison of this new genus to the two genera already described from the burmite, i.e. Chilamnestocoris Lis J.A., Lis. B. & Heiss, 2018, and Punctacorona Wang, Du, Yao & Ren, 2019 is also provided.
The Myriad Virtues of Wavelet Trees
2009
Wavelet Trees have been introduced in [Grossi, Gupta and Vitter, SODA '03] and have been rapidly recognized as a very flexible tool for the design of compressed full-text indexes and data compressors. Although several papers have investigated the beauty and usefulness of this data structure in the full-text indexing scenario, its impact on data compression has not been fully explored. In this paper we provide a complete theoretical analysis of a wide class of compression algorithms based on Wavelet Trees. We also show how to improve their asymptotic performance by introducing a novel framework, called Generalized Wavelet Trees, that aims for the best combination of binary compressors (like,…
Chilamnestocoris mixtus gen. et spec. nov., the first burrower bug (Hemiptera: Pentatomoidea: Cydnidae) in Upper Cretaceous Burmese amber
2018
Combinatorial Transforms : Application in Lossless Image Compression
2011
International audience; Common image compression standards are usually based on frequency transform such as Discrete Cosine Transform. We present a different approach for lossless image compression, which is based on a combinatorial transform. The main transform is Burrows Wheeler Transform (BWT) which tends to reorder symbols according to their following context. It becomes one of promising compression approach based on context modeling. BWT was initially applied for text compression software such as BZIP2 nevertheless it has been recently applied to the image compression field. Compression schemes based on the Burrows Wheeler Transform have been usually lossless; therefore we implement th…
Variable-order reference-free variant discovery with the Burrows-Wheeler Transform
2020
Abstract Background In [Prezza et al., AMB 2019], a new reference-free and alignment-free framework for the detection of SNPs was suggested and tested. The framework, based on the Burrows-Wheeler Transform (BWT), significantly improves sensitivity and precision of previous de Bruijn graphs based tools by overcoming several of their limitations, namely: (i) the need to establish a fixed value, usually small, for the order k, (ii) the loss of important information such as k-mer coverage and adjacency of k-mers within the same read, and (iii) bad performance in repeated regions longer than k bases. The preliminary tool, however, was able to identify only SNPs and it was too slow and memory con…
Burrows–Wheeler transform and Sturmian words
2003
The beast burrowed, the fluid followed – Crustacean burrows as methane conduits
2015
Abstract An extensive pockmark field with associated methane-seep carbonates has recently been reported from the late Albian (Lower Cretaceous) Ubidepea Mudstone of the Black Flysch Group in the Basque Country, northern Spain, but the exact pathways of the migrating methane-rich fluids remained elusive. Here we provide petrographic, stable carbon and oxygen isotope evidence that abundant crustacean burrows in the surrounding mudstone, preserved as the trace fossil Thalassinoides, and the seep carbonates themselves have acted as long-lasting fluid conduits in this system. The Thalassinoides infill generations show a diagenetic parasequence often starting with a distinctive lining, followed b…
Burrows-Wheeler transform and palindromic richness
2009
AbstractThe investigation of the extremal case of the Burrows–Wheeler transform leads to study the words w over an ordered alphabet A={a1,a2,…,ak}, with a1<a2<⋯<ak, such that bwt(w) is of the form aknkak−1nk−1⋯a2n2a1n1, for some non-negative integers n1,n2,…,nk. A characterization of these words in the case |A|=2 has been given in [Sabrina Mantaci, Antonio Restivo, Marinella Sciortino, Burrows-Wheeler transform and Sturmian words, Information Processing Letters 86 (2003) 241–246], where it is proved that they correspond to the powers of conjugates of standard words. The case |A|=3 has been settled in [Jamie Simpson, Simon J. Puglisi, Words with simple Burrows-Wheeler transforms, Electronic …
Balanced Words Having Simple Burrows-Wheeler Transform
2009
The investigation of the "clustering effect" of the Burrows-Wheeler transform (BWT) leads to study the words having simple BWT , i.e. words w over an ordered alphabet $A=\{a_1,a_2,\ldots,a_k\}$, with $a_1 < a_2 < \ldots <a_k$, such that $bwt(w)$ is of the form $a_k^{n_k} a_{k-1}^{n_{k-1}} \cdots a_1^{n_1}$, for some non-negative integers $n_1, n_2, \ldots, n_k$. We remark that, in the case of binary alphabets, there is an equivalence between words having simple BWT, the family of (circular) balanced words and the conjugates of standard words. In the case of alphabets of size greater than two, there is no more equivalence between these notions. As a main result of this paper we prove that, u…
Design of composite measure schemes for comparative severity assessment in animal-based neuroscience research: A case study focussed on rat epilepsy …
2020
PLOS ONE 15(5), e0230141 (2020). doi:10.1371/journal.pone.0230141