Advertisement

International Workshop on Combinatorial Algorithms

IWOCA 2014: Combinatorial Algorithms pp 74-85 | Cite as

Computing Minimum Length Representations of Sets of Words of Uniform Length

  • Francine Blanchet-SadriEmail author
  • Andrew Lohr
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8986)

Abstract

Motivated by text compression, the problem of representing sets of words of uniform length by partial words, i.e., sequences that may have some wildcard characters or holes, was recently considered and shown to be in \(\mathcal {P}\). Polynomial-time algorithms that construct representations were described using graph theoretical approaches. As more holes are allowed, representations shrink, and if representation is given, the set can be reconstructed. We further study this problem by determining, for a binary alphabet, the largest possible value of the size of a set of partial words that is important in deciding the representability of a given set S of words of uniform length. This largest value, surprisingly, is \(\varSigma _{i=0}^{|S|-1} 2^{\chi (i)}\) where \(\chi (i)\) is the number of ones in the binary representation of i, a well-studied digital sum, and it is achieved when the cardinality of S is a power of two. We show that circular representability is in \(\mathcal {P}\) and that unlike non-circular representability, it is easy to decide. We also consider the problem of computing minimum length representation (circular) total words, those without holes, and reduce it to a cost/flow network problem.

Keywords

Graph Isomorphism Hole Character Representation Word Uniform Length Total Word 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, New Jersey (1993)zbMATHGoogle Scholar
  2. 2.
    Blanchet-Sadri, F., Munteanu, S.: Deciding representability of sets of words of equal length in polynomial time. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013. LNCS, vol. 8288, pp. 28–40. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  3. 3.
    Blanchet-Sadri, F., Simmons, S.: Deciding representability of sets of words of equal length. Theoret. Comput. Sci. 475, 34–46 (2013)zbMATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Flajolet, P., Grabner, P., Kirschenhofer, P., Prodinger, H., Tichy, F.: Mellin transforms and asymptotics: digital sums. Theoret. Comput. Sci. 123, 291–314 (1994)zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Fredericksen, H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24, 195–221 (1982)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Gallant, J., Maier, D., Storer, J.A.: On finding minimal length superstrings. J. Comput. Syst. Sci. 20, 50–58 (1980)zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by successive approximation. Math. Oper. Res. 15, 430–466 (1990)zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Harborth, H.: Number of odd binomial coefficients. Proc. Amer. Math. Soc. 62, 19–22 (1977)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    Katz, J., Lindell, Y.: Introduction to Modern Cryptography: Principles and Protocols. Cryptography and Network Security. Chapman & Hall/CRC, Boca Raton (2008) Google Scholar
  10. 10.
    van Lint, J.H., MacWilliams, F.J., Sloane, N.J.A.: On pseudo-random arrays. SIAM J. Appl. Math. 36, 62–72 (1979)zbMATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Tan, S., Shallit, J.: Sets represented as the length-n factors of a word. In: Karhumäki, J., Lepistö, A., Zamboni, L. (eds.) WORDS 2013. LNCS, vol. 8079, pp. 250–261. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  12. 12.
    Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 146–160 (1972)zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of North CarolinaGreensboroUSA
  2. 2.Department of MathematicsRutgers UniversityPiscatawayUSA

Personalised recommendations