The Smoothed Complexity of Edit Distance

DOI10.1007/978-3-540-70575-8_30MaRDI QIDQ3521932zbMATH OpenOpenAlexFDO

Authors Alexandr Andoni, Robert Krauthgamer

Publication date 28 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70575-8_30

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• The smoothed complexity of edit distance
• Efficiently approximating edit distance between pseudorandom strings
• Near-linear time edit distance for indel channels
• Approximating edit distance in near-linear time
• Approximating edit distance in near-linear time

Cited in

(8)

• Why greed works for shortest common superstring problem
• Edit Distance to Monotonicity in Sliding Windows
• The smoothed complexity of edit distance
• The Andoni-Krauthgamer-Razenshteyn characterization of sketchable norms fails for sketchable metrics
• Efficiently approximating edit distance between pseudorandom strings
• Near-linear time edit distance for indel channels
• Global alignment of molecular sequences via ancestral state reconstruction
• Streaming and small space approximation algorithms for edit distance and longest common subsequence

This page was built for publication: The Smoothed Complexity of Edit Distance

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