Consensus Strings with Small Maximum Distance and Small Distance Sum-Reference-Cited by-同舟云学术

Consensus Strings with Small Maximum Distance and Small Distance Sum

Published:2019-11-04 Issue:5 Volume:82 Page:1378-1409
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Bulteau Laurent,Schmid Markus L.^ORCID

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-019-00647-9.pdf

Reference30 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. Theor. Comput. Sci. 412, 5239–5246 (2011)

2. Basavaraju, M., Panolan, F., Rai, A., Ramanujan, M.S., Saurabh, S.: On the kernelization complexity of string problems. Theor. Comput. Sci. 730, 21–31 (2018)

3. Ben-Dor, A., Lancia, G., Ravi, R., Perone, J.: Banishing bias from consensus sequences. In: Proc. 8th Annual Symposium on Combinatorial Pattern Matching, CPM 1997, LNCS, 1264, pp. 247–261 (1997)

4. Bodlaender, H.L., Thomassé, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35), 4570–4578 (2011)

5. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discrete Math. 28(1), 277–305 (2014)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The complexity of binary matrix completion under diameter constraints;Journal of Computer and System Sciences;2023-03

2. Binary Matrix Completion Under Diameter Constraints;LEIBNIZ INT PR INFOR;2021