scientific article; zbMATH DE number 1615296
From MaRDI portal
Publication:2723969
Recommendations
- Efficient detection of quasiperiodicities in strings
- Quasiperiodicity and string covering
- Publication:4503964
- scientific article; zbMATH DE number 3907795
- scientific article; zbMATH DE number 1092948
- Quasiperiodicities in Fibonacci strings.
- Normal forms of quasiperiodic strings
- Periodicity and roots of transfinite strings
- On maximal repeats in strings
- Generalized approximate regularities in strings
Cited in
(18)- Crochemore's partitioning on weighted strings and applications
- Computing regularities in strings: a survey
- Experimental evaluation of algorithms for computing quasiperiods
- Finding periods in Cartesian tree matching
- Finding Gale strings
- Efficient seeds computation revisited
- String Periods in the Order-Preserving Model
- Linear-time period computation of a string with suffix trees
- Efficient seed computation revisited
- scientific article; zbMATH DE number 638300 (Why is no real title available?)
- scientific article; zbMATH DE number 1092948 (Why is no real title available?)
- scientific article; zbMATH DE number 1507240 (Why is no real title available?)
- Fast algorithm for partial covers in words
- String Covering: A Survey
- Approximation and fixed parameter algorithms for the approximate cover problem
- Efficient detection of quasiperiodicities in strings
- Computing maximal-exponent factors in an overlap-free word
- Optimality of some algorithms to detect quasiperiodicities
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2723969)
