Computing Longest (Common) Lyndon Subsequences

Hideo Bannai, I Tomohiro, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi

Type: Book-Chapter

Publication Date: 2022-01-01

Citations: 2

DOI: https://doi.org/10.1007/978-3-031-06678-8_10

View Publication

Download PDF

Locations

Lecture notes in computer science - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Computing a Longest Common Palindromic Subsequence	2012	Shihabur Rahman Chowdhury Md. Mahbubul Hasan Sumaiya Iqbal M. Sohel Rahman
+	Computing Longest (Common) Lyndon Subsequences	2022	Hideo Bannai I Tomohiro Tomasz Kociumaka Dominik Köppl Simon J. Puglisi
+ PDF Chat	Efficient Algorithms for Enumerating Maximal Common Subsequences of Two Strings	2024	Miyuji Hirota Yoshifumi Sakai
+ PDF Chat	Efficient algorithms for the longest common subsequence in k-length substrings	2014	Sebastian Deorowicz Szymon Grabowski
+	A note on the longest matching consecutive subsequence	2019	Jinjun Li Min Wu
+ PDF Chat	Longest Common Subsequence in k Length Substrings	2013	Gary Benson Avivit Levy B. Riva Shalom
+	Counting Lyndon Subsequences	2021	Ryo Hirakawa Yuto Nakashima Shunsuke Inenaga Masayuki Takeda
+ PDF Chat	On the longest common subsequence of Thue-Morse words	2020	Joakim Blikstad
+ PDF Chat	Space-Efficient Algorithms for Longest Increasing Subsequence	2019	Masashi Kiyomi Hirotaka Ono Yota Otachi Pascal Schweitzer Jun Tarui
+ PDF Chat	Variants of constrained longest common subsequence	2010	Paola Bonizzoni Gianluca Della Vedova Riccardo Dondi Yuri Pirola
+ PDF Chat	Longest common subsequence in sublinear space	2020	Masashi Kiyomi Takashi Horiyama Yota Otachi
+ PDF Chat	Arithmetic means of subsequences	1950	Tamotsu Tsuchikura
+ PDF Chat	Why is it hard to beat O(n2) for Longest Common Weakly Increasing Subsequence?	2017	Adam Polak
+ PDF Chat	Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings	2017	Yohei Ueki Diptarama Diptarama Masatoshi Kurihara Yoshiaki Matsuoka Kazuyuki Narisawa Ryo Yoshinaka Hideo Bannai Shunsuke Inenaga Ayumi Shinohara
+	Subsequences of normal sequences	1973	Teturo Kamae
+	LIL for the Length of the Longest Increasing Subsequences	2020	Zhonggen Su
+	Combinatorial Algorithms for Subsequence Matching: A Survey	2022	Maria Kosche Tore Koß Florín Manea Stefan Siemer
+ PDF Chat	Combinatorial Algorithms for Subsequence Matching: A Survey	2022	Maria Kosche Tore Koß Florín Manea Stefan Siemer
+ PDF Chat	Computing a Longest Common Palindromic Subsequence	2014	Shihabur Rahman Chowdhury Md. Mahbubul Hasan Sumaiya Iqbal M. Sohel Rahman
+	Matching subsequences in trees	2009	Philip Bille Inge Li Gørtz

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (10)

Action	Title	Year	Authors
+ PDF Chat	Computing a Longest Common Palindromic Subsequence	2014	Shihabur Rahman Chowdhury Md. Mahbubul Hasan Sumaiya Iqbal M. Sohel Rahman
+	Faster algorithms for computing longest common increasing subsequences	2011	Martin Kütz Gerth Stølting Brodal Kanela Kaligosi Irit Katriel
+ PDF Chat	Permutations, matrices, and generalized Young tableaux	1970	Donald Knuth
+	Free Differential Calculus, IV. The Quotient Groups of the Lower Central Series	1958	K. T. Chen Ralph H. Fox Roger C. Lyndon
+	On the Representations of the Symmetric Group	1938	G. de B. Robinson
+ PDF Chat	A hardness result and new algorithm for the longest common palindromic subsequence problem	2017	Shunsuke Inenaga Heikki Hyyrö
+	Counting Lyndon Factors	2017	Amy Glen Jamie Simpson W. F. Smyth
+ PDF Chat	Longest common subsequence in sublinear space	2020	Masashi Kiyomi Takashi Horiyama Yota Otachi
+ PDF Chat	Absent Subsequences in Words	2021	Maria Kosche Tore Koß Florín Manea Stefan Siemer
+ PDF Chat	Longest Increasing and Decreasing Subsequences	1961	C. Schensted