sawnuti
Comparing Sequences with Non-Uniform Time Intervals
The SAWNUTI algorithm performs sequence comparison for finite sequences of discrete events with non-uniform time intervals. Further description of the algorithm can be found in the paper: A. Murph, A. Flynt, B. R. King (2021). Comparing finite sequences of discrete events with non-uniform time intervals, Sequential Analysis, 40(3), 291-313. <doi:10.1080/07474946.2021.1940491>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.1 |
rolling linux/jammy R-4.5 | sawnuti_0.1.1.tar.gz |
28.8 KiB |
0.1.1 |
rolling linux/noble R-4.5 | sawnuti_0.1.1.tar.gz |
28.7 KiB |
0.1.1 |
rolling source/ R- | sawnuti_0.1.1.tar.gz |
6.1 KiB |
0.1.1 |
latest linux/jammy R-4.5 | sawnuti_0.1.1.tar.gz |
28.8 KiB |
0.1.1 |
latest linux/noble R-4.5 | sawnuti_0.1.1.tar.gz |
28.7 KiB |
0.1.1 |
latest source/ R- | sawnuti_0.1.1.tar.gz |
6.1 KiB |
0.1.1 |
2026-04-26 source/ R- | sawnuti_0.1.1.tar.gz |
6.1 KiB |
0.1.1 |
2026-04-23 source/ R- | sawnuti_0.1.1.tar.gz |
6.1 KiB |
0.1.1 |
2026-04-09 windows/windows R-4.5 | sawnuti_0.1.1.zip |
31.5 KiB |
0.1.1 |
2025-04-20 source/ R- | sawnuti_0.1.1.tar.gz |
6.1 KiB |