Show simple item record

dc.contributor.authorAmir, Amihood
dc.contributor.authorAumann, Yonatan
dc.contributor.authorIndyk, Piotr
dc.contributor.authorLevy, Avivit
dc.contributor.authorPorat, Ely
dc.date.accessioned2014-05-15T18:37:54Z
dc.date.available2014-05-15T18:37:54Z
dc.date.issued2009-07
dc.identifier.issn03043975
dc.identifier.urihttp://hdl.handle.net/1721.1/87010
dc.description.abstractRecently, 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.en_US
dc.language.isoen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.tcs.2009.07.019en_US
dc.rightsArticle 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.en_US
dc.sourceElsevier Open Archiveen_US
dc.titleEfficient computations of ℓ[subscript 1] and ℓ[subscript ∞] rearrangement distancesen_US
dc.typeArticleen_US
dc.identifier.citationAmir, 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.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorIndyk, Piotren_US
dc.relation.journalTheoretical Computer Scienceen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsAmir, Amihood; Aumann, Yonatan; Indyk, Piotr; Levy, Avivit; Porat, Elyen_US
dc.identifier.orcidhttps://orcid.org/0000-0002-7983-9524
mit.licensePUBLISHER_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record