Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth (2404.17969v1)

Published 27 Apr 2024 in math.CO and cs.FL

Abstract: The notion of inverse Lyndon word is related to the classical notion of Lyndon word. More precisely, inverse Lyndon words are all and only the nonempty prefixes of the powers of the anti-Lyndon words, where an anti-Lyndon word with respect to a lexicographical order is a classical Lyndon word with respect to the inverse lexicographic order. Each word $w$ admits a factorization in inverse Lyndon words, named the canonical inverse Lyndon factorization $\ICFL(w)$, which maintains the main properties of the Lyndon factorization of $w$. Although there is a huge literature on the Lyndon factorization, the relation between the Lyndon factorization $\CFL_{in}$ with respect to the inverse order and the canonical inverse Lyndon factorization $\ICFL$ has not been thoroughly investigated. In this paper, we address this question and we show how to obtain one factorization from the other via the notion of grouping. This result naturally opens new insights in the investigation of the relationship between $\ICFL$ and other notions, e.g., variants of Burrows Wheeler Transform, as already done for the Lyndon factorization.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (32)
  1. Inverse Lyndon words and inverse Lyndon factorizations of words. Adv. Appl. Math., 101:281–319, 2018.
  2. Free Differential calculus, IV. The Quotient Groups of the Lower Central Series. Ann. Math., 68:81–95, 1958.
  3. Jean-Pierre Duval. Factorizing Words over an Ordered Alphabet. J. Algorithms, 4(4):363–381, 1983.
  4. Fast parallel Lyndon factorization with applications. Mathematical Systems Theory, 28(2):89–108, 1995.
  5. Enumerative combinatorics on words. In Miklos Bona, editor, Handbook of Enumerative Combinatorics. CRC Press, 2015.
  6. Indexing the bijective BWT. In Nadia Pisanti and Solon P. Pissis, editors, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy, volume 128 of LIPIcs, pages 17:1–17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
  7. A Bijective String Sorting Transform. CoRR, abs/1201.3077, 2012.
  8. Manfred Kufleitner. On Bijective Variants of the Burrows-Wheeler Transform. In Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31 - September 2, 2009, pages 65–79, 2009.
  9. Counting Permutations with Given Cycle Structure and Descent Set. J. Comb. Theory, Ser. A, 64(2):189–215, 1993.
  10. A bijection between words and multisets of necklaces. Eur. J. Comb., 33(7):1537–1546, 2012.
  11. Suffix array and Lyndon factorization of a text. J. Discrete Algorithms, 28:2–8, 2014.
  12. Lyndon words accelerate suffix sorting. In Petra Mutzel, Rasmus Pagh, and Grzegorz Herman, editors, 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference), volume 204 of LIPIcs, pages 15:1–15:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
  13. Nyldon words. J. Comb. Theory, Ser. A, 167:60–90, 2019.
  14. On generalized Lyndon words. Theor. Comput. Sci., 777:232–242, 2019.
  15. ω𝜔\omegaitalic_ω-Lyndon words. Theor. Comput. Sci., 809:39–44, 2020.
  16. Generalized Lyndon factorizations of infinite words. Theor. Comput. Sci., 809:30–38, 2020.
  17. Swapnil Garg. New results on nyldon words and nyldon-like sets. Advances in Applied Mathematics, 131:102249, 2021.
  18. On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties. Theor. Comput. Sci., 862:24–41, 2021.
  19. Codes and Automata. Encyclopedia of Mathematics and its Applications 129, Cambridge University Press, 2009.
  20. Combinatorics of Words. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages, Vol. 1, pages 329–438. Springer-Verlag, Berlin, Heidelberg, 1997.
  21. M. Lothaire. Algebraic Combinatorics on Words, Encyclopedia Math. Appl., volume 90. Cambridge University Press, 1997.
  22. M. Lothaire. Applied Combinatorics on Words. Cambridge University Press, 2005.
  23. Christophe Reutenauer. Free Lie algebras. In Handbook of Algebra, London Mathematical Society Monographs. Oxford Science Publications, 1993.
  24. Algorithms on strings. Cambridge University Press, 2007.
  25. A new characterization of maximal repetitions by Lyndon trees. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 562–571, 2015.
  26. Donald E. Knuth. The Art of Computer Programming, Volume 4a: Combinatorial Algorithms. Addison Wesley Longman Publishing Co., Inc., 2012.
  27. Necklaces of beads in k𝑘kitalic_k colors and k𝑘kitalic_k-ary de Brujin sequences. Discrete Math., 23(3):207–210, 1978.
  28. Alternative Algorithms for Lyndon Factorization. In Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014, pages 169–178, 2014.
  29. Lyndon words versus inverse Lyndon words: Queries on suffixes and bordered words. In Alberto Leporati, Carlos Martín-Vide, Dana Shapira, and Claudio Zandron, editors, Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Milan, Italy, March 4-6, 2020, Proceedings, volume 12038 of Lecture Notes in Computer Science, pages 385–396. Springer, 2020.
  30. Numeration and enumeration. Eur. J. Comb., 33(7):1547–1556, 2012.
  31. Can formal languages help pangenomics to represent and analyze multiple genomes? In Volker Diekert and Mikhail V. Volkov, editors, Developments in Language Theory - 26th International Conference, DLT 2022, Tampa, FL, USA, May 9-13, 2022, Proceedings, volume 13257 of Lecture Notes in Computer Science, pages 3–12. Springer, 2022.
  32. Numeric lyndon-based feature embedding of sequencing reads for machine learning approaches. Inf. Sci., 607:458–476, 2022.
Citations (1)

Summary

We haven't generated a summary for this paper yet.