
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
6
3
9
5
8
4
2
5
3
6
3
8
Publications
|
Graph Neural Network Comparison for 2D Nesting Efficiency EstimationJournal of Intelligent Manufacturing, 2023, 35, pp.859-873. ⟨10.1007/s10845-023-02084-6⟩
Article dans une revue
hal-03952756
v1
|
|
On the Approximability of the Minimum Weight t-partite Clique ProblemJournal of Graph Algorithms and Applications, 2020, 24 (3), pp.171-190. ⟨10.7155/jgaa.00525⟩
Article dans une revue
hal-02547506
v1
|
Geant4 physics list comparison for the simulation of phase-contrast mammography (XPulse project)Physica Medica European Journal of Medical Physics, 2019, 60, pp.66-75. ⟨10.1016/j.ejmp.2019.03.026⟩
Article dans une revue
hal-02120079
v1
|
|
MSPT: An open-source motion simulator for proton therapyBiomedical Physics & Engineering Express, 2015, 1 (3), 12 pp
Article dans une revue
hal-01171799
v1
|
|
|
Rank aggregation with ties: Experiments and AnalysisProceedings of the VLDB Endowment (PVLDB), 2015, Proceedings of the VLDB Endowment (PVLDB), 8 (11), pp.1202-1213. ⟨10.14778/2809974.2809982⟩
Article dans une revue
hal-01165336
v1
|
|
xHeinz: an algorithm for mining cross-species network modules under a flexible conservation modelBioinformatics, 2015, 31 (19), ⟨10.1093/bioinformatics/btv316⟩
Article dans une revue
hal-01248545
v1
|
|
Spot Weight Adaptation for Moving Target in Spot Scanning Proton TherapyFrontiers in Oncology, 2015, 5 (119), pp.1-7. ⟨10.3389/fonc.2015.00119⟩
Article dans une revue
hal-01151923
v1
|
|
Complexity Insights of the Minimum Duplication ProblemTheoretical Computer Science, 2014, 530, pp.66-79
Article dans une revue
hal-00948488
v1
|
|
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-00679269
v1
|
|
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-00657340
v1
|
|
A survey of RDF storage approachesRevue Africaine de Recherche en Informatique et Mathématiques Appliquées, 2012, Volume 15, 2012, pp.11-35. ⟨10.46298/arima.1956⟩
Article dans une revue
hal-01299496
v1
|
|
On the Parameterized Complexity of the Repetition Free Longest Common Subsequence ProblemInformation Processing Letters, 2012, 112 (7), pp.272-276. ⟨10.1016/j.ipl.2011.12.009⟩
Article dans une revue
hal-00637255
v2
|
|
Median of an odd number of permutationsPure Mathematics and Applications, 2011, 21 (2), pp.161 - 175
Article dans une revue
hal-00619773
v1
|
|
Finding Nested Common Intervals EfficientlyJournal of Computational Biology, 2010, 17 (9), pp.1183-1194
Article dans une revue
hal-00619751
v1
|
|
Alignments of RNA structures.IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2010, 7 (2), pp.309-322. ⟨10.1109/TCBB.2008.28⟩
Article dans une revue
hal-00506348
v1
|
|
Querying Graphs in Protein-Protein Interactions Networks using Feedback Vertex SetIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2010, 7 (4), pp.628-635
Article dans une revue
hal-00619763
v1
|
|
Fixed-Parameter Algorithms For Protein Similarity Search Under mRNA Structure ConstraintsJournal of Discrete Algorithms, 2008, 6 (4), pp.618-626
Article dans une revue
hal-00416442
v1
|
|
Gene Maps Linearization using Genomic Rearrangement DistancesJournal of Computational Biology, 2007, 14 (4), pp.394-407
Article dans une revue
hal-00619755
v1
|
|
Extracting Constrained 2-Interval Subsets in 2-Interval SetsTheoretical Computer Science, 2007, 385 (1-3), pp.241-263
Article dans une revue
hal-00417717
v1
|
|
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-00417720
v1
|
|
What makes the Arc-Preserving Subsequence problem hard ?LNCS Transactions on Computational Systems Biology, 2005, 2, pp.1-36
Article dans une revue
hal-00417738
v1
|
Algorithmic challenges in radiation therapyComplexity, Algorithms, Automata and Logic Meet (CAALM), Jan 2019, Chennai, India
Communication dans un congrès
hal-02055624
v1
|
|
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-01742563
v1
|
|
|
SOBRA - Shielding Optimization for BRAchytherapy27th International Workshop on Combinatorial Algorithms, Aug 2016, Helsinki, Finland
Communication dans un congrès
hal-01331027
v1
|
|
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-01056406
v1
|
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-01152098
v1
|
|
|
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-01740550
v1
|
|
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-00952845
v1
|
|
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-01059381
v1
|
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-00918205
v1
|
|
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-00949104
v1
|
|
|
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-00859708
v1
|
|
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-00713431
v1
|
|
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-00683311
v1
|
|
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-00629047
v1
|
|
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-00746736
v1
|
|
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-00630150
v2
|
|
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-00606375
v1
|
|
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-00620371
v1
|
|
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-00620378
v1
|
|
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-00425661
v1
|
|
A faster algorithm for finding minimum Tucker submatrices6th Computability in Europe (CiE'10), 2010, Portugal. pp.69-77
Communication dans un congrès
hal-00620380
v1
|
|
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-00620327
v1
|
|
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-00620329
v1
|
|
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-00620365
v1
|
|
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-00620459
v1
|
|
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximatedWALCOM 2009, 2009, Kolkata, India. pp.357-368
Communication dans un congrès
hal-00416491
v1
|
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-00620391
v1
|
|
|
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-00417918
v1
|
|
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-00418248
v1
|
|
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-00620367
v1
|
|
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-00620364
v1
|
|
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-00178671
v1
|
|
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-00620362
v1
|
|
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-00620353
v1
|
|
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-00620359
v1
|
|
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. pp.271-282
Communication dans un congrès
hal-00620363
v1
|
|
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-00620356
v1
|
|
New Results for the 2-Interval Pattern Problem15th Symposium on Combinatorial Pattern Matching (CPM'04), Jul 2004, Istanbul, Turkey. pp.311-322
Communication dans un congrès
hal-00620366
v1
|
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-00620330
v1
|
RDF Database Systems, 1st EditionMorgan Kaufmann, pp.248, 2014, 9780127999579
Ouvrages
hal-01083133
v1
|
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-01296618
v1
|
|
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-00620821
v1
|
|
Prédiction d'efficience d'algorithme de placementActes de l'atelier Apprentissage Profond: Théorie et Applications (APTA), 2021
Autre publication scientifique
hal-03130589
v1
|
Geant4 physics list comparison for the simulation of phase-contrast mammography (XPulse project)2018
Autre publication scientifique
hal-01878696
v1
|
|
RIBStore: Data Management of RDF triples with RDFS Inferences2010
Pré-publication, Document de travail
hal-00469428
v1
|
|
Comparing RNA structures using a full set of biologically relevant edit operations is intractable2008
Pré-publication, Document de travail
hal-00347464
v1
|
|
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-00491593
v1
|
|
Combinatorial Objects in Bio-Algorithmics: Related problems and complexitiesBioinformatics [q-bio.QM]. Université Paris-Est, 2012
HDR
tel-00711879
v1
|
Chargement...
Chargement...