Motif matching using gapped patterns

DOI10.1016/J.TCS.2014.06.032zbMath1314.68418DBLPjournals/tcs/GiaquintaFGTU14arXiv1306.2483OpenAlexW2046976590WikidataQ58054128 ScholiaQ58054128MaRDI QIDQ401471

Emanuele Giaquinta, Szymon Grabowski, Alexandru I. Tomescu, Kimmo Fredriksson, Esko Ukkonen

Publication date: 27 August 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.2483

zbMATH Keywords

combinatorial problemsstring algorithmsmultiple pattern matchingpattern matching with gapsword-level parallelism

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (1)

An efficient algorithm for attribute-based subsequence matching

Cites Work

• Unnamed Item
• Unnamed Item
• String matching with variable length gaps
• Fast profile matching algorithms - A survey
• New techniques for regular expression searching
• Constructing Efficient Dictionaries in Close to Sorting Time
• Finding Patterns with Variable Length Gaps or Don’t Cares
• Nested Counters in Bit-Parallel String Matching
• Efficient string matching
• Online Matching of Multiple Regular Patterns with Gaps and Character Classes
• Efficient Bit-Parallel Algorithms for (δ,α)-Matching

This page was built for publication: Motif matching using gapped patterns