Combinatorial Pattern Matching

DOI10.1007/B98377MaRDI QIDQ5315340zbMATH OpenFDO

Authors Guillaume Blin, Guillaume Fertin, Stéphane Vialette

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05)

Recommendations

• Extracting constrained 2-interval subsets in 2-interval sets
• On two open problems of 2-interval patterns
• Algorithms and Computation
• Improved algorithms for largest cardinality 2-interval pattern problem
• A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem

Cited in

(8)

• 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
• Parameterized complexity of two-interval pattern problem
• Parameterized complexity of two-interval pattern problem
• On two open problems of 2-interval patterns
• Algorithms – ESA 2005
• Approximating the 2-interval pattern problem

This page was built for publication: Combinatorial Pattern Matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315340)