Nombre de documents

62

Guillaume Blin


Article dans une revue18 documents

  • Mohammed El-Kebir, Hayssam Soueidan, Thomas Hume, Daniela Beisser, Marcus Dittrich, et al.. xHeinz: an algorithm for mining cross-species network modules under a flexible conservation model. Bioinformatics, Oxford University Press (OUP), 2015, 31 (19), <10.1093/bioinformatics/btv316>. <hal-01248545>
  • Paul Morel, Ryan Thomas Flynn, Edgar Gelover, Guillaume Blin, Stéphane Vialette, et al.. MSPT: An open-source motion simulator for proton therapy. Biomedical Physics & Engineering Express, 2015, 1 (3), 12 pp. <http://stacks.iop.org/2057-1976/1/037001>. <hal-01171799>
  • Bryan Brancotte, Bo Yang, Guillaume Blin, Sarah Cohen-Boulakia, Alain Denise, et al.. Rank aggregation with ties: Experiments and Analysis. Proceedings of the VLDB Endowment (PVLDB), VLDB Endowment, 2015, pp.2051. <hal-01165336>
  • Paul Morel, Xiadong Wu, Guillaume Blin, Stéphane Vialette, Ryan Flynn, et al.. Spot Weight Adaptation for Moving Target in Spot Scanning Proton Therapy. Frontiers in Oncology, Frontiers, 2015, 5 (119), pp.1-7. <10.3389/fonc.2015.00119>. <hal-01151923>
  • Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora. Complexity Insights of the Minimum Duplication Problem. Journal of Theoretical Computer Science (TCS), Elsevier, 2014, 530, pp.66-79. <hal-00948488>
  • Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette. Minimum Mosaic Inference of a Set of Recombinants. International Journal of Foundations of Computer Science, World Scientific Publishing, 2013, 24 (1), pp.51-66. <10.1142/S0129054113400042>. <hal-00679269>
  • David C. Faye, Olivier Curé, Guillaume Blin. A survey of RDF storage approaches. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2012, 15, pp.11-35. <hal-01299496>
  • Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora. On the Parameterized Complexity of the Repetition Free Longest Common Subsequence Problem. Information Processing Letters, Elsevier, 2012, 112 (7), pp.272-276. <10.1016/j.ipl.2011.12.009>. <hal-00637255v2>
  • Guillaume Blin, Romeo Rizzi, Stéphane Vialette. A faster algorithm for finding minimum Tucker submatrices. Theory of Computing Systems, Springer Verlag, 2012, 51 (3), pp.270-281. <10.1007/s00224-012-9388-1>. <hal-00657340>
  • Guillaume Blin, Maxime Crochemore, Sylvie Hamel, Stéphane Vialette. Median of an odd number of permutations. Pure Mathematics and Applications, 2011, 21 (2), pp.161 - 175. <hal-00619773>
  • Guillaume Blin, Alain Denise, Serge Dulucq, Claire Herrbach, Helene Touzet. Alignments of RNA structures.. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2010, 7 (2), pp.309-322. <10.1109/TCBB.2008.28>. <hal-00506348>
  • Guillaume Blin, Florian Sikora, Stéphane Vialette. Querying Graphs in Protein-Protein Interactions Networks using Feedback Vertex Set. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2010, 7 (4), pp.628-635. <hal-00619763>
  • Guillaume Blin, David Célestin Faye, Jens Stoye. Finding Nested Common Intervals Efficiently. Journal of Computational Biology, Mary Ann Liebert, 2010, 17 (9), pp.1183-1194. <hal-00619751>
  • Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. Fixed-Parameter Algorithms For Protein Similarity Search Under mRNA Structure Constraints. Journal of Discrete Algorithms, Elsevier, 2008, 6 (4), pp.618-626. <hal-00416442>
  • Guillaume Blin, Eric Blais, Danny Hermelin, Pierre Guillon, Mathieu Blanchette, et al.. Gene Maps Linearization using Genomic Rearrangement Distances. Journal of Computational Biology, Mary Ann Liebert, 2007, 14 (4), pp.394-407. <hal-00619755>
  • Guillaume Blin, Guillaume Fertin, Stéphane Vialette. Extracting Constrained 2-Interval Subsets in 2-Interval Sets. Theoretical Computer Science, Elsevier, 2007, 385 (1-3), pp.241-263. <hal-00417717>
  • Guillaume Blin, Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette. Comparing Genomes with Duplications: a Computational Complexity Point of View. ACM Transactions on Computational Logic, Association for Computing Machinery, 2007, 4 (4), pp.523-534. <hal-00417720>
  • Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette. What makes the Arc-Preserving Subsequence problem hard ?. LNCS Transactions on Computational Systems Biology, 2005, 2, pp.1-36. <hal-00417738>

