Efficient computations of _1 and _ rearrangement distances

DOI10.1016/J.TCS.2009.07.019MaRDI QIDQ732031zbMATH OpenOpenAlexFDO

Authors Amihood Amir, Yonatan Aumann, Piotr Indyk, Ely Porat, Avivit Levy

Publication date 9 October 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.07.019

zbMATH Keywords

approximate string matchingpattern matchingrearrangement distances

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Pattern matching with address errors: rearrangement distances
• String rearrangement metrics: a survey
• Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
• Approximate matching in the \(L_{\infty }\) metric
• Combinatorial Pattern Matching

Cites work

• An Extension of the String-to-String Correction Problem
• Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics
• Approximate String Matching with Address Bit Errors
• Automata, Languages and Programming
• Dictionary matching and indexing with errors and don't cares
• Efficient string matching with k mismatches
• Fast algorithms for approximately counting mismatches
• Faster algorithms for string matching with k mismatches
• Generalized String Matching
• scientific article; zbMATH DE number 1003303 (Why is no real title available?)
• scientific article; zbMATH DE number 3947305 (Why is no real title available?)
• scientific article; zbMATH DE number 3984596 (Why is no real title available?)
• scientific article; zbMATH DE number 3471577 (Why is no real title available?)
• scientific article; zbMATH DE number 1303588 (Why is no real title available?)
• scientific article; zbMATH DE number 910911 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• On the Cost of Interchange Rearrangement in Strings
• Pattern matching with address errors
• Sorting by Transpositions
• Sorting permutations by block-interchanges

Cited in

(8)

• Length-weighted \(\lambda\)-rearrangement distance
• Order-preserving pattern matching indeterminate strings
• Order-preserving matching
• String rearrangement metrics: a survey
• Order-preserving pattern matching indeterminate strings
• A simple algorithm for approximating the text-to-pattern Hamming distance
• Approximate string matching with stuck address bits
• Pattern matching with address errors: rearrangement distances

This page was built for publication: Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732031)