Algorithms – ESA 2005
From MaRDI portal
Publication:5475853
DOI10.1007/11561071zbMath1123.68143MaRDI QIDQ5475853
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
Related Items
On the Approximability of Comparing Genomes with Duplicates, On Recovering Syntenic Blocks from Comparative Maps, Finding common structured patterns in linear graphs, 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, The maximum clique problem in multiple interval graphs