Center and distinguisher for strings with unbounded alphabet
From MaRDI portal
Publication:1810861
DOI10.1023/A:1019545003953zbMath1046.90105OpenAlexW1491693718MaRDI QIDQ1810861
Lusheng Wang, Xiaotie Deng, Guo Jun Li
Publication date: 9 June 2003
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1019545003953
approximation algorithmcomputational molecular biologycenter string selectiondistinguishing string selectionunbounded alphabet size
Analysis of algorithms (68W40) Integer programming (90C10) Nonnumerical algorithms (68W05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem ⋮ A heuristic algorithm based on Lagrangian relaxation for the closest string problem
This page was built for publication: Center and distinguisher for strings with unbounded alphabet