Efficient computations of ℓ[subscript 1] and ℓ[subscript ∞] rearrangement distances
Name
Indyk_Efficient computations.pdf
Size
1.04 MB
Format
Adobe PDF
Checksum (MD5)
637e98c88a3816187ef3d698d09f68e8
Author(s)
Amir, Amihood
Aumann, Yonatan
Indyk, Piotr
Levy, Avivit
Porat, Ely
Date Issued
July 2009
Journal
Theoretical Computer Science
Publisher
Elsevier
Citation
Amir, Amihood, Yonatan Aumann, Piotr Indyk, Avivit Levy, and Ely Porat. “Efficient computations of ℓ[subscript 1] and ℓ[subscript ∞] rearrangement distances.” Theoretical Computer Science 410, no. 43 (October 2009): 4382–4390. © 2009 Elsevier B.V.
Version
Final published version
Abstract
Recently, a new pattern matching paradigm was proposed, pattern matching with address errors. In this paradigm approximate string matching problems are studied, where the content is unaltered and only the locations of the different entries may change. Specifically, a broad class of problems was defined—the class of rearrangement errors. In this type of error the pattern is transformed through a sequence of rearrangement operations, each with an associated cost. The natural ℓ[subscript 1] and ℓ[subscript 2] rearrangement systems were considered. The best algorithm presented for general patterns, that may have repeating symbols, is O(nm). In this paper, we show that the problem can be approximated in linear time for general patterns! Another natural rearrangement system is considered in this paper—the ℓ[subscript ∞] rearrangement distance. For this new rearrangement system efficient exact solutions for different variants of the problem are provided, as well as a faster approximation.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.tcs.2009.07.019
