Advances in high-throughput sequencing have generated a vast amount of transcriptomic data that are being increasingly used in phylogenetic reconstruction. However, processing the vast datasets for a huge number of genes and even identifying optimal analytical methodology are challenging. Through de novo sequenced and retrieved data from public databases, we identified 221 orthologous protein-c...

Abstract Keystream sequences should look as random possible, i.e. present no logical pattern to be exploited in cryptographic attacks. The generalized self-shrinking generator, a sequence generator based on irregular decimation, produces family of with good properties. In this work, we display detailed analysis the randomness resulting from concatenation elements family. We apply most important...

This paper is about ‘seamless concatenation’ in the world of compressed television signals, especially MPEG2 signals, in the context of the session title ‘How tightly can we squeeze?’. The paper title has a deliberate ambiguity. It can mean the seamless concatenation of MPEG2 bitstreams to create a splice or edit, for example to insert an advertisement into an existing bitstream. It can also me...

The concatenation of trees can be defined either as a sequential or a parallel operation, and the corresponding iterated operation gives an extension of Kleene-star to tree languages. Since the sequential tree concatenation is not associative, we get two essentially different iterated sequential concatenation operations that we call the bottom-up star and top-down star operation, respectively. ...