Searching for a Set of Correlated Patterns. - Shmuel T. Klein; B. Riva Shalom (SPIRE, 2004)

Approximate String Matching with Swap and Mismatch. - Ohad Lipsky; Benny Porat; Ely Porat; B. Riva Shalom; Asaf Tsur (ISAAC, 2007)

Generalized LCS. - Amihood Amir; Tzvika Hartman; Oren Kapah; B. Riva Shalom; Dekel Tsur (SPIRE, 2007)

Improved approximate common interval. - Amihood Amir; Leszek Gasieniec; B. Riva Shalom (Inf. Process. Lett., 2007)

Searching for a set of correlated patterns. - Shmuel T. Klein; B. Riva Shalom; Yair Kaufman (J. Discrete Algorithms, 2007)

Weighted LCS. - Amihood Amir; Zvi Gotthilf; B. Riva Shalom (IWOCA, 2009)

String matching with up to k swaps and mismatches. - Ohad Lipsky; Benny Porat; Ely Porat; B. Riva Shalom; Asaf Tsur (Inf. Comput., 2010)

Weighted Shortest Common Supersequence. - Amihood Amir; Zvi Gotthilf; B. Riva Shalom (SPIRE, 2011)

Longest Common Subsequence in k Length Substrings. - Gary Benson; Avivit Levy; B. Riva Shalom (SISAP, 2013)

Dictionary Matching with One Gap. - Amihood Amir; Avivit Levy; Ely Porat; B. Riva Shalom (CPM, 2014)

Online Dictionary Matching with One Gap. - Amihood Amir; Tsvi Kopelowitz; Avivit Levy; Seth Pettie; Ely Porat; B. Riva Shalom (CoRR, 2015)

Dictionary matching with a few gaps. - Amihood Amir; Avivit Levy; Ely Porat; B. Riva Shalom (Theor. Comput. Sci., 2015)

Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap. - Amihood Amir; Tsvi Kopelowitz; Avivit Levy; Seth Pettie; Ely Porat; B. Riva Shalom (ISAAC, 2016)

LCSk: A refined similarity measure. - Gary Benson; Avivit Levy; S. Maimoni; D. Noifeld; B. Riva Shalom (Theor. Comput. Sci., 2016)

Online Recognition of Dictionary with One Gap. - Amihood Amir; Avivit Levy; Ely Porat; B. Riva Shalom (PSC, 2017)

Parameterized Dictionary Matching with One Gap. - B. Riva Shalom (PSC, 2018)

Online Parameterized Dictionary Matching with One Gap. - Avivit Levy; B. Riva Shalom (PSC, 2019)

Mind the Gap! - Online Dictionary Matching with One Gap. - Amihood Amir; Tsvi Kopelowitz; Avivit Levy; Seth Pettie; Ely Porat; B. Riva Shalom (Algorithmica, 2019)

Parameterized dictionary matching and recognition with one gap. - B. Riva Shalom (Theor. Comput. Sci., 2021)

Partial Permutations Comparison, Maintenance and Applications. - Avivit Levy; Ely Porat; B. Riva Shalom (CPM, 2022)

A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges. - Avivit Levy; B. Riva Shalom (Algorithmica, 2022)

A Multi-clustering Unbiased Relative Prediction Recommendation Scheme for Data with Hidden Multiple Overlaps. - Avivit Levy; Michal Chalamish; B. Riva Shalom; Guy Sharir; Opal Peltzman; Sivan Salzmann (SAI (2), 2024)

Burst Edit Distance. - Itai Boneh; Shay Golan 001; Avivit Levy; Ely Porat; B. Riva Shalom (SPIRE, 2024)

A Guide to Similarity Measures. - Avivit Levy; B. Riva Shalom; Michal Chalamish (CoRR, 2024)

Longest Common Subsequence in K-Length Substrings for Run-Length Encoded Strings. - B. Riva Shalom; Eitan Kondratovsky; Ely Porat (SPIRE, 2025)

A guide to similarity measures and their data science applications. - Avivit Levy; B. Riva Shalom; Michal Chalamish (J. Big Data, 2025)