Search

DNA splice junction classification is a crucial job in computational biology. The challenge is to predict the junction type (IE, EI, or N) from a given DNA sequence. Predicting junction type is crucial for understanding gene expression patterns, disease causes, splicing regulation, and gene structure. The location of the regions where exons are joined, and introns are removed during RNA splicing is very difficult to determine because no universal rule guides this process. This study presents a two-layer hybrid approach inspired by ensemble learning to overcome this challenge. The first layer applies the grey wolf optimizer (GWO) for feature selection. GWO's exploration ability allows it to efficiently search a vast feature space, while its exploitation ability refines promising areas, thus leading to a more reliable feature selection. The selected features are then fed into the second layer, which employs a classification model trained on the retrieved features. Using cross-validation, the proposed method divides the DNA splice junction dataset into training and test sets, allowing for a thorough examination of the classifier's generalization ability. The ensemble model is trained on various partitions of the training set and tested on the remaining held-out fold. This process is performed for each fold, comprehensively evaluating the classifier's performance. We tested our method using the StatLog DNA dataset. Compared to various machine learning models for DNA splice junction prediction, the proposed GWO+SVM ensemble method achieved an accuracy of 96%. This finding suggests that the proposed ensemble hybrid approach is promising for DNA splice junction classification. The implementation code for the proposed approach is available at https://github.com/EFHamouda/DNA-splice-junction-prediction. [ABSTRACT FROM AUTHOR]

Cancellable biometrics enabled us to develop robust authentication systems by replacing the storage of the original biometric template with another secured version. A technique called biometric salting uses a parameter (key) and an invertible function to transform the human biometrics features into a secured format that can be protected and stored securely in a biometric database system. The salting key plays a main role in the success of this transformation, which makes it robust or vulnerable to many security attacks. One of the main challenges that faces biometrics' researchers currently is how to design and protect such a salting key considering two basic measures: security and recognition accuracy. In this article, we propose unimodal‐Bio‐GAN, a reliable keyless biometric salting technique based on standard generative adversarial network (GAN). In unimodal‐Bio‐GAN, a random permuted version of the human biometric data is implicitly considered as a salting key and required only during the enrolment stage, which increases the system reliability to overcome different security attacks. The experimental results of unimodal‐Bio‐GAN using the CASIA Iris‐V3‐Internal database outperform the previous methods and its security efficiency is analysed using different attack types. [ABSTRACT FROM AUTHOR]

Several cancellable biometrics (CBs) techniques have been proposed to protect biometric data and maintain users' privacy. Although such techniques can withstand brute‐force and/or pre‐image attacks, they are vulnerable to correlation attacks. In this study, the authors propose a novel correlation attack‐resistant CBs scheme that is based on a convolution operation and a bidirectional associative memory (BAM) neural network. The proposed scheme utilises BAM to bind biometric templates to random bit‐strings in a secure and efficient manner. These random bit‐strings are then employed to derive cancellable templates from the true templates linked to them via BAM weights, which are safely stored with the generated cancellable template in the system database. In this study, linear convolution is adopted as the cancellable transformation process. The result of convolving the original biometric template with the transformation key is binarised according to a predefined threshold to thwart blind de‐convolution. The security of the proposed scheme against different attacks is analysed and experiments on the CASIA‐IrisV3‐Interval dataset illustrate the efficacy of the proposed scheme. [ABSTRACT FROM AUTHOR]

Feature transformation methods can be used effectively to improve the performance of the machine learning techniques, such as classification and clustering, via enhancing the discrimination among the samples. Additionally, binary representation of features may be necessary in several circumstances. For example, distributed systems may have limited bandwidth, storage, and energy that necessitate rough quantization of the measurements. This paper proposes a random projection-based feature transformation method that maps the data points from the original space into a new binary space. In the proposed transformation method, the random projection process is formulated as an optimization problem. A modified chaotic version of the sine–cosine algorithm is used to find the optimal random projector. The performance of the proposed transformation method is validated using 15 standard UCI benchmark datasets against the linear discernment analysis. Moreover, it is compared to other metaheuristic-based feature reduction methods including the gray wolf optimizer, the genetic algorithm, and the antlion optimizer. The obtained results assure the superiority of the proposed transformation method in terms of classification accuracy and storage requirements. [ABSTRACT FROM AUTHOR]

The kidney exchange programs bring new insights in the field of organ transplantation. They make the previously not allowed surgery of incompatible patient-donor pairs easier to be performed on a large scale. Mathematically, the kidney exchange is an optimization problem for the number of possible exchanges among the incompatible pairs in a given pool. Also, the optimization modeling should consider the expected quality-adjusted life of transplant candidates and the shortage of computational and operational hospital resources. In this article, we introduce a bio-inspired stochastic-based Ant Lion Optimization, ALO, algorithm to the kidney exchange space to maximize the number of feasible cycles and chains among the pool pairs. Ant Lion Optimizer-based program achieves comparable kidney exchange results to the deterministic-based approaches like integer programming. Also, ALO outperforms other stochastic-based methods such as Genetic Algorithm in terms of the efficient usage of computational resources and the quantity of resulting exchanges. Ant Lion Optimization algorithm can be adopted easily for on-line exchanges and the integration of weights for hard-to-match patients, which will improve the future decisions of kidney exchange programs. A reference implementation for ALO algorithm for kidney exchanges is written in MATLAB and is GPL licensed. It is available as free open-source software from: . [ABSTRACT FROM AUTHOR]