Guillaume Fertin
144
Documents
Current affiliations
- 481374
- 473973
Researcher identifiers
guillaume-fertin
-
0000-0002-8251-2012
- IdRef : 095050612
Publications
- 46
- 40
- 24
- 23
- 14
- 12
- 11
- 10
- 10
- 9
- 8
- 7
- 6
- 5
- 5
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
- 12
- 9
- 6
- 5
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 7
- 8
- 4
- 5
- 9
- 6
- 7
- 10
- 3
- 4
- 5
- 8
- 3
- 12
- 7
- 14
- 8
- 6
- 7
- 4
- 1
- 2
- 3
- 1
The Exact Subset MultiCover ProblemTheory and Applications of Models of Computation. TAMC 2022, Sep 2022, Tianjin, China. pp.189-200, ⟨10.1007/978-3-031-20350-3_16⟩
Conference papers
hal-03958441v1
|
|
|
L'Inférence de Protéines à travers le Modèle Peptide Quantity Assignment23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France
Conference papers
hal-03595308v1
|
Transposition Distance Considering Intergenic Regions for Unbalanced GenomesBioinformatics Research and Applications 18th International Symposium, ISBRA 2022, Nov 2022, Haifa, Israel. pp.100-113, ⟨10.1007/978-3-031-23198-8_10⟩
Conference papers
hal-03958480v1
|
|
Sorting by k-Cuts on Signed PermutationsComparative Genomics 19th International Conference, RECOMB-CG 2022, May 2022, La Jolla, United States. pp.189-204, ⟨10.1007/978-3-031-06220-9_11⟩
Conference papers
hal-03959780v1
|
|
|
Permutation Pattern Matching for Doubly Partially Ordered Patterns33rd Annual Symposium on Combinatorial Pattern Matching, Hideo Bannai and Jan Holub, Jun 2022, Prague, Czech Republic
Conference papers
hal-03624311v1
|
Sorting Genomes by Prefix Double-Cut-and-JoinsString Processing and Information Retrieval, 29th International Symposium, SPIRE 2022, Nov 2022, Concepcion, Chile. pp.178-190, ⟨10.1007/978-3-031-20643-6_13⟩
Conference papers
hal-03958465v1
|
|
A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions7th International Conference, AlCoB 2020 (Algorithms for Computational Biology ), Apr 2020, Missoula, United States. pp.16-28, ⟨10.1007/978-3-030-42266-0_2⟩
Conference papers
hal-02528304v1
|
|
Sorting by Reversals, Transpositions, and Indels on Both Gene Order and Intergenic SizesInternational Symposium on Bioinformatics Research and Applications ISBRA 2019, Jun 2019, Barcelona, Spain. pp.28-39, ⟨10.1007/978-3-030-20242-2_3⟩
Conference papers
hal-02304027v1
|
|
|
Unshuffling PermutationsTAMC, Apr 2019, Kitakyushu, Japan. pp.242-261, ⟨10.1007/978-3-030-14812-6_15⟩
Conference papers
hal-02304028v1
|
|
Finding a Small Number of Colourful ComponentsCPM 2019, Jul 2019, Pise, Italy. ⟨10.4230/LIPIcs.CPM.2019.20⟩
Conference papers
hal-02304030v1
|
On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph StructureAnnual Symposium on Combinatorial Pattern Matching -- CPM 2018, Jul 2018, Qingdao, China
Conference papers
hal-02081156v1
|
|
Super Short Reversals on Both Gene Order and Intergenic SizesAdvances in Bioinformatics and Computational Biology - 11th Brazilian Symposium on Bioinformatics -- BSB 2018, Oct 2018, Niteroi, Brazil. pp.14--25
Conference papers
hal-02081164v1
|
|
Algorithmic Aspects of the Maximum Colorful Arborescence ProblemTheory and Applications of Models of Computation - 14th Annual Conference, Apr 2017, Berne, Switzerland. pp.216-230, ⟨10.1007/978-3-319-55911-7_16⟩
Conference papers
hal-01524069v1
|
|
|
Beyond Adjacency Maximization: Scaffold Filling for New String Distances28th Annual Symposium on Combinatorial Pattern Matching, 2017, Warsaw, Poland. ⟨10.4230/LIPIcs.CPM.2017.27⟩
Conference papers
hal-01615671v1
|
SpecTrees: An efficient without a priori data structure for MS/MS spectra identification16th International Workshop on Algorithms in Bioinformatics (WABI), Aug 2016, Aarhus, Denmark. 12 p., ⟨10.1007/978-3-319-43681-4_6⟩
Conference papers
hal-01602410v1
|
|
|
Decomposing Cubic Graphs into Connected Subgraphs of Size ThreeThe 22nd International Computing and Combinatorics Conference (COCOON), Aug 2016, Ho Chi Minh City, Vietnam
Conference papers
hal-01309152v1
|
Graph Motif Problems Parameterized by Dual27th Annual Symposium on Combinatorial Pattern Matching, Jun 2016, Tel-Aviv, France
Conference papers
hal-01311579v1
|
|
Genome Rearrangements on both Gene Order and Intergenic RegionsWABI 2016, 2016, Aarhus, Denmark. pp.162-173
Conference papers
hal-01334942v1
|
|
|
Obtaining a Triangular Matrix by Independent Row-Column Permutations26th International Symposium on Algorithms and Computation, Dec 2015, Nagoya, France
Conference papers
hal-01189621v1
|
Prefix and Suffix Reversals on Strings22nd International Symposiumon String Processing and Information Retrieval (SPIRE 2015), Sep 2015, London, United Kingdom. pp.1-12, ⟨10.1007/978-3-319-23826-5_17⟩
Conference papers
hal-01194636v1
|
|
Algorithmic aspects of the S-Labeling problem26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Oct 2015, Verona, Italy. pp.173-184
Conference papers
hal-01311584v1
|
|
|
Towards an Algorithmic Guide to Spiral GalaxiesSeventh International Conference on FUN WITH ALGORITHMS (FUN 2014), Jul 2014, Lipari, Italy. pp.171-182, ⟨10.1007/978-3-319-07890-8_15⟩
Conference papers
hal-01044934v1
|
|
Reversal Distances for Strings with Few Blocks or Small Alphabets25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), Jun 2014, Moscou, Russia. pp.50-59, ⟨10.1007/978-3-319-07566-2_6⟩
Conference papers
hal-01044938v1
|
DExTaR: Detection of Exact Tandem Repeats based on the de Bruijn graphIEEE International Conference on Bioinformatics and Biomedicine (BIBM 2014), Nov 2014, Belfast, Ireland. pp.90-93, ⟨10.1109/BIBM.2014.6999134⟩
Conference papers
hal-01117967v1
|
|
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications13th Workshop on Algorithms in Bioinformatics (WABI2013), Sep 2013, Nice, France. pp.244-258, ⟨10.1007/978-3-642-40453-5_19⟩
Conference papers
hal-00906903v1
|
|
|
Pancake Flipping is Hard37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Aug 2012, Bratislava, Slovakia. pp.247-258
Conference papers
hal-00717712v1
|
|
On the Complexity of two Problems on Orientations of Mixed GraphsIn Proc. 5èmes Journées Ouvertes Biologie Informatique Mathématiques (JOBIM 2012), Jul 2012, Rennes, France. pp.161-170
Conference papers
hal-00826863v1
|
|
Algorithms for subnetwork mining in heterogeneous networks11th Symposium on Experimental Algorithms (SEA 2012), Jun 2012, Bordeaux, France. pp.184-194
Conference papers
hal-00689889v1
|
|
Tractability and Approximability of Maximal Strip Recovery22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), 2011, Palermo, Italy. pp.336-349
Conference papers
hal-00606167v1
|
|
Sorting by Transpositions is Difficult38th International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011, Zürich, Switzerland. pp.654-665
Conference papers
hal-00606223v1
|
|
Algorithmic Aspects of Heterogeneous Biological Networks ComparisonCOCOA 2011, 2011, Zhangjiajie, China. pp.272-286, ⟨10.1007/978-3-642-22616-8_22⟩
Conference papers
hal-00606375v1
|
|
Integration of omics data to investigate common intervals1st International Conference on Bioscience, Biochemistry and Bioinformatics (ICBBB 2011), 2011, Singapore, Singapore. pp.101-105
Conference papers
hal-00606226v1
|
|
Finding Approximate and Constrained Motifs in GraphsCPM 2011, 2011, Palermo, Italy. pp.388-401, ⟨10.1007/978-3-642-21458-5_33⟩
Conference papers
hal-00606173v1
|
|
Proper Alignment of MS/MS Spectra from Unsequenced Species11th International Conference on Bioinformatics and Computational Biology (BIOCOMP 2010), Sep 2010, Las Vegas, United States. pp.766-772, ⟨10.1.1.228.5162⟩
Conference papers
hal-01068873v1
|
|
Revisiting the Minimum Breakpoint Linearization Problem7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Jun 2010, Prague, France. pp.163-174
Conference papers
hal-00482856v1
|
Comparing Bacterial Genomes by Searching Their Common IntervalsBioinformatics and Computational Biology, Apr 2009, New Orleans, United States. pp.102--113, ⟨10.1007/978-3-642-00727-9_12⟩
Conference papers
hal-00415955v1
|
|
|
Maximum Motif Problem in Vertex-Colored Graphs20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009), 2009, Lille, France. pp.221-235, ⟨10.1007/978-3-642-02441-2_20⟩
Conference papers
hal-00416463v1
|
|
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsISAAC 2009 (20th International Symposium on Algorithms and Computation), 2009, Hawaii, United States. pp.710-719
Conference papers
hal-00425145v1
|
|
On Finding Small 2-Generating SetsCOCOON 2009, 2009, Niagara Falls, United States. pp.378-387, ⟨10.1007/978-3-642-02882-3_38⟩
Conference papers
hal-00416577v1
|
|
On the S-labeling ProblemProc. 5th Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB 2009), 2009, Bordeaux, France. pp.273-277
Conference papers
hal-00416570v1
|
|
The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximatedWALCOM 2009, 2009, Kolkata, India. pp.357-368
Conference papers
hal-00416491v1
|
|
Comparing Bacterial Genomes by Searching their Common Intervals1st International Conference on Bioinformatics and Computational Biology (BICoB 2009), 2009, New Orleans, United States. pp.102-113
Conference papers
hal-00416466v1
|
|
Pseudo-Boolean Programming for Partially Ordered GenomesRECOMB-CG 2009, Sep 2009, Budapest, Hungary. pp.126-137, ⟨10.1007/978-3-642-04744-2_11⟩
Conference papers
hal-00416458v1
|
|
Comparison of Spectra in Unsequenced Species4th Brazilian Symposium on Bioinformatics (BSB 2009), 2009, Porto Alegre, Brazil. pp.24-35, ⟨10.1007/978-3-642-03223-3_3⟩
Conference papers
hal-00416462v1
|
|
On the Approximability of Comparing Genomes with Duplicates2nd Workshop on Algorithms and Computation (WALCOM 2008), 2008, Dhaka, Bangladesh. pp.34-45
Conference papers
hal-00416492v1
|
|
Common Structured Patterns in Linear Graphs: Approximations and Combinatorics18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), 2007, London, Canada. pp.214-252
Conference papers
hal-00418241v1
|
|
How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), 2007, Montréal, Canada. pp.75-86
Conference papers
hal-00418258v1
|
|
A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), 2007, San Diego, United States. pp.16-29
Conference papers
hal-00417902v1
|
|
Weak pattern matching in colored graphs: Minimizing the number of connected components10th Italian Conference on Theoretical Computer Science (ICTCS 2007), 2007, Rome, Italy. pp.27-38
Conference papers
hal-00417910v1
|
|
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
Conference papers
hal-00418248v1
|
|
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
Conference papers
hal-00417918v1
|
|
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs34th International Colloquium on Automata, Languages and Programming (ICALP 2007), 2007, Wroclaw, Poland. pp.340-351
Conference papers
hal-00417928v1
|
|
Genomes containing Duplicates are Hard to compareInternational Workshop on Bioinformatics Research and Applications (IWBRA 2006), 2006, Reading, United Kingdom. pp.783-790
Conference papers
hal-00418260v1
|
|
Exemplar Longest Common Subsequence (extended abstract)International Workshop on Bioinformatics Research and Applications (IWBRA 2006), May 2006, Reading, United Kingdom. pp.622-629
Conference papers
hal-00461780v1
|
Genomes containing duplicates are hard to compareProc Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, Reading, UK, United Kingdom. pp.783-790
Conference papers
hal-00620297v1
|
|
How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation4thAnnual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), 2006, Montreal, Canada, Canada. pp.75-86
Conference papers
hal-00619848v1
|
|
Exemplar Longest Common SubsequencesInt. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, United States. pp.622-629
Conference papers
hal-00620296v1
|
|
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), 2005, Gdansk, Poland, Poland. pp.328-339
Conference papers
hal-00620292v1
|
|
|
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
Conference papers
hal-00620363v1
|
|
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
Conference papers
hal-00620362v1
|
|
Acyclic Coloring of Graphs of Maximum Degree $\Delta$2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.389-396, ⟨10.46298/dmtcs.3450⟩
Conference papers
hal-01184439v1
|
|
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
Conference papers
hal-00620359v1
|
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
Conference papers
hal-00620330v1
|
|
|
No-Hole L(p,0)-Labelling of Cycles, Grids and Hypercubes11th International Colloquium on Structural Information & Communication Complexity (SIROCCO 2004), Jun 2004, Smolenice, Slovakia. pp.138-148
Conference papers
hal-00307789v1
|
|
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
Conference papers
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
Conference papers
hal-00620366v1
|
Routing permutations in the hypercubeInternational Workshop on Graph-Theoretic Concepts in Computer Science WG'99, Jun 1999, Ascona, Switzerland. pp.179-190
Conference papers
hal-00649015v1
|
Detection of multiple modifications in mass spectra without any a priori69th ASMS Conference on Mass Spectrometry and Allied Topics, Oct 2021, Philadelphia (PA), United States
Conference poster
hal-03959810v1
|
Algorithmic Aspects in Information and Management 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings2016
Books
hal-01671021v1
|
|
Combinatorics of Genome RearrangementsMIT Press, pp.312, 2009, Computational Molecular Biology, 978-0-262-06282-4
Books
hal-00416453v1
|
Improved Lower Bounds for the Cyclic Bandwidth ProblemInternational Conference on Computational Science (ICCS 2021), pp.555-569, 2021, ⟨10.1007/978-3-030-77961-0_45⟩
Book sections
hal-03346828v1
|
|
Sorting by Multi-cut RearrangementsInternational Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2021), pp.593-607, 2021, ⟨10.1007/978-3-030-67731-2_43⟩
Book sections
hal-03346830v1
|
|
|
Computing Genomic Distances: An Algorihtmic ViewpointWiley Science. Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, Wiley Science, pp.773-798, 2011, ⟨10.1002/9780470892107.ch34⟩
Book sections
hal-00606146v1
|
SpecGlob: rapid and accurate alignment of mass spectra differing from their peptide models by several unknown modifications2022
Preprints, Working Papers, ...
hal-03959826v1
|
|
Finding a Small Number of Colourful Components2019
Preprints, Working Papers, ...
hal-01986725v1
|
|
|
On the Approximability of Comparing Genomes with Duplicates2008
Preprints, Working Papers, ...
hal-00285511v1
|
|
On the Approximability of Comparing Genomes with Duplicates2007
Preprints, Working Papers, ...
hal-00159893v1
|
|
New Bounds for the L(h, k) Number of Regular Grids2006
Preprints, Working Papers, ...
hal-00023160v1
|
EditorialTheoretical Computer Science, 717, Elsevier, 2018, Theoretical Computer Science, ⟨10.1016/j.tcs.2018.02.016⟩
Proceedings
hal-01911085v1
|