Guillaume Blin
11
Documents
Publications
- 11
- 9
- 4
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 2
- 2
- 1
- 1
- 2
- 3
|
Complexity Insights of the Minimum Duplication ProblemTheoretical Computer Science, 2014, 530, pp.66-79
Article dans une revue
hal-00948488v1
|
|
Minimum Mosaic Inference of a Set of RecombinantsInternational Journal of Foundations of Computer Science, 2013, 24 (1), pp.51-66. ⟨10.1142/S0129054113400042⟩
Article dans une revue
hal-00679269v1
|
|
A faster algorithm for finding minimum Tucker submatricesTheory of Computing Systems, 2012, 51 (3), pp.270-281. ⟨10.1007/s00224-012-9388-1⟩
Article dans une revue
hal-00657340v1
|
|
Comparing Genomes with Duplications: a Computational Complexity Point of ViewACM Transactions on Computational Logic, 2007, 4 (4), pp.523-534. ⟨10.1109/TCBB.2007.1069⟩
Article dans une revue
hal-00417720v1
|
|
What makes the Arc-Preserving Subsequence problem hard ?LNCS Transactions on Computational Systems Biology, 2005, 2, pp.1-36
Article dans une revue
hal-00417738v1
|
|
Towards unlocking the full potential of Multileaf Collimators40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Jan 2014, High Tatras, Slovakia. pp.138-149
Communication dans un congrès
hal-00859708v1
|
|
Complexity Insights of the Minimum Duplication Problem38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), Jan 2012, Špindleruv Mlýn, Czech Republic. pp.153-164
Communication dans un congrès
hal-00629047v1
|
|
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row6th International Computer Science Symposium in Russia (CSR'11), 2011, St Petersbourg, Russia. pp.373-384, ⟨10.1007/978-3-642-20712-9_29⟩
Communication dans un congrès
hal-00620378v1
|
|
Minimum Mosaic Inference of a Set of Recombinants17th Computing: the Australasian Theory Symposium (CATS'11), Jan 2011, Perth, Australia. pp.23-30
Communication dans un congrès
hal-00620371v1
|
|
A faster algorithm for finding minimum Tucker submatrices6th Computability in Europe (CiE'10), 2010, Portugal. pp.69-77
Communication dans un congrès
hal-00620380v1
|
|
What Makes the Arc-Preserving Subsequence Problem Hard?5th Int. Workshop on Bioinformatics Research and Applications (IWBRA'05), May 2005, Atlanta, GA, USA, United States. pp.860-868
Communication dans un congrès
hal-00620359v1
|