Pattern matching problems over 2-interval sets

DOI10.1007/3-540-45452-7_6MaRDI QIDQ4737689zbMATH OpenFDO

Authors Stéphane Vialette

Publication date 11 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2373/23730053.htm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Protein sequences, DNA sequences (92D20)

Recommendations

• On the computational complexity of 2-interval pattern matching problems
• On two open problems of 2-interval patterns
• Algorithms – ESA 2005
• Approximating the 2-interval pattern problem
• Extracting constrained 2-interval subsets in 2-interval sets

Cited in

(10)

• On two open problems of 2-interval patterns
• On the computational complexity of 2-interval pattern matching problems
• Parameterized complexity of two-interval pattern problem
• Extracting constrained 2-interval subsets in 2-interval sets
• Set intersection and sequence matching with mismatch counting
• Finding patterns in given intervals
• Finding Patterns in Given Intervals
• Algorithms – ESA 2005
• Pattern matching in doubling spaces
• A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem

Describes a project that uses

Uses Software

• Palingol

This page was built for publication: Pattern matching problems over 2-interval sets

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