RAM-MSA: an anytime memory-bounded method for exact multiple sequence alignment using path finding
Jue Wang, Fumihiko Ino, Alia Benkahla · 2026
Read RAM-MSA: an anytime memory-bounded method for exact multiple sequence alignment using path finding by Jue Wang, Fumihiko Ino, Alia Benkahla (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/PMC13317123.txt.
Description
Jue Wang, Fumihiko Ino, and Alia Benkahla present RAM-MSA in a 2026 computing paper, a method for aligning many DNA or protein sequences exactly without blowing up memory. Exact aligners give provably best answers but eat memory as sequences pile up, while fast shortcuts sacrifice accuracy.
Their recursive method bounds memory, returns a first alignment quickly, then keeps improving it until the exact answer lands. Tests cut memory use to 62.51 percent of a leading exact method's footprint in the reported comparison, and the first output scored near heuristic speed with a quality score of 0.96 in the benchmark. It also handles the more realistic affine gap costs that older path methods skip.
Catalog record
| CREATOR | Jue Wang, Fumihiko Ino, Alia Benkahla |
|---|---|
| YEAR | 2026 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 59624 |
| LICENSE | https://creativecommons.org/licenses/by/4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |