Efficient computation of sequence mappability
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 177800 (Why is no real title available?)
- scientific article; zbMATH DE number 1786458 (Why is no real title available?)
- scientific article; zbMATH DE number 7205098 (Why is no real title available?)
- scientific article; zbMATH DE number 7695991 (Why is no real title available?)
- Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
- Applying the positional Burrows-Wheeler transform to all-pairs Hamming distance
- Dictionary matching and indexing with errors and don't cares
- Efficient computation of sequence mappability
- Efficient randomized pattern-matching algorithms
- Efficient string matching with k mismatches
- Faster algorithms for 1-mappability of a sequence
- Linear work suffix array construction
- Linear-time algorithm for long LCF with \(k\) mismatches
- Longest common prefix with mismatches
- Longest common prefixes with \(k\)-errors and applications
- Longest common prefixes with \(k\)-mismatches and applications
- Longest common substring with approximately \(k\) mismatches
- Longest common substrings with \(k\) mismatches
- Lowest common ancestors in trees and directed acyclic graphs
- On the complexity of \(k\)-SAT
- On the sorting-complexity of suffix tree construction
- Parallel string matching with k mismatches
- Suffix Arrays: A New Method for On-Line String Searches
- Which problems have strongly exponential complexity?
Cited in
(2)
This page was built for publication: Efficient computation of sequence mappability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2134748)
