Multiple sequence alignment (MSA) is a ubiquitous problem in computational biology. Although it is NP-hard to find an optimal solution for an arbitrary number of sequences, due to the importance of this problem researchers are trying to push the limits of exact algorithms further. Since MSA can be cast as a classical path finding problem, it is attracting a growing number of AI researchers interested in heuristic search algorithms as a challenge with actual practical relevance. In this paper, we first review two previous, complementary lines of research. Based on Hirschbergs algorithm, Dynamic Programming needs O(kN^(k-1)) space to store both the search frontier and the nodes needed to reconstruct the solution path, for k sequences of length N. Best first search, on the other hand, has the advantage of bounding the search space that has to be explored using a heuristic. However, it is necessary to maintain all explored nodes up to the final solution in order to prevent the search from re-expanding them at higher cost. Earlier approaches to reduce the Closed list are either incompatible with pruning methods for the Open list, or must retain at least the boundary of the Closed list. In this article, we present an algorithm that attempts at combining the respective advantages; like A* it uses a heuristic for pruning the search space, but reduces both the maximum Open and Closed size to O(kN^(k-1)), as in Dynamic Programming. The underlying idea is to conduct a series of searches with successively increasing upper bounds, but using the DP ordering as the key for the Open priority queue. With a suitable choice of thresholds, in practice, a running time below four times that of A* can be expected. In our experiments we show that our algorithm outperforms one of the currently most successful algorithms for optimal multiple sequence alignments, Partial Expansion A*, both in time and memory. Moreover, we apply a refined heuristic based on optimal alignments not only of pairs of sequences, but of larger subsets. This idea is not new; however, to make it practically relevant we show that it is equally important to bound the heuristic computation appropriately, or the overhead can obliterate any possible gain. Furthermore, we discuss a number of improvements in time and space efficiency with regard to practical implementations. Our algorithm, used in conjunction with higher-dimensional heuristics, is able to calculate for the first time the optimal alignment for almost all of the problems in Reference 1 of the benchmark database BAliBASE.
Improved Emotional Alignment of AI and Humans: Human Ratings of Emotions Expressed by Stable Diffusion v1, DALL-E 2, and DALL-E 3
Delft University of Technology(代尔夫特理工大学);Delft Institute of Positive Design(代尔夫特积极设计研究所);Department of Human-Centered Design(以人为本设计系);Playpower Labs Pvt Ltd(Playpower实验室私人有限公司);School of Design(设计学院);Hong Kong Polytechnic University(香港理工大学);Department of Psychology(心理学系);Utrecht University(乌得勒支大学)
HEAL: Hierarchical Embedding Alignment Loss for Improved Retrieval and Representation Learning
Los Alamos National Laboratory(洛斯阿拉莫斯国家实验室);University of Maryland(马里兰大学);University of Maryland, Baltimore County(马里兰大学巴尔的摩分校);Harvard Medical School(哈佛医学院)
Evolutionary Architecture Search through Grammar-Based Sequence Alignment
Carlos III University of Madrid(马德里卡洛斯三世大学);University of Edinburgh(爱丁堡大学);Instituto de Investigación Sanitaria Gregorio Marañón(Gregorio Marañón卫生研究院);Helmholtz-Zentrum Berlin für Materialien und Energie(柏林材料与能源研究中心);ELLIS Institute Tübingen(图宾根ELLIS研究所);University of Glasgow(格拉斯哥大学)
LearnAlign: Data Selection for LLM Reinforcement Learning with Improved Gradient Alignment
Nanjing University(南京大学);The Hong Kong Polytechnic University(香港理工大学);The Chinese University of Hong Kong(香港中文大学);University of Science and Technology of China(中国科学技术大学);Institute of Information Engineering, Chinese Academy of Sciences(中国科学院信息工程研究所)
Optimising Random Forest Machine Learning Algorithms for User VR Experience Prediction Based on Iterative Local Search-Sparrow Search Algorithm
Northeastern University(东北大学);University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);The University of Tokyo(东京大学);Georgia Institute of Technology(佐治亚理工学院);Northern Arizona University(北亚利桑那大学)
TEVI: Text-Conditioned Editing of Visual Representations via Sparse Autoencoders for Improved Vision-Language Alignment
Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbrücken, Germany(马克斯·普朗克研究所信息学院,萨尔兰信息学院,德国萨尔布吕肯);Department of Language Science and Technology, Saarland University, Saarbrücken, Germany(语言科学与技术系,萨尔兰大学,德国萨尔布吕肯)
Search-Optimized Quantization in Biomedical Ontology Alignment
CNRS(法国国家科学研究中心);Univ. Lille(里尔大学);UMR 8163 - STL - Savoirs Textes Langage(知识文本语言联合研究单位);UMR 9189 - CRIStAL - Centre de Recherche en Informatique Signal et Automatique de Lille(里尔计算机、信号与自动化研究中心)