Byte-aligned pattern matching in encoded genomic sequences

DOI10.4230/LIPICS.WABI.2017.20MaRDI QIDQ5111826zbMATH OpenFDO

Authors Jan Holub, P. P. Procházka

Publication date 27 May 2020

zbMATH Keywords

pattern matchinggenomic sequences\(q\)-gram inverted index

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Software, source code, etc. for problems pertaining to biology (92-04)

Recommendations

• A faster quick search algorithm
• Designing optimal- and fast-on-average pattern matching algorithms
• A comparison of BWT approaches to string pattern matching
• Simple algorithm for pattern-matching with bounded gaps in genomic sequences
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)

Cites work

• scientific article; zbMATH DE number 2185629 (Why is no real title available?)
• scientific article; zbMATH DE number 432779 (Why is no real title available?)
• scientific article; zbMATH DE number 140453 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• A fast string searching algorithm
• A fast suffix automata based algorithm for exact online string matching
• An algorithm for approximate membership checking with application to password security
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Fast Pattern Matching in Strings
• Fast and flexible packed string matching
• Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
• Tuning BNDM with \(q\)-grams

Cited in

(2)

• BAPM
• Sequence matching with binary codes

Describes a project that uses

Uses Software

• GLIMPSE

This page was built for publication: Byte-aligned pattern matching in encoded genomic sequences

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