Combinatorial Pattern Matching
From MaRDI portal
Publication:5713543
DOI10.1007/b137128zbMath1131.68495OpenAlexW4301315466MaRDI QIDQ5713543
Publication date: 14 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b137128
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
On the longest common rigid subsequence problem ⋮ Algorithms for computing variants of the longest common subsequence problem ⋮ A new efficient algorithm for computing the longest common subsequence
This page was built for publication: Combinatorial Pattern Matching
