Сибирский федеральный университет

Тип публикации: статья из журнала (материалы конференций, опубликованные в журналах)

Конференция: International Conference on Algorithms for Computational Biology, AlCoB 2016;; Trujillo, Spain; Trujillo, Spain

Год издания: 2016

Идентификатор DOI: 10.1007/978-3-319-38827-4_14

Ключевые слова: Fast search, Genome, Vernier pattern, Bioinformatics, DNA, Gages, Genes, Biological applications, Error tolerant, Search procedures, Sparse dictionaries, Sub-strings, DNA sequences

Аннотация: A new method to identify all sufficiently long repeating nucleotide substrings in one or several DNA sequences is proposed. The method based on a specific gauge applied to DNA sequences that guarantees identification of the repeating substrings. The method allows the matching substrings to contain a given level of errors. The gauge is based on the development of a heavily sparse dictionary of repeats, thus drastically accelerating the search procedure. Some biological applications illustrate the method. © Springer International Publishing Switzerland 2016.

Журнал: (21 June 2016 through 22 June 2016

Выпуск журнала: Vol. 9702

Номера страниц: 171-182

• Tsarev S.P. (Siberian Federal University)
• Sadovsky M.G. (Institute of Computational Modelling of SB RAS)

• Scopus
• Ядро РИНЦ (eLIBRARY.RU)