Subset Seed Automaton
From MaRDI portal
Publication:3503905
DOI10.1007/978-3-540-76336-9_18zbMath1139.68369arXiv1408.6198OpenAlexW3104371266MaRDI QIDQ3503905
Mikhail Roytberg, Gregory Kucherov, Laurent Noé
Publication date: 10 June 2008
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.6198
Related Items
Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds ⋮ Faster exact distributions of pattern statistics through sequential elimination of states ⋮ Designing Efficient Spaced Seeds for SOLiD Read Mapping ⋮ Moments of the count of a regular expression in a heterogeneous random sequence ⋮ Masking patterns in sequences: A new class of motif discovery with don't cares
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to pattern matching in degenerate DNA/RNA sequences and distributed pattern matching
- Fast pattern-matching on indeterminate strings
- Vector seeds: An extension to spaced seeds
- On spaced seeds for similarity search
- Efficient string matching
- Computing and Combinatorics