Guillaume Blin

2023

doi dblp
Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem.
Guillaume Blin|Alexandru Popa|Mathieu Raffinot|Raluca Uricaru
String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings

2012

doi dblp
The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated Sequences.
Guillaume Blin|Minghui Jiang|Stéphane Vialette
String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings

2006

doi dblp
How to Compare Arc-Annotated Sequences: The Alignment Hierarchy.
Guillaume Blin|Hélène Touzet
String Processing and Information Retrieval, 13th International Conference, SPIRE 2006, Glasgow, UK, October 11-13, 2006, Proceedings