Normal forms of quasiperiodic strings
From MaRDI portal
Publication:1583537
Recommendations
Cites work
- scientific article; zbMATH DE number 1003282 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 1507240 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- An on-line string superprimitivity test
- An optimal algorithm to compute all the covers of a string
- COVERING A CIRCULAR STRING WITH SUBSTRINGS OF FIXED LENGTH
- Efficient detection of quasiperiodicities in strings
- Fast Pattern Matching in Strings
- Optimal off-line detection of repetitions in a string
- Optimal superprimitivity testing for strings
- Testing string superprimitivity in parallel
- The smallest automaton recognizing the subwords of a text
Cited in
(6)- Two strings at Hamming distance 1 cannot be both quasiperiodic
- Minimal critical exponent of quasiperiodic words
- Speeding up the detection of evolutive tandem repeats
- scientific article; zbMATH DE number 1615296 (Why is no real title available?)
- scientific article; zbMATH DE number 1400047 (Why is no real title available?)
- scientific article; zbMATH DE number 7471699 (Why is no real title available?)
This page was built for publication: Normal forms of quasiperiodic strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583537)