New Error Tolerant Method for Search of Long Repeats in DNA Sequences

DOI10.1007/978-3-319-38827-4_14zbMath1346.92051arXiv1604.01317OpenAlexW2503998318MaRDI QIDQ2823018

Michael G. Sadovsky, Sergey Petrovich Tsarev

Publication date: 6 October 2016

Published in: Algorithms for Computational Biology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.01317

zbMATH Keywords

genomefast searchVernier pattern

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)

Uses Software

• RepeatExplorer
• PRAP
• Red

Cites Work

• Distributed and sequential algorithms for bioinformatics
• Information capacity of nucleotide sequences and its applications
• A faster algorithm computing string edit distances
• A linear space algorithm for computing maximal common subsequences
• The Complexity of Some Problems on Subsequences and Supersequences

This page was built for publication: New Error Tolerant Method for Search of Long Repeats in DNA Sequences