On-line string matching in highly similar DNA sequences
From MaRDI portal
Publication:2363986
Recommendations
- Fast string matching for DNA sequences
- scientific article; zbMATH DE number 5204918
- scientific article; zbMATH DE number 1754502
- Combinatorial Pattern Matching
- On-line string matching algorithms: survey and experimental results
- Algorithms for indexing highly similar DNA sequences
- Fast Matching Method for DNA Sequences
- On-line approximate string matching with bounded errors
Cites work
- A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
- A simple fast hybrid pattern-matching algorithm
- Algorithms on Strings
- Efficient string matching
- Efficient variants of the backward-oracle-matching algorithm
- Fast Pattern Matching in Strings
- Fast relative Lempel-Ziv self-index for similar sequences
- Faster algorithms for string matching with k mismatches
- Improved long-period generators based on linear recurrences modulo 2
- Indexing similar DNA sequences
- Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval
- Suffix tree of alignment: an efficient index for similar data
- The exact online string matching problem: a review of the most recent results
Cited in
(3)
This page was built for publication: On-line string matching in highly similar DNA sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363986)