Skip to main content

String Editing Under Pattern Constraints

  • Conference paper
  • First Online:
New Trends in Computer Technologies and Applications (ICS 2022)

Abstract

We introduce the novel Nearest Pattern Constrained String (NPCS) problem of finding a minimum set \(\mathcal {Q}\) of character mutation, insertion, and deletion edit operations sufficient to modify a string x to contain all contiguous words in a pattern set \(\mathcal {P}\) and no contiguous words in a forbidden pattern set \(\mathcal {F}\). Letting \(\varSigma \) be the alphabet of allowed characters, and letting \(\eta \) and \(\varUpsilon \) be the longest string length and sum of all string lengths in \(\mathcal {P}\cup \mathcal {F}\), respectively, we show that NPCS is fixed-parameter tractable in \(|\mathcal {P}|\) with time complexity \(\mathcal {O}\left( 2^{|\mathcal {P}|} \cdot \varUpsilon \cdot |\varSigma | \cdot \left( |\mathcal {P}| + \eta \right) \left( |x|+1\right) \right) \).

This work was supported by JSPS Kakenhi grants {20K21827, 20H05967, 21H04871}, and JST CREST Grant JPMJCR1402JST.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333–340 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bernardini, G., et al.: String sanitization: a combinatorial approach. In: Proceedings of 2019 European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD), pp. 627–644 (2019)

    Google Scholar 

  3. Bernardini, G., et al.: Combinatorial algorithms for string sanitization. ACM Trans. Knowl. Discov. Data 15(1), 1–34 (2021)

    Article  Google Scholar 

  4. Bernardini, G., et al.: String sanitization under edit distance. In: Proceedings of 31st Annual Symposium on Combinatorial Pattern Matching (CPM), pp. 1–14 (2020)

    Google Scholar 

  5. Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear approximation of shortest superstrings. J. ACM 41(4), 630–647 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cox, I.J., Miller, M.L.: Review of watermarking and the importance of perceptual modeling. In: Proceedings of SPIE 3016. Conference on Human Vision and Electronic Imaging II, pp. 92–99 (1997)

    Google Scholar 

  7. Dial, R.B.: Algorithm 360: shortest-path forest with topological ordering. Commun. ACM 12(11), 632–633 (1969)

    Article  Google Scholar 

  8. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fisk, G., Fisk, M., Papadopoulos, C., Neil, J.: Eliminating steganography in internet traffic with active wardens. In: Proceedings of 5th International Workshop on Information Hiding (IH), pp. 18–35 (2002)

    Google Scholar 

  10. Gallant, J., Maier, D., Astorer, J.: On finding minimal length superstrings. J. Comput. Syst. Sci. 20(1), 50–58 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  11. Guo, J., Hermelin, D., Komusiewicz, C.: Local search for string problems: brute-force is essentially optimal. Theoret. Comput. Sci. 525, 30–41 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hamming, R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 29(2), 147–160 (1950)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hao, F., Anderson, R., Daugman, J.: Combining crypto with biometrics effectively. IEEE Trans. Comput. 55(9), 1081–1088 (2006)

    Article  Google Scholar 

  14. Karpinski, M., Schmied, R.: Improved inapproximability results for the shortest superstring and related problems. In: Proceedings of 19th Computing: The Australasian Theory Symposium (CATS), pp. 27–36 (2013)

    Google Scholar 

  15. McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM 23(2), 262–272 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  16. Peterson, J.L.: Computer programs for detecting and correcting spelling errors. Commun. ACM 23(12), 676–687 (1980)

    Article  Google Scholar 

  17. Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300–304 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  18. Rizzo, S.G., Bertini, F., Montesi, D.: Content-preserving text watermarking through unicode homoglyph substitution. In: Proceedings of 20th International Database Engineering and Applications Symposium, pp. 97–104 (2016)

    Google Scholar 

  19. Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379–423 (1948)

    Article  MathSciNet  MATH  Google Scholar 

  20. Smith, C.B., Agaian, S.S.: Denoising and the active warden. In: Proceedings of 2007 IEEE International Conference on Systems, Man and Cybernetics (SMC), pp. 3317–3322 (2007)

    Google Scholar 

  21. Tsai, Y.T.: The constrained longest common subsequence problem. Inf. Process. Lett. 88(4), 173–176 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  22. Wicker, S.B., Bhargava, V.K. (eds.): Reed-Solomon Codes and Their Applications, 1st edn. IEEE Press, Piscataway (1994)

    Google Scholar 

  23. Zielińska, E., Mazurczyk, W., Szczypiorski, K.: Trends in steganography. Commun. ACM 57(3), 86–95 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Robert D. Barish .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Barish, R.D., Shibuya, T. (2022). String Editing Under Pattern Constraints. In: Hsieh, SY., Hung, LJ., Klasing, R., Lee, CW., Peng, SL. (eds) New Trends in Computer Technologies and Applications. ICS 2022. Communications in Computer and Information Science, vol 1723. Springer, Singapore. https://doi.org/10.1007/978-981-19-9582-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-981-19-9582-8_2

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-19-9581-1

  • Online ISBN: 978-981-19-9582-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics