Reconstruction of a Word from a Finite Set of its Subwords Under the Unit Shift Hypothesis. II. Reconstruction with Forbidden Words

Smetanin, Yu. G.; Ulyanov, Mikhail

doi:10.1007/s10559-015-9708-y

Cited by 1 publication

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results can be used in conjunction with solving the reconstruction problem [26,27] to reduce the set of possible reconstructions during qualitative analysis in such problems of business informatics as analysis of time series and logs of business processes.…”

Section: Discussionmentioning

confidence: 99%

“…Moreover, of interest are both the case when the reconstructed word does not contain a predetermined forbidden subword and the case with the presence of forbidden subwords. One of the possible solutions to this problem, based on subwords of fixed length, in the shift by one symbol hypothesis, was proposed by the authors in [26,27]. However, the set of possible reconstructions can be large and the problem arises of a possible reduction in the number of feasible solutions for the "correct" reconstructed word.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

About the possibility of determining the prefix and suffix of a word by subwords of fixed length

Zhukova¹,

Smetanin²,

Ulyanov³

2020

Bus. Inform.

View full text Add to dashboard Cite

In applied problems of business informatics related to data analysis (in particular, in the analysis and forecasting of time series, in the study of log files of business processes, etc.), problems of qualitative analysis arise. Qualitative analysis methods often use symbolic coding as a way of presenting information about the processes under study. In a number of situations, due to the fragmentation of such descriptions, the problem arises of reconstructing a complete symbolic description of a process (word) from its successive fragments (subwords). From the multiset of all subwords of a sufficiently large length, the original word is uniquely restored. In the case of insufficiently long subwords, several different reconstructions of the original word are possible. The number of feasible reconstructions can be reduced by determining the suffix and prefix of the reconstructed word. A method is proposed for determining the prefix and suffix of a word consisting of k -1 symbols each on the basis of multiset of subwords of a fixed length equal to . We accept the hypothesis that this multiset is generated by a window of a fixed length of one symbol shift in an unknown word. The method for determining the

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%