On universal partial words
- Published: 05 May 2017
- University of Strathclyde United Kingdom
- Xinxiang University China (People's Republic of)
- Xinjiang University China (People's Republic of)
- 1
- 2
Theoret. Comput. Sci., 218(1):135-141, 1999. WORDS (Rouen, 1997).
[BBSGR10] B. Blakeley, F. Blanchet-Sadri, J. Gunter, and N. Rampersad. On the complexity of deciding avoidability of sets of partial words. Theoret. Comput. Sci., 411(49):4263-4271, 2010.
[BJG08] J. Bang-Jensen and G. Z. Gutin. Digraphs: Theory, Algorithms and Applications. Springer, 2nd edition, 2008.
[BS05] F. Blanchet-Sadri. Primitive partial words. Discrete Applied Mathematics, 148(3):195-213, 2005. [OpenAIRE]
[BS08] F. Blanchet-Sadri. Open problems on partial words. In G. Bel-Enguix, M. D. Jiménez-López, and C. Martín-Vide, editors, New Developments in Formal Languages and Applications, pages 11-58. Springer Berlin Heidelberg, Berlin, Heidelberg, 2008. [OpenAIRE]
[BSBK+09] F. Blanchet-Sadri, N. C. Brownstein, A. Kalcic, J. Palumbo, and T. Weyand. Unavoidable sets of partial words. Theory Comput. Syst., 45(2):381-406, 2009.
[CDG92] F. Chung, P. Diaconis, and R. Graham. Universal cycles for combinatorial structures. Discrete Math., 110(1-3):43-59, 1992.
[CJJK11] A. Claesson, V. Jelínek, E. Jelínková, and S. Kitaev. Pattern avoidance in partial permutations. Electron. J. Combin., 18(1):Paper 25, 41, 2011.
[CPT11] P. E. C. Compeau, P. A. Pevzner, and G. Tesler. How to apply De Bruijn graphs to genome assembly. Nature biotechnology, 29(11):987-991, 2011.
[dB46] N. G. de Bruijn. A Combinatorial Problem. Koninklijke Nederlandse Akademie v. Wetenschappen, 49:758-764, 1946.
[Eul36] L. Euler. Solutio problematis ad geometriam situs pertinentis. Comment. Academiae Sci. I. Petropolitanae, 8:128-140, 1736.
[Fle83] M. Fleury. Deux problemes de geometrie de situation. Journal de mathematiques elementaires, pages 257-261, 1883.
[GGG+16] B. Goeckner, N. Graber, C. Groothuis, C. Hettle, B. Kell, R. Kirsch, P. Kirkpatrick, and R. Solava. Personal communication, 2016.
[HHK08] V. Halava, T. Harju, and T. Kärki. Square-free partial words. Inform. Process. Lett., 108(5):290-292, 2008. [OpenAIRE]
[HHKS09] V. Halava, T. Harju, T. Kärki, and P. Séébold. Overlap-freeness in infinite partial words. Theoret. Comput. Sci., 410(8-10):943-948, 2009. [OpenAIRE]
- 1
- 2