GTZ: a fast compression and cloud transmission tool optimized for FASTQ files.

Yuting Xing1, Gen Li2, Zhenguo Wang2

  • 1School of Computer Science, National University of Defense Technology, Changsha, 410000, China.

BMC Bioinformatics
|January 4, 2018
PubMed
Summary

Genomic data compression is essential for big data challenges. GTZ is a new tool that efficiently compresses FASTQ files and transmits them to cloud storage, improving data sharing and accessibility.

Related Concept Videos

Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
8.2K
Behavior of Concrete Under Compressive Load01:23

Behavior of Concrete Under Compressive Load

Concrete exhibits specific behaviors under different compressive loads. Understanding this is crucial for understanding its structural integrity. When concrete undergoes uniaxial compression, it tends to develop cracks that run parallel to the direction of the force. These parallel cracks stem from localized tensile stresses that occur perpendicular to the compression direction. Additionally, angled cracks may appear due to the formation of shear planes.
As the concrete specimen fractures under...
668
Optimal Foraging00:48

Optimal Foraging

How animals obtain and eat their food is called foraging behavior. Foraging can include searching for plants and hunting for prey and depends on the species and environment.
14.0K
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
988
Optimization Problems01:26

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
85
Design of Transmission Shafts01:16

Design of Transmission Shafts

The design of a transmission shaft is governed by two primary specifications: the power it transmits and its rotational speed. These parameters guide the selection of the shaft's material and cross-sectional dimensions, ensuring that the material's maximum shearing stress remains within the elastic limit while transmitting the desired power at the given speed. The system's power is intrinsically linked to the applied torque. The torque applied to the shaft can be calculated by reconfiguring the...
800