12 papers · ranked by Valyu relevance
Jialing Yan, Gang Hu, Jiulong Zhang, Heming Jia + 2 more
'Xuewen Xia'] To address the shortcomings of the recently proposed Fick’s Law Algorithm, which is prone to local convergence and poor convergence efficiency, we propose a multi-strategy improved Fick’s Law Algorithm (FLAS). The method combines multiple effective strategies, including differential mutation strategy…
Ran Wang, Weiquan Huang, Junyu Wu, Chen Chen + 3 more
To address the rapid population diversity loss and premature convergence of the Artificial Lemming Algorithm (ALA) in complex optimization problems, this paper proposes an Improved Artificial Lemming Algorithm (IALA) with multi-strategy enhancements inspired by lemming behavior. First, a non-uniform mutation operator…
Ali Asghari, Mohammadhossein Mohammadi, Heming Jia
Metaheuristic algorithms are widely used to find optimal or near-optimal solutions for complex problems by taking inspiration from natural behaviors and processes. Although many different methods have been developed, a common problem in many of them is maintaining a good balance between exploration and exploitation and…
Ahmed F. Ali, Mohamed A. Tawhid
Cuckoo search algorithm is a promising metaheuristic population based method. It has been applied to solve many real life problems. In this paper, we propose a new cuckoo search algorithm by combining the cuckoo search algorithm with the Nelder-Mead method in order to solve the integer and minimax optimization…
Peiyu Zong, Wenpeng Deng, Jian Liu, Jue Ruan
The rapid advancements in sequencing length necessitate the adoption of increasingly efficient sequence alignment algorithms. The Needleman-Wunsch method introduces the foundational dynamic programming (DP) matrix calculation for global alignment, which evaluates the overall alignment of sequences. However, this method…
Bilal Khurshid, Shahid Maqsood, Yahya Khurshid, Khawar Naeem + 1 more
This study investigates the no-wait flow shop scheduling problem and proposes a hybrid (HES-IG) algorithm that utilizes makespan as the objective function. To address the complexity of this NP-hard problem, the HES-IG algorithm combines evolution strategies (ES) and iterated greedy (IG) algorithm, as hybridizing…
Fabio F. de Oliveira, Leonardo A. Dias, Marcelo A. C. Fernandes
In bioinformatics, alignment is an essential technique for finding similarities between biological sequences. Usually, the alignment is performed with the Smith-Waterman (SW) algorithm, a well-known sequence alignment technique of high-level precision based on dynamic programming. However, given the massive data volume…
Yidi Hao, Baodong Qin, Yitian Sun, Jose Manuel Molina López
Due to the rapid development of machine-learning technology, companies can build complex models to provide prediction or classification services for customers without resources. A large number of related solutions exist to protect the privacy of models and user data. However, these efforts require costly communication…
Morihiro Hayashida, Tatsuya Akutsu
Background Comparison of various kinds of biological data is one of the main problems in bioinformatics and systems biology. Data compression methods have been applied to comparison of large sequence data and protein structure data. Since it is still difficult to compare global structures of large biological networks…
Haojing Shao, Jue Ruan
Increasing the accuracy of the nucleotide sequence alignment is an essential issue in genomics research. Although classic dynamic-programming algorithms (e.g., Smith-Waterman and Needleman–Wunsch) guarantee to produce the optimal result, their time complexity hinders the application of large-scale sequence alignment.…
Jordan M. Eizenga, Benedict Paten
Modern genomic sequencing data is trending toward longer sequences with higher accuracy. Many analyses using these data will center on alignments, but classical exact alignment algorithms are infeasible for long sequences. The recently proposed WFA algorithm demonstrated how to perform exact alignment for long, similar…
Martin Šošić, Mile Šikić
We present Edlib, an open-source C/C++ library for exact pairwise sequence alignment using edit distance. We compare Edlib to other libraries and show that it is the fastest while not lacking in functionality, and can also easily handle very large sequences. Being easy to use, flexible, fast and low on memory usage, we…