Approximate Swapped Matching

@inproceedings{Amir2000ApproximateSM,
  title={Approximate Swapped Matching},
  author={Amihood Amir and Moshe Lewenstein and Ely Porat},
  booktitle={FSTTCS},
  year={2000}
}
Let a text string T of n symbols and a pattern string P of m symbols from alphabet be given. A swapped version P 0 of P is a length m string derived from P by a series of local swaps, (i.e. p 0 ` p `+1 and p 0 `+1 p `) where each element can participate in no more than one swap. The Pattern Matching with Swaps problem is that of nding all locations i of T for which there exists a swapped version P 0 of P with an exact matching of P 0 in location i of T. Recently, some eecient algorithms were… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS, ESTIMATED 39% COVERAGE

51 Citations

0510'03'06'10'14'18
Citations per Year
Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

String matching and other products

  • M. J. Fischer, M. S. Paterson
  • Complexity of Compu- tation,
  • 1974
Highly Influential
7 Excerpts

Randomized swap matching in o(m logm log j j) time

  • R. Cole, R. Harihan
  • Technical Report TR1999-789,
  • 1999
Highly Influential
4 Excerpts

On the complexity of the extended string-to-string correction problem

  • R. A. Wagner
  • In Proc. 7th ACM STOC,
  • 1975
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…