Exploiting pseudo-locality of interchange distance

DOI10.1007/978-3-030-86692-1_19OpenAlexW3202608727MaRDI QIDQ2146144

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)

Uses Software

• FALCONN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• LCS\(k\): a refined similarity measure
• Sorting permutations by block-interchanges
• Interchange rearrangement: the element-cost model
• Pattern matching with address errors: rearrangement distances
• The complexity of finding minimum-length generator sequences
• Fast algorithms for approximately counting mismatches
• Overlap matching.
• Approximate swapped matching.
• Cycle detection and correction
• Optimal Data-Dependent Hashing for Approximate Near Neighbors
• String Rearrangement Metrics: A Survey
• An Extension of the String-to-String Correction Problem
• Sorting Permutations by Reversals and Eulerian Cycle Decompositions
• Sorting by Transpositions
• Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
• Approximate Hamming Distance in a Stream
• Approximating text-to-pattern Hamming distances
• A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance
• On the Cost of Interchange Rearrangement in Strings
• Polynomial-time algorithm for computing translocation distance between genomes

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