On the Closest String via Rank Distance

DOI10.1007/978-3-642-31265-6_33zbMath1358.68337OpenAlexW198287481MaRDI QIDQ2904514

Alexandru Popa, Liviu P. Dinu

Publication date: 14 August 2012

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31265-6_33

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Algorithms on strings (68W32)

Related Items (2)

Listing Center Strings Under the Edit Distance Metric ⋮ Optimum Solution of the Closest String Problem via Rank Distance

This page was built for publication: On the Closest String via Rank Distance