RAM-MSA: An anytime memory-bounded method for exact multiple sequence alignment using path finding
Clicks: 1
ID: 317478
2026
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
0.0
/100
1 views
0 readers
AI Quality Assessment
Not analyzed
Readership in this journal
Ranked #97 of 104 articles by views in Bioinformatics advances
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Abstract Motivation Multiple sequence alignment (MSA) is a crucial process in bioinformatics, essential for understanding functional or structural relationships among DNA or protein sequences. As the number of sequences increases, existing exact MSA methods, which produce algorithmically optimal alignments, suffer from exponentially increasing memory consumption. Existing heuristic MSA methods, on the other hand, rapidly compute alignments on large sequence sets by sacrificing their accuracy. Current approaches remain insufficient, underscoring the necessity of a novel approach that bridges the gap between heuristic and exact MSA methods. Specifically, there is an urgent need for an exact MSA approach that enables users to obtain the best possible alignment within their available computation time. Results We propose Recursive Anytime Memory-bounded MSA (RAM-MSA), a novel exact MSA method that manages exponential memory demands within a limited memory space. The proposed method promptly generates an initial MSA result and continuously outputs alignments with higher accuracy, ultimately providing an exact alignment. Experimental evaluations demonstrate that RAM-MSA reduced memory usage to 62.51% compared to a state-of-the-art exact MSA method. In terms of anytime performance, the proposed method generates an initial alignment with an objective score of 0.96 in a comparable time to the heuristic methods, and continues to improve the alignment until the exact result is obtained. Unlike existing path-finding-based methods, which support only linear gap penalties, RAM-MSA also handles affine gap penalties. This study provides a systematic quantification of the discrepancy between algorithmically optimal alignments and structurally-derived reference alignments. Availability and implementation Source code is available at https://github.com/luxwj/RAM-MSA.
| Reference Key |
openalex_W7164906053
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Jue Wang, Fumihiko Ino |
| Journal | Bioinformatics advances |
| Year | 2026 |
| DOI |
10.1093/bioadv/vbag170
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.