Approximating General Metric Distances Between a Pattern and a Text

Details Approximating General Metric Distances Between a Pattern and a Text Approximating General Metric Distances Between a Pattern and a Text

2008-02-11

arxiv.org/abs/0802.1427v1

SODA 2008

Computer Science

Data Structures and Algorithms

This is updated version of paper appered in SODA 2008

Scientific paper

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 $\Sigma$, and let $\dist$ be a metric on $\Sigma$. 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 $\epsilon$-approximation algorithm for this problem which runs in time $O(\frac{1}{\epsilon^2}n\cdot \mathrm{polylog}(n,\abs{\Sigma}))$

Affiliated with

Also associated with

No associations

Rating

Approximating General Metric Distances Between a Pattern and a Text does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximating General Metric Distances Between a Pattern and a Text, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating General Metric Distances Between a Pattern and a Text will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-625088