Combinatorial Pattern Matching
From MaRDI portal
Publication:5315340
DOI10.1007/b98377zbMath1103.68059MaRDI QIDQ5315340
Guillaume Fertin, Stéphane Vialette, Guillaume Blin
Publication date: 7 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Approximating the 2-interval pattern problem ⋮ Extracting constrained 2-interval subsets in 2-interval sets ⋮ A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem ⋮ Improved algorithms for largest cardinality 2-interval pattern problem ⋮ On two open problems of 2-interval patterns ⋮ Parameterized complexity of two-interval pattern problem
This page was built for publication: Combinatorial Pattern Matching
