On two open problems of 2-interval patterns

DOI10.1016/j.tcs.2009.02.033zbMath1168.68016OpenAlexW2040979981MaRDI QIDQ1019722

Shuai Cheng Li, Ming Li

Publication date: 4 June 2009

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

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

zbMATH Keywords

NP-hardbioinformaticspattern matchingcontact map2-interval pattern

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

On recognising words that are squares for the shuffle product ⋮ Finding common structured patterns in linear graphs ⋮ Parameterized complexity of two-interval pattern problem

Cites Work

• Unnamed Item
• A computational model for RNA multiple structural alignment
• Improved algorithms for largest cardinality 2-interval pattern problem
• On the computational complexity of 2-interval pattern matching problems
• Combinatorial Pattern Matching

This page was built for publication: On two open problems of 2-interval patterns