The conservation for biodiversity in Iraqi freshwater environments is important to protecting native species from the environmental impacts of alien species. Clarias gariepinus (Burchell, 1822) (Siluriformes, Clariidae) has been recognized as an alien species in Iraqi water bodies. This study aims to use molecular DNA to identify this catfish and trace its origins using. The DNA sequences of C. gariepinus were done using the mitochondrial DNA cytochrome c oxidase subunit 1 (COI) gene, and a specific primer set. The polymerase chain reaction (PCR) amplification was used to align the COI gene as a barcoding marker. After analysis, the sequences were compared with sequences in the National Center for Biology Information (NCBI) database

Objectives: To study the spectrum and classification of ATP7B variants in Iraqi children with Wilson disease by direct gene sequencing with clinical correlation. Methods: Fifty-five unrelated children with a clinical diagnosis of Wilson disease (WD) were recruited. Deoxyribonucleic acid was extracted from peripheral blood samples, and variants in the ATP7B gene were identified using next-generation sequencing. Results: Seventy-six deleterious variants were detected in 97 out of 110 alleles of the ATP7B gene. Thirty (54.5%) patients had 2 disease-causing variants (15 homozygous and 15 compound heterozygous). Twelve (21.8%) patients had one disease-causing variant and one variant of uncertain significance (VUS) with potential pathogenicity. T

Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex