131 citations
- Tel Aviv UniversityIL3 papers
- Ben-Gurion University of the NegevIL2 papers
- Fuzhou UniversityCN2 papers
- Yangtze Normal UniversityCN2 papers
- Ariel UniversityIL1 paper
- Bar-Ilan UniversityIL1 paper
- Boston UniversityUS1 paper
- CMC UniversityVN1 paper
- Columbia UniversityUS1 paper
- Gettysburg CollegeUS1 paper
- Hanoi National University of EducationVN1 paper
- Johns Hopkins UniversityUS1 paper
Showing cs.DSShow all
3 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…
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…