Exploiting pseudo-locality of interchange distance

DOI10.1007/978-3-030-86692-1_19MaRDI QIDQ2146144zbMATH OpenOpenAlexFDO

Authors Avivit Levy

Publication date 15 June 2022

Full work available at URL https://doi.org/10.1007/978-3-030-86692-1_19

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• On computing the nearest neighbor interchange distance
• A computationally efficient approximation to the nearest neighbor interchange metric
• The distortion of locality sensitive hashing
• On the Distortion of Locality Sensitive Hashing
• Locality preserving matching
• Locality pursuit embedding
• scientific article; zbMATH DE number 26598
• A locally linear embedding based on an improved distance

Cites work

• A simple algorithm for approximating the text-to-pattern Hamming distance
• An Extension of the String-to-String Correction Problem
• Approximate Hamming distance in a stream
• Approximate nearest neighbor: towards removing the curse of dimensionality
• Approximate swapped matching.
• Approximating text-to-pattern Hamming distances
• Cycle detection and correction
• Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
• Fast algorithms for approximately counting mismatches
• scientific article; zbMATH DE number 3471577 (Why is no real title available?)
• scientific article; zbMATH DE number 1263193 (Why is no real title available?)
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• Interchange rearrangement: the element-cost model
• LCSk: a refined similarity measure
• On the cost of interchange rearrangement in strings
• Optimal data-dependent hashing for approximate near neighbors
• Overlap matching.
• Pattern matching with address errors: rearrangement distances
• Polynomial-time algorithm for computing translocation distance between genomes
• Sorting by Transpositions
• Sorting permutations by block-interchanges
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• String rearrangement metrics: a survey
• The complexity of finding minimum-length generator sequences

Describes a project that uses

Uses Software

• FALCONN

This page was built for publication: Exploiting pseudo-locality of interchange distance

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