On multiset of factors of a word

Authors:
Kalpesh Kapoor;Himadri Nayak
Affiliations:
Department of Mathematics, Indian Institute of Technology Guwahati, India;Department of Mathematics, Indian Institute of Technology Guwahati, India
Venue:
Information Processing Letters
Year:
2013

Citing 2
Cited 0

Approximate string-matching with q-grams and maximal matches

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Reconstruction of a word from a multiset of its factors

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

Given two strings, we investigate the conditions under which they have common multiset of factors of a fixed length. We show that if two strings have the same multiset of factors of length less than or equal to k then they have a common prefix and suffix of length k-1. We also show that if two strings have the same multiset of factors of length k and k-1 then they also have the same multiset of factors of length less than k-1.