Large-scale detection of repetitions (Q2955637)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Large-scale detection of repetitions	scientific article

Statements

scholarly article

0 references

Large-scale detection of repetitions (English)

0 references

0 references

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences

0 references

publication date

13 January 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1098/rsta.2013.0138

0 references

The three squares lemma revisited

0 references

A characterization of the squares in a Fibonacci string

0 references

Detecting leftmost maximal periodicities

0 references

On-line construction of suffix trees

0 references

Suffix Arrays: A New Method for On-Line String Searches

0 references

Replacing suffix trees with enhanced suffix arrays

0 references

On the Complexity of Finite Sequences

0 references

A universal algorithm for sequential data compression

0 references

Optimal off-line detection of repetitions in a string

0 references

An O(n log n) algorithm for finding all repetitions in a string

0 references

Squares, cubes, and time-space efficient string searching

0 references

A New Periodicity Lemma

0 references

Intersecting periodic words

0 references

More results on overlapping squares

0 references

Identifiers

zbMATH Open document ID

0 references

10.1098/rsta.2013.0138

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2955637

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2955637&oldid=36300651"