Author:
Han Yo-Sub,Ko Sang-Ki,Ng Timothy,Salomaa Kai
Publisher
Springer International Publishing
Reference27 articles.
1. Amir, A., Landau, G.M., Na, J.C., Park, H., Park, K., Sim, J.S.: Efficient algorithms for consensus string problems minimizing both distance sum and radius. Theoret. Comput. Sci. 412(39), 5239–5246 (2011)
2. Amir, A., Paryenty, H., Roditty, L.: On the hardness of the consensus string problem. Inf. Process. Lett. 113(10–11), 371–374 (2013)
3. Calude, C.S., Salomaa, K., Yu, S.: Additive distances and quasi-distances between words. J. Univ. Comput. Sci. 8(2), 141–152 (2002)
4. Choffrut, C., Pighizzini, G.: Distances between languages and reflexivity of relations. Theoret. Comput. Sci. 286(1), 117–138 (2002)
5. Cohen, G.D., Honkala, I.S., Litsyn, S.N., Solé, P.: Long packing and covering codes. IEEE Trans. Inf. Theor. 43(5), 1617–1619 (2006)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献