text.alignment
Text Alignment with Smith-Waterman
Find similarities between texts using the Smith-Waterman algorithm. The algorithm performs local sequence alignment and determines similar regions between two strings. The Smith-Waterman algorithm is explained in the paper: "Identification of common molecular subsequences" by T.F.Smith and M.S.Waterman (1981), available at <doi:10.1016/0022-2836(81)90087-5>. This package implements the same logic for sequences of words and letters instead of molecular sequences.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.5 |
rolling linux/jammy R-4.5 | text.alignment_0.1.5.tar.gz |
381.7 KiB |
0.1.5 |
rolling linux/noble R-4.5 | text.alignment_0.1.5.tar.gz |
384.6 KiB |
0.1.5 |
rolling source/ R- | text.alignment_0.1.5.tar.gz |
328.5 KiB |
0.1.5 |
latest linux/jammy R-4.5 | text.alignment_0.1.5.tar.gz |
381.7 KiB |
0.1.5 |
latest linux/noble R-4.5 | text.alignment_0.1.5.tar.gz |
384.6 KiB |
0.1.5 |
latest source/ R- | text.alignment_0.1.5.tar.gz |
328.5 KiB |
0.1.5 |
2026-04-26 source/ R- | text.alignment_0.1.5.tar.gz |
328.5 KiB |
0.1.5 |
2026-04-23 source/ R- | text.alignment_0.1.5.tar.gz |
328.5 KiB |
0.1.5 |
2026-04-09 windows/windows R-4.5 | text.alignment_0.1.5.zip |
701.6 KiB |
0.1.4 |
2025-04-20 source/ R- | text.alignment_0.1.4.tar.gz |
328.5 KiB |