Guillaume Blin
69
Documents
Publications
- 29
- 14
- 13
- 11
- 7
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 2
- 6
- 7
- 2
- 9
- 5
- 8
- 4
- 2
- 5
- 3
- 6
- 3
- 8
Algorithmic challenges in radiation therapyComplexity, Algorithms, Automata and Logic Meet (CAALM), Jan 2019, Chennai, India
Communication dans un congrès
hal-02055624v1
|
|
Nearest constrained circular words29th Annual Symposium on Combinatorial Pattern Matching (CPM'18), Jul 2018, Qingdao, China. pp.6:1--6:14
Communication dans un congrès
hal-01742563v1
|
|
|
|
SOBRA - Shielding Optimization for BRAchytherapy27th International Workshop on Combinatorial Algorithms, Aug 2016, Helsinki, Finland
Communication dans un congrès
hal-01331027v1
|
Rank aggregation with ties: Experiments and AnalysisThe 41st International Conference on Very Large Data Bases, Aug 2015, Kohala Coast, Hawaï, United States
Communication dans un congrès
hal-01152098v1
|
|
|
|
Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem41st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'15), Jan 2015, Pec pod Sněžkou, Czech Republic. pp. 242-253
Communication dans un congrès
hal-01056406v1
|
|
|
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
|
|
|
An Update Strategy for the WaterFowl RDF Data Store 13th International Semantic Web Conference (ISWC 2014), 2014, Riva del Garda, Italy. ⟨10.5555/2878453.2878548⟩
Communication dans un congrès
hal-01740550v1
|
WaterFowl: a Compact, Self-indexed and Inference-enabled Immutable RDF Store11th European Semantic Web Conference (ESWC'14), May 2014, Anissaras, Greece. pp.302-316, ⟨10.1007/978-3-319-07443-6_21⟩
Communication dans un congrès
hal-00952845v1
|
|
MISTREAT: MotIon Simulator in proton-therapy TREATmentThe Workshop on Bioinformatics and Stringology 2014 (BioS 2014), Feb 2014, Dakha, Bangladesh
Communication dans un congrès
hal-00918205v1
|
|
|
|
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem25th International Workshop on Combinatorial Algorithms (IWOCA'14), Oct 2014, Duluth, Minnesota, United States. pp. 13-23, ⟨10.1007/978-3-319-19315-1⟩
Communication dans un congrès
hal-01059381v1
|
On the Parameterized Complexity of the Repetition Free Longest Common Subsequence ProblemInternational Workshop on Approximation, Parameterized and EXact algorithms (APEX'13), Jul 2013, Riga, Latvia. 3 pp
Communication dans un congrès
hal-00949104v1
|
|
|
|
An algorithmic view on multi-related-segments: A unifying model for approximate common interval9th annual conference on Theory and Applications of Models of Computation (TAMC), May 2012, Beijing, China. pp.319-329, ⟨10.1007/978-3-642-29952-0_33⟩
Communication dans un congrès
hal-00630150v2
|
|
|
RDF triples management in roStoreIC 2011, 22èmes Journées francophones d'Ingénierie des Connaissances, May 2012, Chambéry, France. pp.755-770
Communication dans un congrès
hal-00746736v1
|
|
|
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
|
|
|
The longest common subsequence problem with crossing-free arc-annotated sequences19th edition of the International Symposium on String Processing and Information Retrieval (SPIRE 2012), Oct 2012, Cartagena de Indias, Colombia. pp. 130--142
Communication dans un congrès
hal-00713431v1
|
|
|
Hardness of longest common subsequence for sequences with bounded run-lengths23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), Jul 2012, Helsinki, Finland. pp.138-148, ⟨10.1007/978-3-642-31265-6_11⟩
Communication dans un congrès
hal-00683311v1
|
|
|
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
|
|
|
Algorithmic Aspects of Heterogeneous Biological Networks ComparisonCOCOA 2011, 2011, Zhangjiajie, China. pp.272-286, ⟨10.1007/978-3-642-22616-8_22⟩
Communication dans un congrès
hal-00606375v1
|
|
|
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
|
|
|
GraMoFoNe: a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networksBioinformatics and Computational Biology (BICoB'10), Mar 2010, Honolulu, United States. pp.38-43
Communication dans un congrès
hal-00425661v1
|
|
|
Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions4th Workshop on Algorithms and Computation (WALCOM'10), Feb 2010, Dhaka, Bangladesh, Bangladesh. pp.149-160
Communication dans un congrès
hal-00620327v1
|
|
|
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
|
|
|
Towards a better insight of RDF triples Ontology-guided Storage system abilities6th International Workshop on Scalable Semantic Web Knowledge Base Systems (SSWS'10), 2010, Shanghai, China. 10pp
Communication dans un congrès
hal-00620329v1
|
Querying Protein-Protein Interaction Networks5th International Symposium on Bioinformatics Research and Applications (ISBRA'09), May 2009, Fort Lauderdale, United States. pp.52-62
Communication dans un congrès
hal-00620391v1
|
|
|
|
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximatedWALCOM 2009, 2009, Kolkata, India. pp.357-368
Communication dans un congrès
hal-00416491v1
|
|
|
Finding the median of three permutations under the Kendall-tau distance7th annual international conference on Permutation Patterns, Jul 2009, Firenze, Italy. pp.6
Communication dans un congrès
hal-00620459v1
|
|
|
Finding Nested Common Intervals Efficiently7th RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'09), Sep 2009, Budapest, Hungary. pp.59-69
Communication dans un congrès
hal-00620365v1
|
|
|
Comparing RNA Structures: Towards an Intermediate Model Between the EDIT and the LAPCS ProblemsBrazilian Symposium on Bioinformatics (BSB 2007), Aug 2007, Angra dos Reis, Brazil. pp.101-112
Communication dans un congrès
hal-00417918v1
|
|
|
Extending the Hardness of RNA Secondary Structure Comparison1st International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), Apr 2007, Hangzhou, China. pp.140-151
Communication dans un congrès
hal-00418248v1
|
|
|
How to compare arc-annotated sequences: The alignment hierarchy13th String Processing and Information Retrieval, Oct 2006, Glasgow, United Kingdom. pp.291-303
Communication dans un congrès
inria-00178671v1
|
|
|
Inferring Gene Orders from Gene Maps using the Breakpoint Distance4th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), Sep 2006, Montréal, Canada. pp.99-112
Communication dans un congrès
hal-00620364v1
|
|
|
Inferring Positional Homologs with Common Intervals of Sequences4th Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), Sep 2006, Montreal, Canada. pp.24-38
Communication dans un congrès
hal-00620367v1
|
|
|
Conserved Interval Distance Computation Between Non-trivial Genomes11th Annual International Conference Computing and Combinatorics (COCOON'05), Aug 2005, Kunming, China, China. pp.22-31
Communication dans un congrès
hal-00620353v1
|
|
|
Genes Order and Phylogenetic Reconstruction: Application to $\gamma$-Proteobacteria3rd Annual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'05), Sep 2005, Dublin, Ireland, Ireland. pp.11-20
Communication dans un congrès
hal-00620362v1
|
|
|
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
|
|
|
Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), Jun 2005, Metz, France, France. pp.271-282
Communication dans un congrès
hal-00620363v1
|
|
|
The breakpoint distance for signed sequences1st Conference on Algorithms and Computational Methods for biochemical and Evolutionary Networks (CompBioNets'04), Dec 2004, Recife, Brazil, Brazil. pp.3-16
Communication dans un congrès
hal-00620356v1
|
|
|
New Results for the 2-Interval Pattern Problem15th Symposium on Combinatorial Pattern Matching (CPM'04), Jul 2004, Istanbul, Turkey, Turkey. pp.311-322
Communication dans un congrès
hal-00620366v1
|
Pattern Matching in Arc-Annotated Sequences: New Results for the APS Problem5th Journées Ouvertes de Biologie, Informatique et Mathématiques (JOBIM'04), 2004, Montréal, Quebec, Canada. 12 pp
Communication dans un congrès
hal-00620330v1
|
RDF Database Systems, 1st EditionMorgan Kaufmann, pp.248, 2014, 9780127999579
Ouvrages
hal-01083133v1
|
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
Chapitre d'ouvrage
hal-01296618v1
|
|
Algorithmic Aspects of Arc-Annotated SequencesElloumi Mourad, Zomaya Albert Y. Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, Wiley, pp.113-126, 2011
Chapitre d'ouvrage
hal-00620821v1
|
|
|
Prédiction d'efficience d'algorithme de placementActes de l'atelier Apprentissage Profond: Théorie et Applications (APTA), 2021
Autre publication scientifique
hal-03130589v1
|
Geant4 physics list comparison for the simulation of phase-contrast mammography (XPulse project)2018
Autre publication scientifique
hal-01878696v1
|
|
|
RIBStore: Data Management of RDF triples with RDFS Inferences2010
Pré-publication, Document de travail
hal-00469428v1
|
|
|
Comparing RNA structures using a full set of biologically relevant edit operations is intractable2008
Pré-publication, Document de travail
hal-00347464v1
|
|
|
Combinatoire and Bio-informatique : Comparaison de structures d'ARN et calcul de distances intergénomiquesInformatique [cs]. Université de Nantes, 2005. Français. ⟨NNT : ⟩
Thèse
tel-00491593v1
|
|
|
Combinatorial Objects in Bio-Algorithmics: Related problems and complexitiesBioinformatics [q-bio.QM]. Université Paris-Est, 2012
HDR
tel-00711879v1
|