37912

Автор(ы): 

Автор(ов): 

2

Параметры публикации

Тип публикации: 

Статья в журнале/сборнике

Название: 

Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without for bidden words

DOI: 

10.1007/s10559-014-9602-z

Наименование источника: 

  • Cybernetics and Systems Analysis

Обозначение и номер тома: 

Volume 50, Issue 1

Город: 

  • New York

Издательство: 

  • Springer Science+Business Media

Год издания: 

2014

Страницы: 

148-156
Аннотация
The problem of reconstruction of a word from a set of its subwords is considered. It is assumed that the set is generated by unit shifts of a fixed window along an unknown word. For the problem without constrains on the unknown word, a method of reconstruction is proposed based on the search for Euler paths or Euler cycles in a de Bruijn multidigraph. The search is based on symbolic multiplication of adjacency matrices with special operations of multiplication and addition of edge names. The method makes it possible to find reconstructed words and the number of reconstructions. © 2014 Springer Science+Business Media New York.

Библиографическая ссылка: 

Сметанин Ю.Г., Ульянов М.В. Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without for bidden words // Cybernetics and Systems Analysis. 2014. Volume 50, Issue 1. С. 148-156.

Публикация имеет версию на другом языке: 

Да

Связь с публикацией: