Density of \(k\)-ary words with 0, 1, 2-error overlaps

DOI10.1016/j.tcs.2024.114958MaRDI QIDQ6652469

Marcella Anselmo, Manuela Flores, Maria Madonia

Publication date: 12 December 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

densityHamming distanceLee distanceisometric wordsoverlap with errors

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• The structures of bad words
• Non-expandable non-overlapping sets of pictures
• Asymptotic number of isometric generalized Fibonacci cubes
• Generalized Fibonacci cubes
• Alignment-free sequence comparison using absent words
• Bad pictures: some structural properties related to overlaps
• On \(k\)-ary \(n\)-cubes and isometric words
• Quaternary \(n\)-cubes and isometric words
• Two strings at Hamming distance 1 cannot be both quasiperiodic
• Languages with mismatches
• Checking whether a word is Hamming-isometric in linear time
• Unbordered Pictures: Properties and Construction
• A fast string searching algorithm
• Fast Pattern Matching in Strings
• A note on bifix-free sequences (Corresp.)
• Minimal forbidden words and symbolic dynamics
• Some Investigations on Similarity Measures Based on Absent Words
• Quasi-Periodicity Under Mismatch Errors
• Sets of Pictures Avoiding Overlaps
• Isometric words based on swap and mismatch distance
• Ranking and unranking bordered and unbordered words
• Hypercubes and isometric words based on swap and mismatch distance
• Fun slot machines and transformations of words avoiding factors

This page was built for publication: Density of \(k\)-ary words with 0, 1, 2-error overlaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652469)