Steganalytic method based on short and repeated sequence distance statistics

According to the distribution characteristics of short and repeated sequence （SRS）, a steganaiytic method based on the correlation of image bit planes is proposed. Firstly, we provide the conception of SRS distance statistics and deduce its statistical distribution. Because the SRS distance statistics can effectively reflect the correlation of the sequence, SRS has statistical features when the image bit plane sequence equals the image width. Using this characteristic, the steganalytic method is fulfilled by the distinct test of Poisson distribution. Experimental results show a good performance for detecting LSB matching steganographic method in still images. By the way, the proposed method is not designed for specific steganographic algorithms and has good generality.

PowerPlex■ fusion 6C system: internal validation study

This work is aimed at describing the proceedings and parameters used to validate PowerPlex■ Fusion 6C System,the polymerase chain reaction (PCR) amplification kit by Promega,for posterior implementation in the laboratorial routine of the Forensic Genetic Service.The PowerPlex■ Fusion 6C System allows multiplex PCR,through simultaneous amplification and posterior detection by fluorescence of 27 loci.Characterization of the kit was made according to the laboratory's internal validation procedure based on validation guidelines from Scientific Working Group on DNA Analysis Methods.Some parameters were evaluated,such as specificity,analytical thresholds,sensitivity,precision,mixture studies,DNA control samples,a proficiency test and changes in the PCR-based procedures: final reaction volume and cycle number,changes in the reaction mixture for direct amplification.This kit proved to be very robust and the results are in concordance with previous developmental validation by the manufacturer.In some parameters,the results were better than expected.

Next generation sequencing under de novo genome assembly

The next generation sequencing （NGS） is an important process which assures inexpen- sive organization of vast size of raw sequence dataset over any traditional sequencing systems or methods. Various aspects of NGS such as template preparation, sequencing imaging and genome alignment and assembly outline the genome sequencing and align- ment. Consequently, de Bruijn graph （dBG） is an important mathematical tool that graphically analyzes how the orientations are constructed in groups of nucleotides. Basi- cally, dBG describes the formation of the genome segments in circular iterative fashions. Some pivotal dBG-based de novo algorithms and software packages such as T-IDBA, Oases, IDBA-tran, Euler, Velvet, ABYSS, AllPaths, SOAPde novo and SOAPde novo2 are illustrated in this paper. Consequently, overlap layout consensus （OLC） graph-based algorithms also play vital role in NGS assembly. Some important OLC-based algorithms such as MIRA3, CABOG, Newbler, Edena, Mosaik and SHORTY are portrayed in this paper. It has been experimented that greedy graph-based algorithms and software pack- ages are also vital for proper genome dataset assembly. A few algorithms named SSAKE, SHARCGS and VCAKE help to perform proper genome sequencing.