3 citations · 5 across the 4 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014★ 1 cited
Dictionary Matching with One Gap
Amihood Amir, Avivit Levy, Ely Porat +1
The dictionary matching with gaps problem is to preprocess a dictionary of gapped patterns over alphabet , where each gapped pattern is a sequence…
cs.DS2014★ 1 cited
Longest Common Subsequence in k-length substrings
Gary Benson, Avivit Levy, Riva Shalom
In this paper we define a new problem, motivated by computational biology, aiming at finding the maximal number of length , matching in both input strings wh…