Lossless filter for multiple repetitions with Hamming distance
From MaRDI portal
(Redirected from Publication:1018103)
Recommendations
Cites work
- A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS
- scientific article; zbMATH DE number 1998337 (Why is no real title available?)
- scientific article; zbMATH DE number 2038766 (Why is no real title available?)
- scientific article; zbMATH DE number 1786458 (Why is no real title available?)
- Indexing text with approximate \(q\)-grams
- Linear-time construction of suffix arrays (extended abstract)
- Research in Computational Molecular Biology
- Space efficient linear time construction of suffix arrays
- Suffix Arrays: A New Method for On-Line String Searches
Cited in
(6)- Motif trie: an efficient text index for pattern discovery with don't cares
- Longest property-preserved common factor: a new string-processing framework
- Compressed spaced suffix arrays
- \textsc{Rime}: repeat identification
- Circular sequence comparison with q-grams
- Elastic-Degenerate String Matching via Fast Matrix Multiplication
This page was built for publication: Lossless filter for multiple repetitions with Hamming distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1018103)