The study of integral equations is one of the most important topics that researchers are interested in, it arises in many scientific fields for instance engineering, and mathematical and scientific analysis. The first who mentioned the term integral equations is Du Bois-Reymond (1888). As a result, a lot of interest appeared from researchers, and the most important of these researchers are Laplace, Fourier, Poission, Liouville, and Able. Upadhyay et al., (2015) provided some special types of integral equations. The quadratic integral equation is a special form of integral equations. The initial study appeared by Chandrasekhar (1947). More appearance of Quadratic integral equation was in the theory of radiative transfer, kinetic theory of gases, in the theory of neutron transport, and in the traffic theory, see Argyros (1985), Banaś et al. (2007), El-Sayed et al. (2008).

In this study, we present the new generalized derivative and integral operators which are based on the newly constructed new generalized Caputo fractal–fractional derivatives (NGCFFDs). Based on these operators, a numerical method is developed to solve the fractal–fractional differential equations (FFDEs). We approximate the solution of the FFDEs as basis vectors of shifted Legendre polynomials (SLPs). We also extend the derivative operational matrix of SLPs to the generalized derivative operational matrix in the sense of NGCFFDs. The efficiency of the developed numerical method is tested by taking various test examples. We also compare the results of our proposed method with the methods existed in the literature In this paper, we specified the fractal–fractional differential operator of new generalized Caputo in three categories: (i) different values in  and fractal parameters, (ii) different values in fractional parameter while fractal and  parameters are fixed, and (iii) different values in fractal parameter controlling fractional and  parameters.

Exact string-matching algorithms have become very supreme in many bioinformatics tools. Despite the abundance and diversity of such algorithms, exposing them to real-time experimental analysis has been critical. This study was conducted to evaluate the efficiency of ten exact-string matching algorithms on large-scale genomic sequences from a runtime perspective. To define the most efficient algorithms are qualified to handle the short alphabet used for nucleic acid coding. The methodology promoted for this study was the factorial experiment with Randomized Complete Block Design (FRCBD). Under influence of four independent parameters, four levels of pattern lengths, four levels of pattern indices, two levels of programming languages, and ten levels of algorithmic architecture. The yield of the tested algorithms was calculated in nanoseconds. One-way ANOVA and Two-way ANOVA tests with post-hoc Games-Howell test were used separately for statistical analysis. In this study two widely accepted programming languages, C# and JAVA were used to speculate the possible effect of programing language on algorithm performance.

One of the unique combinations in the mammalian genome, that revolutionized concepts in the fields of genetics and molecular

pathology is what is termed the CpG islands. However, the accurate and rapid determination of CpG islands for DNA sequences remains

experimentally and computationally challenging. The main goal of this project is to design an offline, cross-platform CpG islands detection

tool. The Algorithm implemented in this study was the traditional sliding window algorithm by using the C++ programming language.

Three datasets were used for evaluating the performance of the application. The ANK1 gene, SPTB gene, and RET gene sequence files

were obtained from NCBI. In this study, the highest CGIs were reported in ANK1 (ankyrin 1) Gene which scored 13 successive islands

whereas the lowest score was reported in RET (ret proto-oncogene) Gene which shows only 6 islands. Generally, the program fulfills the

boundary limits as expected. We strongly recommend for further work, the implementation of other algorithms in addition to the sliding

window algorithm such as the Hidden Markov Model (HMM).

Abstract

Abstract

Introduction:

Coronavirus Disease 2019 (COVID-19) is an infectious res-

piratory disease caused by SARS-CoV-2. The disease was first broke out in

Wuhan City, Hubei Province, China and subsequently spread to all countries

and was considered by WHO as a worldwide pandemic. This study is aimed

to determine the epidemiology of SARS-CoV-2 and the presence of UK va-

riants in Zintan city of Libya taking some risk factors into account. Me-

thods: In a cross-sectional retrospective study, a total of 15486 nasopha-

ryngeal swabs were collected from COVID-19 suspected patients, travelers

and people need disease-free certificates for hospital admission, etc. The

samples were collected during the period from August 2020 to June 2021

and tested using real-time RT -PCR (rRT-PCR) kits for SARS-CoV-2 and

UK variants. Age groups, sex, and monthly weather were considered as risk

factors. Results: The positivity rate of COVID-19 in Zintan city was esti-

mated to be (3891; 25.12%) for the period from August 2020 to June 2021.

Females showed significantly (p < 0.05) higher positivity rate (2100; 54%) as

compared to males (1791; 46%). Out of the 3891 positive cases, 52 were de-

