Fast string matching for DNA sequences

DOI10.1016/j.tcs.2019.09.031zbMath1435.68403OpenAlexW2975984245MaRDI QIDQ2297856

Thierry Lecroq, Cheol Ryu, Kun Soo Park

Publication date: 20 February 2020

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.09.031

zbMATH Keywords

string matchingpattern scan orderscan speed

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items (2)

The Range Automaton: an efficient approach to text-searching ⋮ A weak approach to suffix automata simulation for exact and approximate string matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Designing optimal- and fast-on-average pattern matching algorithms
• Fast exact string matching algorithms
• Nucleotide frequencies in human genome and Fibonacci numbers
• Correctness and efficiency of pattern matching algorithms
• Average running time of the Boyer-Moore-Horspool algorithm
• Speeding up two string-matching algorithms
• Improved pattern-scan-order algorithms for string matching
• A taxonomy of sublinear multiple keyword pattern matching algorithms
• The exact online string matching problem
• A fast string searching algorithm
• Exact Analysis of Horspool’s and Sunday’s Pattern Matching Algorithms with Probabilistic Arithmetic Automata
• EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM
• On the Exact Complexity of String Matching: Upper Bounds
• Fast Pattern Matching in Strings
• Tighter Upper Bounds on the Exact Complexity of String Matching
• Irredundant intervals
• String Processing and Information Retrieval

This page was built for publication: Fast string matching for DNA sequences