1 citations · 2 across the 2 of their papers we have counts for
2 papers
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.DS2012★ 1 cited
On Approximating String Selection Problems with Outliers
Christina Boucher, Gad M. Landau, Avivit Levy +2
Many problems in bioinformatics are about finding strings that approximately represent a collection of given strings. We look at more general problems where some input strings can…