Algorithms – ESA 2005

DOI10.1007/11561071zbMATH Open1123.68143OpenAlexW2501059503MaRDI QIDQ5475853FDOQ5475853

Stéphane Vialette, Maxime Crochemore, Gad M. Landau, Danny Hermelin

Publication date: 27 June 2006

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

Full work available at URL: https://doi.org/10.1007/11561071

Recommendations

• Approximating the 2-interval pattern problem
• Combinatorial Pattern Matching
• A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
• Parameterized complexity of two-interval pattern problem
• scientific article; zbMATH DE number 7759284
• On the computational complexity of 2-interval pattern matching problems
• On two open problems of 2-interval patterns
• scientific article; zbMATH DE number 2087043
• Approximation algorithms for maximum two-dimensional pattern matching
• Algorithms and Computation

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Approximation algorithms (68W25)

Cited In (10)

• Finding common structured patterns in linear graphs
• On the Approximability of Comparing Genomes with Duplicates
• Title not available (Why is that?)
• A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
• Improved algorithms for largest cardinality 2-interval pattern problem
• On the parameterized complexity of multiple-interval graph problems
• On Recovering Syntenic Blocks from Comparative Maps
• On the computational complexity of 2-interval pattern matching problems
• The maximum clique problem in multiple interval graphs
• A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model

This page was built for publication: Algorithms – ESA 2005

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