Byte-aligned pattern matching in encoded genomic sequences

DOI10.4230/LIPICS.WABI.2017.20zbMATH Open1443.92145MaRDI QIDQ5111826FDOQ5111826

Jan Holub, P. P. Procházka

Publication date: 27 May 2020

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)

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)

Cites Work

• A fast string searching algorithm
• Fast Pattern Matching in Strings
• Title not available (Why is that?)
• An algorithm for approximate membership checking with application to password security
• Title not available (Why is that?)
• Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Title not available (Why is that?)
• Fast and flexible packed string matching
• Tuning BNDM withq-Grams
• Title not available (Why is that?)
• A Fast Suffix Automata Based Algorithm for Exact Online String Matching

Cited In (2)

• BAPM
• Sequence matching with binary codes

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)