Approximating General Metric Distances Between a Pattern and a Text
| dc.creator | Efremenko, Klim | |
| dc.creator | Porat, Ely | |
| dc.date | 2008-02-11 | |
| dc.date.accessioned | 2026-07-07T09:19:53Z | |
| dc.date.available | 2026-07-07T09:19:53Z | |
| dc.description | Let $T=t_0 ... t_{n-1}$ be a text and $P = p_0 ... p_{m-1}$ a pattern taken from some finite alphabet set $Σ$, and let $\dist$ be a metric on $Σ$. We consider the problem of calculating the sum of distances between the symbols of $P$ and the symbols of substrings of $T$ of length $m$ for all possible offsets. We present an $ε$-approximation algorithm for this problem which runs in time $O(\frac{1}{ε^2}n\cdot \mathrm{polylog}(n,\absΣ))$ | |
| dc.description | This is updated version of paper appered in SODA 2008 | |
| dc.identifier | https://arxiv.org/abs/0802.1427 | |
| dc.identifier | http://arxiv.org/abs/0802.1427 | |
| dc.identifier | SODA 2008 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/154560 | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Approximating General Metric Distances Between a Pattern and a Text | |
| dc.type | text |