Name
Abstract | ||
|---|---|---|
We consider the problem of lossless spaced seed design for approximate pattern matching. We show that, using mathematical objects known as perfect rulers, we can derive a family of spaced seeds for matching with up to two errors. We analyze these seeds with respect to the trade-off they offer between seed weight and the minimum length of the pattern to be matched. We prove that for patterns of length up to a few hundreds our seeds have a larger weight, hence a better filtration efficiency, than the ones known in the literature. In this context, we study in depth the specific case of Wichmann rulers and prove some preliminary results on the generalization of our approach to the larger class of unrestricted rulers. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.3233/FI-2014-1009 | string processing and information retrieval |
Keywords | Field | DocType |
approximate pattern matching,wichmann ruler,spaced seeds design,perfect ruler,lossless spaced seed design,larger weight,larger class,mathematical object,better filtration efficiency,minimum length,seed weight,spaced seed,patterns,approximation theory,generalization,algorithms | Discrete mathematics,Combinatorics,Skewness,Approximation theory,Algorithm,Filter (signal processing),Pattern matching,Mathematics,Lossless compression | Conference |
Volume | Issue | ISSN |
131 | 2 | 0169-2968 |
Citations | PageRank | References |
4 | 0.41 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lavinia Egidi | 1 | 91 | 10.21 |
| Giovanni Manzini | 2 | 1584 | 111.42 |