Communication dans un congrès36 documents

  • Guillaume Blin, Marie Gasparoux, Sebastian Ordyniak, Alexandru Popa. SOBRA - Shielding Optimization for BRAchytherapy. 27th International Workshop on Combinatorial Algorithms, Aug 2016, Helsinki, Finland. 2016, Combinatorial Algorithms 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings. <http://iwoca2016.cs.helsinki.fi/>. <hal-01331027>
  • Bryan Brancotte, Bo Yang, Guillaume Blin, Sarah Cohen-Boulakia, Alain Denise, et al.. Rank aggregation with ties: Experiments and Analysis. The 41st International Conference on Very Large Data Bases, Aug 2015, Kohala Coast, Hawaï, United States. 8 (11). <hal-01152098>
  • Thomas Hume, Hayssam Soueidan, Macha Nikolski, Guillaume Blin. Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem. Giuseppe F. Italiano. 41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'15), Jan 2015, Pec pod Sněžkou, Czech Republic. LNCS, 8939, pp. 242-253, 2015. <hal-01056406>
  • Olivier Curé, Guillaume Blin, Dominique Revuz, David Célestin Faye. WaterFowl: a Compact, Self-indexed and Inference-enabled Immutable RDF Store. LNCS. 11th European Semantic Web Conference (ESWC'14), May 2014, Anissaras, Greece. Springer, The Semantic Web: Trends and Challenges, 8465, pp.302-316, 2014, Lecture Notes in Computer Science. <10.1007/978-3-319-07443-6_21>. <hal-00952845>
  • Guillaume Blin, Paul Morel, Romeo Rizzi, Stéphane Vialette. Towards unlocking the full potential of Multileaf Collimators. 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Jan 2014, High Tatras, Slovakia. 8327, pp.138-149, 2013, Lecture Notes in Computer Science. <hal-00859708>
  • Guillaume Blin. MISTREAT: MotIon Simulator in proton-therapy TREATment. The Workshop on Bioinformatics and Stringology 2014 (BioS 2014), Feb 2014, Dakha, Bangladesh. <hal-00918205>
  • Anna Adamaszek, Guillaume Blin, Alexandru Popa. Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem. Kratochvíl Jan, Mirka Miller and Dalibor Froncek. 25th International Workshop on Combinatorial Algorithms (IWOCA'14), Oct 2014, Duluth, Minnesota, United States. Springer International Publishing, 8986, pp. 13-23, 2014, Theoretical Computer Science and General Issues. <10.1007/978-3-319-19315-1>. <hal-01059381>
  • Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora. On the Parameterized Complexity of the Repetition Free Longest Common Subsequence Problem. Angel et al. International Workshop on Approximation, Parameterized and EXact algorithms (APEX'13), Jul 2013, Riga, Latvia. 3 pp. <hal-00949104>
  • David Faye, Olivier Curé, Guillaume Blin, Cheikh Thiam. RDF triples management in roStore. IC 2011, 22èmes Journées francophones d'Ingénierie des Connaissances, May 2012, Chambéry, France. pp.755-770, 2012. <hal-00746736>
  • Guillaume Blin, Minghui Jiang, Stéphane Vialette. The longest common subsequence problem with crossing-free arc-annotated sequences. L. Calderon-Benavides et al. 19th edition of the International Symposium on String Processing and Information Retrieval (SPIRE 2012), Oct 2012, Cartagena de Indias, Colombia. Springer, Heidelberg, 7608, pp. 130--142, 2012, LNCS. <hal-00713431>
  • Xiao Yang, Florian Sikora, Guillaume Blin, Sylvie Hamel, Roméo Rizzi, et al.. An algorithmic view on multi-related-segments: A unifying model for approximate common interval. Manindra Agrawal, S. Barry Cooper, and Angsheng Li. 9th annual conference on Theory and Applications of Models of Computation (TAMC), May 2012, Beijing, China. Springer-Verlag, 7287, pp.319-329, 2012, LNCS. <10.1007/978-3-642-29952-0_33>. <hal-00630150v2>
  • Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora. Complexity Insights of the Minimum Duplication Problem. Springer. 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), Jan 2012, Špindleruv Mlýn, Czech Republic. 7147, pp.153-164, 2012, Lecture Notes in Computer Science. <hal-00629047>
  • Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette. Hardness of longest common subsequence for sequences with bounded run-lengths. Juha Kärkkäinen and Jens Stoye. 23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), Jul 2012, Helsinki, Finland. Springer-Verlag, 7354, pp.138-148, 2012, Lecture Notes in Computer Science. <10.1007/978-3-642-31265-6_11>. <hal-00683311>
  • Guillaume Blin, Romeo Rizzi, Florian Sikora, Stéphane Vialette. Minimum Mosaic Inference of a Set of Recombinants. Potanin Alex and Viglas Taso. 17th Computing: the Australasian Theory Symposium (CATS'11), Jan 2011, Perth, Australia. ACS, 119, pp.23-30, 2011, CRPIT. <hal-00620371>
  • Guillaume Blin, Romeo Rizzi, Stéphane Vialette. A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. 6th International Computer Science Symposium in Russia (CSR'11), 2011, St Petersbourg, Russia. Computer Science – Theory and Applications, 6651, pp.373-384, 2011, Lecture Notes in Computer Science. <10.1007/978-3-642-20712-9_29>. <hal-00620378>
  • Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, et al.. Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA 2011, 2011, Zhangjiajie, China. Springer, 6831, pp.272-286, 2011, Lecture Notes in Computer Science. <10.1007/978-3-642-22616-8_22>. <hal-00606375>
  • Guillaume Blin, Romeo Rizzi, Stéphane Vialette. A faster algorithm for finding minimum Tucker submatrices. 6th Computability in Europe (CiE'10), 2010, Portugal. Springer, 6158, pp.69-77, 2010, Lecture Notes in Computer Science. <hal-00620380>
  • Guillaume Blin, Florian Sikora, Stéphane Vialette. GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networks. Hisham Al-Mubaid. Bioinformatics and Computational Biology (BICoB'10), Mar 2010, Honolulu, United States. pp.38-43, 2010, International Society for Computers and their Applications (ISCA). <hal-00425661>
  • Guillaume Blin, Sylvie Hamel, Stéphane Vialette. Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions. Rahman Md. S. and Fujita S. 4th Workshop on Algorithms and Computation (WALCOM'10), Feb 2010, Dhaka, Bangladesh, Bangladesh. Springer-Verlag, 5942, pp.149-160, 2010, Lecture Notes in Computer Science. <hal-00620327>
  • Olivier Curé, David Célestin Faye, Guillaume Blin. Towards a better insight of RDF triples Ontology-guided Storage system abilities. 6th International Workshop on Scalable Semantic Web Knowledge Base Systems (SSWS'10), 2010, Shanghai, China. 10pp., 2010. <hal-00620329>
  • Guillaume Blin, Jens Stoye. Finding Nested Common Intervals Efficiently. Ciccarelli Francesca D. and Miklós István. 7th RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'09), Sep 2009, Budapest, Hungary. Springer-Verlag, 5817, pp.59-69, 2009, Lecture Notes in Bioinformatics. <hal-00620365>
  • Guillaume Blin, Florian Sikora, Stéphane Vialette. Querying Protein-Protein Interaction Networks. Mandoiu Ion and Narasimhan Giri and Zhang Yanqing. 5th International Symposium on Bioinformatics Research and Applications (ISBRA'09), May 2009, Fort Lauderdale, United States. Springer-Verlag, 5542, pp.52-62, 2009, LNBI. <hal-00620391>
  • Guillaume Blin, Maxime Crochemore, Sylvie Hamel, Stéphane Vialette. Finding the median of three permutations under the Kendall-tau distance. Università degli Studi di Firenze. 7th annual international conference on Permutation Patterns, Jul 2009, Firenze, Italy. pp.6. <hal-00620459>
  • Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette. The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated. Das S. and Uehara R. WALCOM 2009, 2009, Kolkata, India. Springer-Verlag, 5431, pp.357-368, 2009, Lecture Notes in Computer Science. <hal-00416491>
  • Guillaume Blin, Guillaume Fertin, Gaël Herry, Stéphane Vialette. Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS Problems. Sagot Marie-France and Telles Walter Maria Emilia. Brazilian Symposium on Bioinformatics (BSB 2007), Aug 2007, Angra dos Reis, Brazil. Springer-Verlag, Lecture Notes in BioInformatics (LNBI) (4643), pp.101-112, 2007, Lecture Notes in BioInformatics (LNBI). <hal-00417918>
  • Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet. Extending the Hardness of RNA Secondary Structure Comparison. Chen Bo and Paterson Mike and Zhang Guochuan. 1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), Apr 2007, Hangzhou, China. Springer-Verlag, 4614, pp.140-151, 2007, Lecture Notes in Computer Science (LNCS). <hal-00418248>
  • Guillaume Blin, Eric Blais, Pierre Guillon, Mathieu Blanchette, Nadia El-Mabrouk. Inferring Gene Orders from Gene Maps using the Breakpoint Distance. Bourque Guillaume and El-Mabrouk Nadia. 4th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), Sep 2006, Montréal, Canada. Springer-Verlag, 4205, pp.99-112, 2006, LNBI. <hal-00620364>
  • Guillaume Blin, Helene Touzet. How to compare arc-annotated sequences: The alignment hierarchy. Crestani Fabio and Ferragina Paolo and Sanderson Mark. 13th String Processing and Information Retrieval, Oct 2006, Glasgow, United Kingdom. Springer Verlag, 4209, pp.291-303, 2006, Lecture Notes in Computer Sciences. <inria-00178671>
  • Guillaume Blin, Annie Château, Cedric Chauve, Yannick Gingras. Inferring Positional Homologs with Common Intervals of Sequences. Bourque Guillaume and El-Mabrouk Nadia. 4th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), Sep 2006, Montreal, Canada. Springer-Verlag, 4205, pp.24-38, 2006, LNBI. <hal-00620367>
  • Guillaume Blin, Roméo Rizzi. Conserved Interval Distance Computation Between Non-trivial Genomes. Wang Lusheng. 11th Annual International Conference Computing and Combinatorics (COCOON'05), Aug 2005, Kunming, China, China. Springer-Verlag, 3595, pp.22-31, 2005, LNCS. <hal-00620353>
  • Guillaume Blin, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette. What Makes the Arc-Preserving Subsequence Problem Hard?. S. Sunderam Vaidy and van Albada G. Dick and M. A. Sloot Peter and Dongarra Jack. 5th Int. Workshop on Bioinformatics Research and Applications (IWBRA'05), May 2005, Atlanta, GA, USA, United States. Springer-Verlag, 3515, pp.860-868, 2005, LNCS. <hal-00620359>
  • Guillaume Blin, Cedric Chauve, Guillaume Fertin. Genes Order and Phylogenetic Reconstruction: Application to $\gamma$-Proteobacteria. McLysaght Aoife and H. Huson Daniel. 3rd Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'05), Sep 2005, Dublin, Ireland, Ireland. Springer-Verlag, 3678, pp.11-20, 2005, LNCS. <hal-00620362>
  • Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints. Kratsch Dieter. 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), Jun 2005, Metz, France, France. Springer-Verlag, 3787, pp.271-282, 2005, LNCS. <hal-00620363>
  • Guillaume Blin, Guillaume Fertin, Roméo Rizzi, Stéphane Vialette. Pattern Matching in Arc-Annotated Sequences: New Results for the APS Problem. 5th Journées Ouvertes de Biologie, Informatique et Mathématiques (JOBIM'04), 2004, Montréal, Quebec, Canada. IEEE Computer Society, 12 pp., 2004. <hal-00620330>
  • Guillaume Blin, Guillaume Fertin, Cedric Chauve. The breakpoint distance for signed sequences. 1st Conference on Algorithms and Computational Methods for biochemical and Evolutionary Networks (CompBioNets'04), Dec 2004, Recife, Brazil, Brazil. King's College London publications, 3, pp.3-16, 2004, Texts in Algorithms. <hal-00620356>
  • Guillaume Blin, Guillaume Fertin, Stéphane Vialette. New Results for the 2-Interval Pattern Problem. Sahinalp Suleyman Cenk and Muthukrishnan S. and Dogrusoz Ugur. 15th Symposium on Combinatorial Pattern Matching (CPM'04), Jul 2004, Istanbul, Turkey, Turkey. Springer-Verlag, 3109, pp.311-322, 2004, LNCS. <hal-00620366>

Ouvrage (y compris édition critique et traduction)1 document

  • Olivier Curé, Guillaume Blin. RDF Database Systems, 1st Edition: Triples Storage and SPARQL Query Processing. Morgan Kaufmann, pp.248, 2014, 9780127999579. <hal-01083133>

Chapitre d'ouvrage2 documents

  • Christian J. Michel, Guillaume Blin, Florian Sikora. Analyse de séquences : des méthodes combinatoires et algorithmiques. Étienne Baudrier, Loïc Mazo. Informatique Mathématique - Une photographie en 2016, pp.57-87, 2016, 978-2-271-09335-6. <http://www.cnrseditions.fr/mathematiques/7264-informatique-mathematique.html>. <hal-01296618>
  • Guillaume Blin, Maxime Crochemore, Stéphane Vialette. Algorithmic Aspects of Arc-Annotated Sequences. Elloumi Mourad, Zomaya Albert Y. Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, Wiley, pp.113-126, 2011. <hal-00620821>

Direction d'ouvrage, Proceedings1 document

  • Vijayakumar Varadarajan, P. Nithyanandam, Neelanarayanan Venkataraman, Guillaume Blin. Special Issue: Innovative mobile technology. V. Vijayakumar; V. Neelanarayanan; P. Nithyanandam; Guillaume Blin. 3rd International Symposium on Big Data and Cloud Computing Challenges (ISBCC 2016), France. Inderscience Enterprises Ltd., 2017, International Journal of Image Mining. <hal-01555771>

Pré-publication, Document de travail2 documents

  • Olivier Curé, David Célestin Faye, Guillaume Blin. RIBStore: Data Management of RDF triples with RDFS Inferences. Preprint submited to a conference. 2010. <hal-00469428>
  • Guillaume Blin, Sylvie Hamel, Stéphane Vialette. Comparing RNA structures using a full set of biologically relevant edit operations is intractable. 7 pages. 2008. <hal-00347464>

Thèse1 document

  • Guillaume Blin. Combinatoire and Bio-informatique : Comparaison de structures d'ARN et calcul de distances intergénomiques. Informatique [cs]. Université de Nantes, 2005. Français. <tel-00491593>

HDR1 document

  • Guillaume Blin. Combinatorial Objects in Bio-Algorithmics: Related problems and complexities. Bioinformatics [q-bio.QM]. Université Paris-Est, 2012. <tel-00711879>