Two strings at Hamming distance 1 cannot be both quasiperiodic (Q2404618): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2592599566 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1703.00195 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal superprimitivity testing for strings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partial words and a theorem of Fine and Wilf / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An on-line string superprimitivity test / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Seeds Computation Revisited / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms on Strings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Covering a string / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the maximal sum of exponents of runs in a string / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing the cover array in linear time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3659988 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3128913 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:45, 14 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Two strings at Hamming distance 1 cannot be both quasiperiodic |
scientific article |
Statements
Two strings at Hamming distance 1 cannot be both quasiperiodic (English)
0 references
19 September 2017
0 references
combinatorial problems
0 references
combinatorics on words
0 references
quasiperiodicity
0 references
cover
0 references
seed
0 references