Background: Excision repair cross-complementing group 2 gene (ERCC2) polymorphisms have been linked as being a risk factor for colorectal cancer (CRC) emergence. However, data from several studies are contradictory. To validate genetic biomarkers of the CRC; the impact of the following ERCC2 polymorphism (rs1799793 and rs238406) was examined on CRC susceptibility among sample of Iraqi population. Methods: A total of 126 subjects were enrolled in this case control study; 78 CRC patients and 48 apparently healthy individuals who are age, gender, smoking status and BMI matched. Polymerase chain reaction (PCR) was used for genotyping, followed by sequencing then the association between genetic polymorphisms and CRC risk was investigate

Background: Breast cancer is the most common malignancy affecting the Iraqi population and the leading cause of cancer related mortality among Iraqi women. It has been well documented that prognosis of patients depends largely upon the hormone receptor contents and HER-2 over expression of their neoplasm. Recent studies suggest that Triple Positive (TP) tumors, bearing the three markers, tend to exhibit a relatively favorable clinical behavior in which overtreatment is not recommended. Aim: To document the different frequencies of ER/PR/HER2 breast cancer molecular subtypes focusing on the Triple Positive pattern; correlating those with the corresponding clinico-pathological characteristics among a sample of Iraqi patients diagnosed with th

Foreign body embolization is a rare but serious iatrogenic complication that might necessitate transcatheter or even surgical retrieval. A broken double-lumen catheter was snared using a goose neck snare kit. The procedure was successful, and the patient experienced no further complications.

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

For several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.

An Optimal Algorithm for HTML Page Building Process

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process