Longest previous overlapping factor array (Q2656356)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Longest previous overlapping factor array	scientific article

Statements

scholarly article

0 references

Longest previous overlapping factor array (English)

0 references

0 references

Shunsuke Inenaga

0 references

0 references

Information Processing Letters

0 references

publication date

11 March 2021

0 references

zbMATH Keywords

algorithms

0 references

longest previous overlapping factor

0 references

overlapping factor

0 references

Manhattan skyline problem

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ipl.2021.106097

0 references

The “Runs” Theorem

0 references

Algorithms on Strings

0 references

Computing longest previous factor in linear time and applications

0 references

Computing the longest previous factor

0 references

Extracting powers and periods in a word from its runs structure

0 references

Efficient algorithms for three variants of the LPF table

0 references

Computing longest previous non-overlapping factors

0 references

Application of Lempel-Ziv factorization to the approximation of grammar-based compression.

0 references

A universal algorithm for sequential data compression

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.IPL.2021.106097

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2656356

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