Abstract is missing.
- The Discreet Charm of Multi-Pattern CodesIgor O. Zavadskyi. 1 [doi]
- Fast Matching Statistics for Sets of Long Similar StringsZsuzsanna Lipták, Martina Luca, Francesco Masillo, Simon J. Puglisi. 3-15 [doi]
- Beyond Horspool: A Comparative Analysis in Sampled MatchingSimone Faro, Francesco Pio Marino, Antonino Andrea Moschetto. 16-26 [doi]
- Refining SFDC Compression Scheme with Block Text SegmentationSimone Faro, Alfio Spoto. 27-41 [doi]
- On Practical Data Structures for Sorted Range ReportingGolnaz Badkobeh, Sehar Naveed, Simon J. Puglisi. 42-49 [doi]
- A Quantum Circuit for the Cyclic String Matching ProblemArianna Pavone, Caterina Viola. 50-70 [doi]
- A Language-Theoretic Approach to the Heapability of Signed PermutationsGabriel Istrate. 71-85 [doi]
- Cdbgtricks: Strategies to update a compacted de Bruijn graphKhodor Hannoush, Camille Marchet, Pierre Peterlongo. 86-103 [doi]