Fast algorithm for Vernier search of long repeats in DNA sequences with bounded error density

DOI10.1007/978-3-319-91938-6_8zbMATH Open1392.92069OpenAlexW2804094410MaRDI QIDQ1660122FDOQ1660122

Authors: Maria Y. Senashova, M. G. Sadovsky, S. P. Tsarev 

Publication date: 15 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-91938-6_8

Recommendations

• New Error Tolerant Method for Search of Long Repeats in DNA Sequences
• \textsc{Rime}: repeat identification
• Locating regions in a sequence under density constraints
• Fast string matching for DNA sequences
• Fast, practical algorithms for computing all the repeats in a string

zbMATH Keywords

deletiongaugeinsertionmutationedit distancemultiple sequence alignmentrepeat

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Cited In (6)

• Fine-tuning the search for microsatellites
• String Processing and Information Retrieval
• New Error Tolerant Method for Search of Long Repeats in DNA Sequences
• Key-string segmentation algorithm and higher-order repeat 16mer (54 copies) in human alpha satellite DNA in chromosome 7
• \textsc{Rime}: repeat identification
• Identification of repeats in DNA sequences using nucleotide distribution uniformity

This page was built for publication: Fast algorithm for Vernier search of long repeats in DNA sequences with bounded error density

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1660122)