Finding the Position of the k-Mismatch and Approximate Tandem Repeats

DOI10.1007/11785293_11MaRDI QIDQ5757897zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Ely Porat, Nira Shafrir

Publication date 7 September 2007

Published in Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11785293_11

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Recommendations

• Speeding up the detection of tandem repeats over the edit distance
• Detection and visualization of tandem repeats in dna sequences
• scientific article; zbMATH DE number 2087058
• Speeding up the detection of evolutive tandem repeats

Cited in

(6)

• k-approximate quasiperiodicity under Hamming and edit distance
• Speeding up the detection of tandem repeats over the edit distance
• scientific article; zbMATH DE number 1875416 (Why is no real title available?)
• scientific article; zbMATH DE number 7765421 (Why is no real title available?)
• Faster approximate elastic-degenerate string matching. Part A
• Fast computation of k-runs, parameterized squares, and other generalised squares

This page was built for publication: Finding the Position of the k-Mismatch and Approximate Tandem Repeats

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