|
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
Reconstruction of a Word from a Finite Set of its Subwords Under the Unit Shift Hypothesis. II. Reconstruction with Forbidden Wordsстатья
Информация о цитировании статьи получена из
Web of Science,
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 26 августа 2016 г.
- Авторы: Smetanin Y.G., Ulyanov M.V.
- Журнал: Cybernetics and Systems Analysis
- Том: 51
- Номер: 1
- Год издания: 2015
- Издательство: Springer Nature
- Местоположение издательства: Switzerland
- Первая страница: 157
- Последняя страница: 164
- DOI: 10.1007/s10559-015-9708-y
- Аннотация: An extension of the problem of reconstruction of words from a given multiset of its subwords supposedly generated by unit shifts of a window of fixed length along such words. In the extension, feasible solutions must satisfy additional constraints. The case is considered when these constraints are specified by forbidden words. A solution to the problem is obtained as a result of searching for Euler paths or Euler cycles in a de Bruijn multidigraph with the additional operation of reduction of its edges and subsequent application of special algebraic operations of multiplication of adjacency matrices as in the first part of this article. © 2015, Springer Science+Business Media New York.
- Добавил в систему: Ульянов Михаил Васильевич