Simple algorithm for pattern-matching with bounded gaps in genomic sequences

MaRDI QIDQ3371411zbMATH OpenFDO

Authors Yoan José Pinzón Ardila, Shu Wang

Publication date 21 February 2006

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, k_Δ, α)-MATCHING
• String matching with variable length gaps
• Motif matching using gapped patterns
• Efficient Bit-Parallel Algorithms for (δ,α)-Matching
• Finding Patterns with Variable Length Gaps or Don’t Cares

Cited in

(3)

• GAME: A simple and efficient whole genome alignment method using maximal exact match filtering
• Byte-aligned pattern matching in encoded genomic sequences
• Efficient computation of shortest absent words in a genomic sequence

This page was built for publication: Simple algorithm for pattern-matching with bounded gaps in genomic sequences

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