Extracting powers and periods in a word from its runs structure
From MaRDI portal
Publication:389938
DOI10.1016/J.TCS.2013.11.018zbMATH Open1295.68174OpenAlexW2051593658WikidataQ61677846 ScholiaQ61677846MaRDI QIDQ389938FDOQ389938
Authors: Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Maxime Crochemore, Marcin Kubica, Tomasz Waleń 
Publication date: 22 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.11.018
Recommendations
Cites Work
- Jewels of Stringology
- Linear-time computation of local periods
- Title not available (Why is that?)
- Orthogonal range searching on the RAM, revisited
- Repetitions in strings: algorithms and combinatorics
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Fast Algorithms for Finding Nearest Common Ancestors
- Algorithms on Strings
- How many squares can a string contain?
- A note on the number of squares in a word
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- Title not available (Why is that?)
- Space efficient linear time construction of suffix arrays
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- Detecting leftmost maximal periodicities
- Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
- Fast and Practical Algorithms for Computing All the Runs in a String
- Position-Restricted Substring Searching
- Title not available (Why is that?)
- On the maximal number of cubic subwords in a string
- Title not available (Why is that?)
- Title not available (Why is that?)
- New simple efficient algorithms computing powers and runs in strings
- The ``runs conjecture
Cited In (34)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor
- Efficiently computing runs on a trie
- Title not available (Why is that?)
- New simple efficient algorithms computing powers and runs in strings
- Constructing words with high distinct square densities
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings
- Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes
- Searching of gapped repeats and subrepetitions in a word
- Some results on the number of periodic factors in words
- On the number of gapped repeats with arbitrary gap
- Computing minimal and maximal suffixes of a substring
- Multidimensional period recovery
- Two-dimensional maximal repetitions
- Prefix frequency of lost positions
- Closed factorization
- Maximum number of distinct and nonequivalent nonstandard squares in a word
- Lower bounds for the number of repetitions in 2D strings
- The square density of words having a sequence of FS-double squares
- Internal dictionary matching
- Internal pattern matching queries in a text and applications
- Longest previous overlapping factor array
- A minimal periods algorithm with applications
- Shortest covers of all cyclic shifts of a string
- Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
- Efficient enumeration of non-equivalent squares in partial words with few holes
- Fast algorithm for partial covers in words
- Exact and inexact search for 2d side-sharing tandems
- Online computation of abelian runs
- The ``runs theorem
- Repetition Detection in a Dynamic String
- Period recovery of strings over the Hamming and edit distances
- Detecting one-variable patterns
- Computing runs on a trie
This page was built for publication: Extracting powers and periods in a word from its runs structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389938)
