Abstract
In several areas, for example in bioinformatics and in AI planning, the Shortest Common Superstring problem (SCS) and variants thereof have been successfully applied for string comparison. In this paper we consider two variants of SCS recently introduced, namely Restricted Common Superstring (RCS) and Swapped Common Superstring (SRCS). In RCS we are given a set \(S\) of strings and a multiset \(\mathcal {M}\) of symbols, and we look for an ordering \(\mathcal {M}_o\) of \(\mathcal {M}\) such that the number of input strings which are substrings of \(\mathcal {M}_o\) is maximized. In SRCS we are given a set \(S\) of strings and a text \(\mathcal {T}\), and we look for a swap ordering \(\mathcal {T}_o\) of \(\mathcal {T}\) (an ordering of \(\mathcal {T}\) obtained by swapping only some pairs of adjacent symbols) such that the number of input strings which are substrings of \(\mathcal {T}_o\) is maximized. In this paper we propose a multivariate algorithmic analysis of the complexity of the two problems, aiming at determining how different parameters influence the complexity of the two problems. We consider as interesting parameters the size of the solutions (that is the number of input strings contained in the computed superstring), the maximum length of the given input strings, the size of the alphabet over which the input strings range. First, we give two fixed-parameter algorithms, where the parameter is the size of the solution, for SRCS and lRCS (the RCS problem restricted to strings of length bounded by a parameter \(\ell \)). Furthermore, we complement these results by showing that SRCS and lRCS do not admit a polynomial kernel unless \(NP \subseteq coNP/Poly\). Then, we show that SRCS is APX-hard even when the input strings have length bounded by a constant (equal to \(10\)) or are over a binary alphabet.
Similar content being viewed by others
References
Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1–2), 123–134 (2000)
Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995)
Amir, A., Landau, G.M., Lewenstein, M., Lewenstein, N.: Efficient special cases of pattern matching with swaps. Inform. Process. Lett. 68(3), 125–132 (1998)
Amir, A., Aumann, Y., Landau, G.M., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. J. Algorithm. 37(2), 247–266 (2000)
Amir, A., Eisenberg, E., Porat, E.: Swap and mismatch edit distance. Algorithmica 45(1), 109–120 (2006)
Ardila, Y.J.P., Iliopoulos, C.S., Landau, G.M., Mohamed, M.: Approximation algorithm for the cyclic swap problem. Stringology 2005, 190–200 (2005)
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag, Heidelberg (1999)
Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear approximation of shortest superstrings. J. ACM 41(4), 630–647 (1994)
Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423–434 (2009)
Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: a new technique for kernelization lower bounds. Proc. STACS 2011, 165–176 (2011)
Bodlaender, H.L., Thomassé, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35), 4570–4578 (2011)
Bonizzoni, P., Dondi, R., Mauri, G., Zoppis, I.: Restricted and swap common superstring: a parameterized view. Proc. IPEC 2012, 49–60 (2012)
Clifford, R., Gotthilf, Z., Lewenstein, M., Popa, A.: Restricted common superstring and restricted common supersequence. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 467–478. Springer, Heidelberg (2011)
Fellows, M.R.: Towards fully multivariate algorithmics: some new results and directions in parameter ecology. In: Kratochvíl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol. 5874, pp. 2–10. Springer, Heidelberg (2009)
Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77(1), 91–106 (2011)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
Gotthilf, Z., Lewenstein, M., Popa, A.: On shortest common superstring and swap permutations. In: Chávez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 270–278. Springer, Heidelberg (2010)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences—Computer Science and Computational Biology. Cambridge University Press, New York (1997)
Mucha, M.; Sankowski, P.: Maximum Matchings via Gaussian Elimination. In: Proceedings of 45st IEEE Symposium. Foundations of Computer Science, pp. 248–255 (2004)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. Proc. STACS 2010, 17–32 (2010)
Ott, S.: Lower bounds for approximating shortest superstrings over an alphabet of size 2. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 55–64. Springer, Heidelberg (1999)
Storer, J.: Data Compression: Methods and Theory. Computer Science Press, New York (1988)
Sweedyk, Z.: A 2\(\frac{1}{2}\)-approximation algorithm for shortest superstring. SIAM J. Comput. 29(3), 954–986 (1999)
Vassilevska, V.: Explicit inapproximability bounds for the shortest superstring problem. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 793–800. Springer, Heidelberg (2005)
Acknowledgments
We would like to thank the anonymous reviewers for their detailed and valuable comments, which helped us to improve the quality of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper appeared in [12].
Rights and permissions
About this article
Cite this article
Bonizzoni, P., Dondi, R., Mauri, G. et al. Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective. Algorithmica 72, 914–939 (2015). https://doi.org/10.1007/s00453-014-9882-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-014-9882-8