Тип публикации: статья из журнала

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

Идентификатор DOI: 10.1007/978-3-319-91938-6_8

Ключевые слова: deletion, Edit distance, gauge, insertion, Multiple sequence alignment, mutation, repeat

Аннотация: A novel algorithm to find all sufficiently long repeating nucleotide substrings in one or several DNA sequences is proposed. The algorithm searches approximately matching strings very fast with given level of local error density. Some biological applications illustrate the method.

Журнал: Lecture Notes in Computer Science (см. в книгах)

Выпуск журнала: Т.10849 LNBI

Номера страниц: 88-99

ISSN журнала: 03029743

Издатель: Springer-Verlag GmbH

• Tsarev Sergey P. (Siberian Fed Univ, Svobodny Prosp 79, Krasnoyarsk 660049, Russia)
• Senashova Maria Y. (RAS, Inst Computat Modelling SB, Krasnoyarsk 660036, Russia)
• Sadovsky Michael G. (Siberian Fed Univ, Svobodny Prosp 79, Krasnoyarsk 660049, Russia; RAS, Inst Computat Modelling SB, Krasnoyarsk 660036, Russia)

• Web of Science Core Collection
• Ядро РИНЦ (eLIBRARY.RU)