Author:
Della Croce F.,Salassa F.
Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference7 articles.
1. Chen J. Iterative rounding for the closest string problem. In: Proceedings of the fifth conference on computability in Europe (CIE). Lecture notes in computer science, vol. 5635, 2009. p. 89–98.
2. Chimani M, Woste M, Bocker S. A closer look at the closest string and closest substring problem. In: Proceedings of the 13th workshop on algorithm engineering and experiments (ALENEX), 2011. p. 13–24.
3. Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem;Della Croce;Computers & Operations Research,2012
4. Exact algorithm and heuristic for the Closest String Problem;Liu;Computers & Operations Research,2011
5. Comparative analysis of multiple protein-sequence alignment methods;McClure;Molecular Biology and Evolution,1994
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献