A reconstruction problem of words from scattered factors asks for the minimal information, like multisets of scattered factors of a given length or the number of occurrences of scattered factors from a given set, necessary to uniquely determine a word. We show that a word $w\in {\{a,b\}}^{\ast }$ can be reconstructed from the number of occurrences of at most $min(|w{|}_a,|w{|}_b)+1$ scattered factors of the form $a^{i}b$, where $|w{|}_a$ is the number of occurrences of the letter $a$ in $w$. Moreover, we generalise the result to alphabets of the form $\{1,\dots ,q\}$ by showing that at most ${\sum }_{i=1}^{q-1}|w{|}_i(q-i+1)$ scattered factors suffices to reconstruct $w$. Both results improve on the upper bounds known so far. Complexity time bounds on reconstruction algorithms are also considered here.

来自散乱因素的单词重建问题需要最少的信息，例如给定长度的散乱因素的多集或给定集合中散乱因素的出现次数，这是唯一确定单词所必需的。我们显示一个字$w\in {\{\mathrm{一种}，b\}}^{\ast }$ 可以从最多出现的次数中重建 $分（|w{|}_{\mathrm{一种}}，|w{|}_b）+\mathrm{1个}$ 形式的分散因素 ${\mathrm{一种}}^{\mathrm{一世}}b$， 在哪里 $|w{|}_{\mathrm{一种}}$ 是字母的出现次数 $\mathrm{一种}$ 在 $w$。此外，我们将结果概括为以下形式的字母：$\{\mathrm{1个}，\dots ，q\}$ 通过显示最多 ${\sum }_{\mathrm{一世}=\mathrm{1个}}^{q-\mathrm{1个}}|w{|}_{\mathrm{一世}}（q-\mathrm{一世}+\mathrm{1个}）$ 分散因素足以重建 $w$。到目前为止，这两个结果的上限都有所提高。此处还考虑了重建算法的复杂性时限。