A new characterization of maximal repetitions by Lyndon trees
From MaRDI portal
Publication:5363085
DOI10.1137/1.9781611973730.38zbMATH Open1372.68216OpenAlexW2949643461MaRDI QIDQ5363085FDOQ5363085
Yuto Nakashima, Kazuya Tsuruta, Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Masayuki Takeda
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973730.38
Recommendations
Cited In (22)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
- Title not available (Why is that?)
- Optimal bounds for computing \({\alpha}\)-gapped repeats
- Lyndon words formalized in Isabelle/HOL
- Prefix-Suffix Square Completion
- Longest $$\alpha $$-Gapped Repeat and Palindrome
- Title not available (Why is that?)
- Lyndon array construction during Burrows-Wheeler inversion
- Counting maximal-exponent factors in words
- Two-dimensional maximal repetitions
- The “Runs” Theorem
- Dynamic and internal longest common substring
- Fast computation of abelian runs
- Small-space LCE data structure with constant-time queries
- Can formal languages help pangenomics to represent and analyze multiple genomes?
- Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches
- Computing primitively-rooted squares and runs in partial words
- Almost linear time computation of maximal repetitions in run length encoded strings
- Exact and inexact search for 2d side-sharing tandems
- On the density of Lyndon roots in factors
- 2D Lyndon words and applications
- Inverse Lyndon words and inverse Lyndon factorizations of words
This page was built for publication: A new characterization of maximal repetitions by Lyndon trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363085)