ceased. The Case Fatality Rate (CFR) was 1.33 recorded significantly in cas-

es aged ≥ 65 years which was higher in males (56.66%) than females (43.33%).

The peak of the first wave of infection was recorded in October 2020 (590;

15.15%) whereas the peak of the second wave of infection was recorded in

April 2021 (727; 18.71%). The positivity rate was decreased as the tempera-

ture increased. UK variant is detected firstly in May 2021 with the percen-

tage of 6.2% of tested samples. Conclusions: Health Authorities are en-

crease phase of infection to stop transmission of the virus in the next wave.

Early detection of new variants and studying their genetic characteristics

play a valuable role in prevention and control.

Keywords

SARS

-

CoV

-

2, UK Variant, Epidemiology, Zintan,

Libya, rRT

-

PCR.

Water used for crop irrigation is often of insufficient quality in the Mediterranean region, where sea water invades the porous karst matrix and salinizes Sources of soil and water. Measuring the productivity of horticultural crops under saline conditions helps decide if and when crops should be irrigated if water is saline, thus balancing crop water and salt stress. To examine the effects of saline irrigation water on (Vicia faba L.) biomass and yield parameters, a greenhouse pot experiment was set up.NaCl salinity was applied as follows: After 15 days from irrigation, plants were subjected to graded levels of salinity: 0, 50, 100, 200 and 300 mM NaCl, applied in stepwise daily increments to avoid induction of salt shock to the seedlings. Height of Plant (cm), The number of lateral branches , number of( leaves, pods, seeds) per plant, shoot weight (g), is correlated with an increase in stressed plant photosynthetic pigments. five weeks after salinity therapy, the weight of the pod (g) and the weight of the seed (g) were determined. Increased irrigation water salinity statistically significantly decreased the calculated parameters (P<0.05) relative to regulation , except for the number of branches and pods. Salinity is associated with an increase in photosynthetic pigments in stressed plants. The productivity of Vicia faba has decreased in proportion to the degree of salinity of irrigation water

Exact string-matching algorithms have become very supreme in many bioinformatics tools. Despite the abundance and diversity of such algorithms, exposing them to real-time experimental analysis has been critical. This study was conducted to evaluate the efficiency of ten exact-string matching algorithms on large-scale genomic sequences from a runtime perspective. To define the most efficient algorithms are qualified to handle the short alphabet used for nucleic acid coding. The methodology promoted for this study was the factorial experiment with Randomized Complete Block Design (FRCBD). Under influence of four independent parameters, four levels of pattern lengths, four levels of pattern indices, two levels of programming languages, and ten levels of algorithmic architecture. The yield of the tested algorithms was calculated in nanoseconds. One-way ANOVA and Two-way ANOVA tests with post-hoc Games-Howell test were used separately for statistical analysis. In this study two widely accepted programming languages, C# and JAVA were used to speculate the possible effect of programing language on algorithm performance. The One-way ANOVA results revealed that the Backward-Oracle-Matching (BOM), Zhu-Takaoka (ZT), and Horspool's (HP) algorithms exhibited the highest final performance correspondingly. These algorithms have demonstrated an efficiency of up to 250% higher than other algorithms. The results of two-way ANOVA revealed a significant interaction between programing language adopted and execution time with the absence of pattern lengths and pattern index effect. The combination of the C# programing language and the Backward-Oracle-Matching algorithm produced the most effective performance on genomic sequences. 

Short Tandem Repeats (STRs) are one of the utmost mutable provinces in the human genome. They comprise tandem repeating DNA sequences ranging in length from two to six base pairs. Owing to their significant mutation rate, they exhibit considerable variation in pattern among populations and the capacity to be passed on from generation to generation. These loci are broadly employed in medicine, biology, and criminal investigation. They are pivotal in the genesis of a variety of genetic illnesses and have been intensively investigated in forensics, population genetics, and genetic genealogy. Although many implementations that manage STR loci are offered, the overwhelming majority of them rely primarily on the Command-Line Interface (CLI) inputs, which frequently necessitate the implementation of tools carried out in various scripting languages. Installing and launching programs through the Command Line (CL) is timeconsuming and/or unprofitable for many students and scholars. The fundamental intention of this project is to develop a cross-platform Graphical User Interface (GUI) package directed to the Combined DNA Index System (CODIS) STR analysis. Zenobia is a Java-based application considered as a step in consistently making CL-only programs available to more apprentices and researchers. In general, Zenobia's application outcomes satisfy the evaluation metrics for efficiency and time consumption. However, more genetic markers should be introduced to increase productivity of the application.