3 research outputs found
2-ΡΠΆΠΈΠΌΠ°ΡΡΠΈΠ΅ ΡΠ»ΠΎΠ²Π° ΠΈ ΠΏΡΠΎΠ±Π»Π΅ΠΌΠ° ΡΠ΅ΠΊΠΎΠ½ΡΡΡΡΠΊΡΠΈΠΈ ΠΏΠΎΡΠ»Π΅Π΄ΠΎΠ²Π°ΡΠ΅Π»ΡΠ½ΠΎΡΡΠΈ
ΠΠ»Ρ Π΄Π°Π½Π½ΠΎΠ³ΠΎ ΡΠ»ΠΎΠ²Π° ΡΠ²ΠΎΠΉΡΡΠ²ΠΎ Π±ΡΡΡ 2-ΡΠΆΠΈΠΌΠ°Π΅ΠΌΡΠΌ (2-ΡΠΈΠ½Ρ
ΡΠΎΠ½ΠΈΠ·ΠΈΡΡΡΡΠΈΠΌ) ΡΡΡΠ΅ΡΡΠ²Π΅Π½Π½ΠΎ Π·Π°Π²ΠΈΡΠΈΡ ΠΎΡ ΡΠ²ΠΎΠΉΡΡΠ² Π½Π΅ΠΊΠΎΡΠΎΡΠΎΠ³ΠΎ ΡΠΏΠ΅ΡΠΈΠ°Π»ΡΠ½ΠΎΠ³ΠΎ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π° S Π΅Π³ΠΎ ΡΠ°ΠΊΡΠΎΡΠΎΠ². ΠΡ ΠΈΠ·ΡΡΠ°Π΅ΠΌ Π²ΠΎΠ·ΠΌΠΎΠΆΠ½ΠΎΡΡΡ ΡΠ΅ΠΊΠΎΠ½ΡΡΡΡΠΊΡΠΈΠΈ 2-ΡΠΆΠΈΠΌΠ°ΡΡΠ΅Π³ΠΎ (2-ΡΠΈΠ½Ρ
ΡΠΎΠ½ΠΈΠ·ΠΈΡΡΡΡΠ΅Π³ΠΎ) ΡΠ»ΠΎΠ²Π° ΠΏΠΎ ΡΡΠΎΠΌΡ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Ρ. ΠΠ΅ΡΠ΅Ρ
ΠΎΠ΄Ρ ΠΎΡ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Π° S ΠΊΠΎ ΠΌΠ½ΠΎΠΆΠ΅ΡΡΠ²Ρ Xs Π΅Π³ΠΎ ΡΠ°ΠΊΡΠΎΡΠΎΠ² Π΄Π»ΠΈΠ½Ρ ΡΡΠΈ, ΠΌΡ ΠΏΠΎΠΊΠ°Π·ΡΠ²Π°Π΅ΠΌ, ΡΡΠΎ 2-ΡΠΆΠΈΠΌΠ°ΡΡΠ΅Π΅ (2-ΡΠΈΠ½Ρ
ΡΠΎΠ½ΠΈΠ·ΠΈΡΡΡΡΠ΅Π΅) ΡΠ»ΠΎΠ²ΠΎ ΡΠ²Π»ΡΠ΅ΡΡΡ Π½Π°ΠΊΡΡΠ²Π°ΡΡΠΈΠΌ Π΄Π»Ρ Xs
Forbidden Factors and Fragment Assembly
In this paper methods and results related to the notion of minimal
forbidden words are applied to the fragment assembly problem. The
fragment assembly problem can be formulated, in its simplest form,
as follows: reconstruct a word w from a given set I of
substrings (fragments) of a word w. We introduce an
hypothesis involving the set of fragments I and the maximal
length m(w) of the minimal forbidden factors of w. Such
hypothesis allows us to reconstruct uniquely the word w from the
set I in linear time. We prove also that, if w is a word
randomly generated by a memoryless source with identical symbol
probabilities, m(w) is logarithmic with respect to the size of
w. This result shows that our reconstruction algorithm is suited
to approach the above problem in several practical applications
e.g. in the case of DNA sequences