Guillaume Fertin
38
Documents
Affiliations actuelles
- 481374
- 1088564
Identifiants chercheurs
- guillaume-fertin
- 0000-0002-8251-2012
- IdRef : 095050612
Publications
- 38
- 12
- 12
- 9
- 5
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 6
- 1
- 3
- 5
- 5
- 2
- 5
- 3
- 5
- 1
|
Decomposing Cubic Graphs into Connected Subgraphs of Size ThreeThe 22nd International Computing and Combinatorics Conference (COCOON), Aug 2016, Ho Chi Minh City, Vietnam. ⟨10.1007/978-3-319-42634-1_32⟩
Communication dans un congrès
hal-01309152v1
|
|
Obtaining a Triangular Matrix by Independent Row-Column Permutations26th International Symposium on Algorithms and Computation, Dec 2015, Nagoya, France. ⟨10.1007/978-3-662-48971-0_15⟩
Communication dans un congrès
hal-01189621v1
|
Algorithmic aspects of the S-Labeling problem26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Oct 2015, Verona, Italy. pp.173-184
Communication dans un congrès
hal-01311584v1
|
|
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⟩
Communication dans un congrès
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⟩
Communication dans un congrès
hal-00906903v1
|
|
|
Pancake Flipping is Hard37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Aug 2012, Bratislava, Slovakia. pp.247-258
Communication dans un congrès
hal-00717712v1
|
|
Algorithms for subnetwork mining in heterogeneous networks11th Symposium on Experimental Algorithms (SEA 2012), Jun 2012, Bordeaux, France. pp.184-194
Communication dans un congrès
hal-00689889v1
|
|
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
Communication dans un congrès
hal-00826863v1
|
|
Tractability and Approximability of Maximal Strip Recovery22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), 2011, Palermo, Italy. pp.336-349
Communication dans un congrès
hal-00606167v1
|
|
Integration of omics data to investigate common intervals1st International Conference on Bioscience, Biochemistry and Bioinformatics (ICBBB 2011), 2011, Singapore, Singapore. pp.101-105
Communication dans un congrès
hal-00606226v1
|
|
Sorting by Transpositions is Difficult38th International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011, Zürich, Switzerland. pp.654-665
Communication dans un congrès
hal-00606223v1
|
|
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
|
|
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
Communication dans un congrès
hal-00482856v1
|
|
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.1007/978-3-642-03223-3_3⟩
Communication dans un congrès
hal-01068873v1
|
|
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, ⟨10.1007/978-3-642-00727-9_12⟩
Communication dans un congrès
hal-00416466v1
|
|
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
Communication dans un congrès
hal-00425145v1
|
|
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⟩
Communication dans un congrès
hal-00416462v1
|
|
On the Approximability of Comparing Genomes with Duplicates2nd Workshop on Algorithms and Computation (WALCOM 2008), 2008, Dhaka, Bangladesh. pp.34-45
Communication dans un congrès
hal-00416492v1
|
|
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 Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), 2007, Montréal, Canada. pp.75-86
Communication dans un congrès
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
Communication dans un congrès
hal-00417902v1
|
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
Communication dans un congrès
hal-00619848v1
|
Combinatorics of Genome RearrangementsMIT Press, pp.312, 2009, Computational Molecular Biology, 978-0-262-06282-4
Ouvrages
hal-00416453v1
|
|
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⟩
Chapitre d'ouvrage
hal-00606146v1
|
|
On the Approximability of Comparing Genomes with Duplicates2008
Pré-publication, Document de travail
hal-00285511v1
|
|
On the Approximability of Comparing Genomes with Duplicates2007
Pré-publication, Document de travail
hal-00159893v1
|