Nombre de documents

108

Publications - Guillaume Fertin


Article dans une revue49 documents

  • Guillaume Fertin, Géraldine Jean, Eric Tannier. Algorithms for computing the double cut and join distance on both gene order and intergenic sizes. Algorithms for Molecular Biology, BioMed Central, 2017, 12, 16 (11 p.). <10.1186/s13015-017-0107-y>. <hal-01533200>
  • Guillaume Fertin, Joseph G. Peters, Lynette Raabe, Charlie Xu. Odd Gossiping. Discrete Applied Mathematics, Elsevier, 2017, 216, pp.550-561. <10.1016/j.dam.2016.01.034>. <hal-01314648>
  • Carla Negri Lintzmayer, Guillaume Fertin, Zanoni Dias. Sorting permutations by prefix and suffix rearrangements. Journal of Bioinformatics and Computational Biology, World Scientific Publishing, 2017, 15 (1), pp.1-46. <10.1142/S0219720017500020>. <hal-01524046>
  • Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz. (Prefix) reversal distance for (signed) strings with few blocks or small alphabets. Journal of Discrete Algorithms, Elsevier, 2016, 37, pp.44-55. <10.1016/j.jda.2016.05.002>. <hal-01318663>
  • Laurent Bulteau, Guillaume Fertin, Eric Tannier. Genome rearrangements with indels in intergenes restrict the scenario space. BMC Bioinformatics, BioMed Central, 2016, 17 (Suppl 14), 426 (7 p.). <10.1186/s12859-016-1264-6>. <hal-01396842>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Pancake Flipping Is Hard. Journal of Computer and System Sciences, Elsevier, 2015, 81 (8), pp.1556-1574. <10.1016/j.jcss.2015.02.003>. <hal-01053461>
  • Laurent Bulteau, Guillaume Fertin, Stéphane Vialette, Roméo Rizzi. Some algorithmic results for [2]-sumset covers. Information Processing Letters, Elsevier, 2015, 115 (1), pp.1-5. <hal-01044891>
  • Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz. Towards an Algorithmic Guide to Spiral Galaxies. Theoretical Computer Science, Elsevier, 2015, pp.26-39. <10.1016/j.tcs.2015.01.051>. <hal-01159940>
  • Carla Negri Lintzmayer, Zanoni Dias, Guillaume Fertin. Approximation algorithms for sorting by length-weighted prefix and suffix operations. Theoretical Computer Science, Elsevier, 2015, 593, pp.26-41. <10.1016/j.tcs.2015.05.039>. <hal-01164599>
  • Guillaume Fertin, Géraldine Jean, Andreea Radulescu, Irena Rusu. Hybrid de novo tandem repeat detection using short and long reads. BMC Medical Genomics, BioMed Central, 2015, 8 (Suppl 3), pp.S5. <10.1186/1755-8794-8-S3-S5>. <hal-01214038>
  • Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu. Path-Driven Orientation of Mixed Graphs. Discrete Applied Mathematics, Elsevier, 2015, 181, pp.98-108. <10.1016/j.dam.2014.10.016>. <hal-01044921>
  • Guillaume Fertin, Christian Komusiewicz, Hafedh Mohamed-Babou, Irena Rusu. Finding Supported Paths in Heterogeneous Networks. Algorithms, MDPI AG, 2015, <10.3390/a8040810>. <hal-01214037>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. Journal of Discrete Algorithms, Elsevier, 2013, 19, pp.1-22. <hal-00826876>
  • Riccardo Dondi, Guillaume Fertin, Stéphane Vialette. Finding Approximate and Constrained Motifs in Graphs. Theoretical Computer Science, Elsevier, 2013, 483 (-), pp.10-21. <10.1016/j.tcs.2012.08.023>. <hal-00726556>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Revisiting the Minimum Breakpoint Linearization Problem Theoretical Computer Science. Theoretical Computer Science, Elsevier, 2013, 494, pp.122-133. <hal-00826880>
  • Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu. Tractability and approximability of maximal strip recovery. Theoretical Computer Science, Elsevier, 2012, 440-441, pp.14-28. <10.1016/j.tcs.2012.04.034>. <hal-00700598>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Sorting by Transpositions is Difficult. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2012, 26 (3), pp.1148-1180. <10.1137/110851390>. <hal-00826867>
  • Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. Upper and lower bounds for finding connected motifs in vertex-colored graphs. Journal of Computer and System Sciences, Elsevier, 2011, 77 (4), pp.799-811. <10.1016/j.jcss.2010.07.003>. <hal-00606148>
  • Riccardo Dondi, Guillaume Fertin, Stéphane Vialette. Complexity issues in Vertex-Colored Graph Pattern Matching. Journal of Discrete Algorithms, Elsevier, 2011, 9 (1), pp.82-99. <10.1016/j.jda.2010.09.002>. <hal-00606154>
  • Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette. Finding Common Structured Patterns in Linear Graphs. Theoretical Computer Science, Elsevier, 2010, 411 (26-28), pp.2475-2486. <10.1016/j.tcs.2010.02.017>. <hal-00482850>
  • Guillaume Fertin, Romeo Rizzi, Stéphane Vialette. Finding Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. Journal of Discrete Algorithms, Elsevier, 2009, 7 (1), pp.90-101. <hal-00416394>
  • Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette. On the Approximability of Comparing Genomes with Duplicates. Journal of Graph Algorithms and Applications (JGAA), Brown University, 2009, 13 (1), pp.19-53. <hal-00416440>
  • 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 Fertin, André Raspaud. Acyclic Coloring of Graphs of Maximum Degree Five: Nine Colors are Enough. Information Processing Letters, Elsevier, 2008, 105 (2), pp.65-72. <hal-00416567>
  • Guillaume Fertin, André Raspaud. Acyclic coloring of graphs of maximum degree five: Nine colors are enough. Information Processing Letters, Elsevier, 2008, pp.65-72. <hal-00300737>
  • Zhongzhi Zhang, Francesc Comellas, Guillaume Fertin, André Raspaud, Lili Rong, et al.. Vertex labeling and routing in expanded Apollonian networks. Journal of Physics A: Mathematical and Theoretical, IOP Publishing, 2008, 41 (3), pp.035004. <hal-00416574>
  • Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thevenin, Stéphane Vialette. Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between two Genomes with Duplicate Genes. Journal of Computational Biology, Mary Ann Liebert, 2008, 15 (8), pp.1093-1115. <hal-00416446>
  • 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>
  • Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Rafaella Rizzi, et al.. Exemplar Longest Common Subsequence. ACM Transactions on Computational Logic, Association for Computing Machinery, 2007, 4 (4), pp.535-543. <hal-00417728>
  • 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>
  • Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette. A General Framework for Computing Rearrangement Distances between Genomes with Duplicates. Journal of Computational Biology, Mary Ann Liebert, 2007, 14 (4), pp.379-393. <hal-00417735>
  • Guillaume Fertin, André Raspaud. L(p,q) labeling of d-dimensional grids. Discrete Mathematics, Elsevier, 2007, 307 (16), pp.2132-2140. <hal-00293512>
  • Guillaume Fertin, André Raspaud. L(p,q) labeling of d-Dimensional Grids. Discrete Mathematics, Elsevier, 2007, 307 (16), pp.2132-2140. <hal-00307791>
  • Zhongzhi Zhang, Francesc Comellas, Guillaume Fertin, Lili Rong. High dimensional Apollonian networks. Journal of Physics A: Mathematical and Theoretical, IOP Publishing, 2006, 39, pp.1811-1818. <hal-00461776>
  • Tiziana Calamoneri, Saverio Caminiti, Guillaume Fertin. New Bounds for the L(h,k) Number of Regular Grids. International Journal of Mobile Network Design and Innovation, Inderscience, 2006, 1 (2), pp.92-101. <hal-00461775>
  • 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>
  • Guillaume Fertin, André Raspaud, Bruce Reed. Star Coloring of Graphs. Journal of Graph Theory, Wiley, 2004, 47 (3), pp.163-182. <hal-00307788>
  • Cedric Chauve, Guillaume Fertin. On Maximal Instances for the Original Syntenic Distance. Theoretical Computer Science, Elsevier, 2004, 326, pp.29-43. <hal-00417741>
  • Guillaume Fertin, André Raspaud. A Survey of Knödel Graphs. Discrete Applied Mathematics, Elsevier, 2004, 137 (2), pp.173-195. <hal-00307786>
  • Guillaume Fertin, André Raspaud. A Survey on Knödel Graphs. Discrete Applied Mathematics, Elsevier, 2003, 137 (2), pp.173--195. <hal-00442434>
  • Guillaume Fertin, André Raspaud, Arup Roychowdhury. On the oriented chromatic number of grids. Information Processing Letters, Elsevier, 2003, 85 (5), pp.261-266. <hal-00307790>
  • G. Fertin, Emmanuel Godard, André Raspaud. Acyclic and k-distance coloring of the grid. Information Processing Letters, Elsevier, 2003, 87 (1), pp.51-58. <hal-00307787>
  • Noga Alon, Guillaume Fertin, Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho. Factor d-Domatic Colorings of Graphs. Discrete Mathematics, Elsevier, 2003, 262 (1--3), pp.17--25. <hal-00442418>
  • Guillaume Fertin, Emmanuel Godard, André Raspaud. Minimum feedback vertex set and acyclic coloring. Information Processing Letters, Elsevier, 2002, 84 (3), pp.131-139. <hal-00307785>
  • Olivier Baudon, Guillaume Fertin, Ivan Havel. Routing Permutations and 2-1 Routing Requests in the Hypercube. Discrete Applied Mathematics, Elsevier, 2001, 113 (1), pp.43--58. <hal-00442419>
  • Olivier Baudon, Guillaume Fertin, Ivan Havel. Routing permutations and 2-1 routing requests in the hypercube. Discrete Applied Mathematics, Elsevier, 2001, 113, pp.43-58. <hal-00649005>
  • Guillaume Fertin, Roger Labahn. Compounding of Gossip Graphs. Networks, Wiley, 2000, 36 (2), pp.126--137. <hal-00442427>
  • Guillaume Fertin. On the Structure of Minimum Broadcast Digraphs. Theoretical Computer Science, Elsevier, 2000, 245 (2), pp.203--216. <hal-00442425>
  • Guillaume Fertin. A Study of Minimum Gossip Graphs. Discrete Mathematics, Elsevier, 2000, 215 (1--3), pp.33--57. <hal-00442424>

Communication dans un congrès54 documents

  • Guillaume Fertin, Julien Fradin, Géraldine Jean. Algorithmic Aspects of the Maximum Colorful Arborescence Problem. Theory and Applications of Models of Computation - 14th Annual Conference, Apr 2017, Berne, Switzerland. Springer, Proceedings of TAMC 2017 (Theory and Applications of Models of Computation - 14th Annual Conference), Lecture Notes in Computer Science (10185), pp.216-230, <10.1007/978-3-319-55911-7_16>. <hal-01524069>
  • Matthieu David, Guillaume Fertin, Dominique Tessier. SpecTrees: an efficient without a priori data structure for MS/MS spectra identification. Martin Frith and Christian N. S. Pedersen. 16th Workshop on Algorithms in Bioinformatics (WABI 2016), Aug 2016, Aarhus, Denmark. Springer-Verlag, Lecture Notes in Bioinformatics. <http://conferences.au.dk/algo16/wabi/>. <hal-01337288>
  • Guillaume Fertin, Christian Komusiewicz. Graph Motif Problems Parameterized by Dual. 27th Annual Symposium on Combinatorial Pattern Matching, Jun 2016, Tel-Aviv, France. 2016, LIPIcs – Leibniz International Proceedings in Informatics. <hal-01311579>
  • Guillaume Fertin, Géraldine Jean, Eric Tannier. Genome Rearrangements on both Gene Order and Intergenic Regions. WABI 2016, 2016, Aarhus, Denmark. 9838, pp.162-173, Algorithms for Bioinformatics, Lecture Notes in Computer Science. <hal-01334942>
  • Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu. Decomposing Cubic Graphs into Connected Subgraphs of Size Three. The 22nd International Computing and Combinatorics Conference (COCOON), Aug 2016, Ho Chi Minh City, Vietnam. Proceedings of the 22nd International Computing and Combinatorics Conference (COCOON), 2016, <http://optnetsci.cise.ufl.edu/cocoon16/>. <hal-01309152>
  • Guillaume Fertin, Irena Rusu, Stéphane Vialette. Algorithmic aspects of the S-Labeling problem. 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Oct 2015, Verona, Italy. Springer-Verlag, pp.173-184, 2015, Lecture Notes in Computer Science. <hal-01311584>
  • Guillaume Fertin, Irena Rusu, Stéphane Vialette. Obtaining a Triangular Matrix by Independent Row-Column Permutations. 26th International Symposium on Algorithms and Computation, Dec 2015, Nagoya, France. <hal-01189621>
  • Guillaume Fertin, Loïc Jankowiak, Géraldine Jean. Prefix and Suffix Reversals on Strings. 22nd International Symposiumon String Processing and Information Retrieval (SPIRE 2015), Sep 2015, London, United Kingdom. Springer, 9309, pp.1-12, Lecture Notes in Computer Science. <http://www.springer.com/us/book/9783319238258>. <10.1007/978-3-319-23826-5_17>. <hal-01194636>
  • Guillaume Fertin, Shahrad Jamshidi, Christian Komusiewicz. Towards an Algorithmic Guide to Spiral Galaxies. Springer-Verlag. Seventh International Conference on FUN WITH ALGORITHMS (FUN 2014), Jul 2014, Lipari, Italy. Springer-Verlag, 8496, pp.171-182, 2014, Lecture notes in computer science. <10.1007/978-3-319-07890-8_15>. <hal-01044934>
  • Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz. Reversal Distances for Strings with Few Blocks or Small Alphabets. Springer-Verlag. 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), Jun 2014, Moscou, Russia. Springer-Verlag, 8486, pp.50-59, 2014, Lecture notes in computer science. <10.1007/978-3-319-07566-2_6>. <hal-01044938>
  • Guillaume Fertin, Géraldine Jean, Andreea Radulescu, Irena Rusu. DExTaR: Detection of Exact Tandem Repeats based on the de Bruijn graph. IEEE International Conference on Bioinformatics and Biomedicine (BIBM 2014), Nov 2014, Belfast, Ireland. IEEE, pp.90-93, 2014, Proc. IEEE International Conference on Bioinformatics and Biomedicine. <http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6999134>. <10.1109/BIBM.2014.6999134>. <hal-01117967>
  • Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz, Irena Rusu. A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications. Springer. 13th Workshop on Algorithms in Bioinformatics (WABI2013), Sep 2013, Nice, France. 8126, pp.244-258, 2013, Lecture Notes in Bioinformatics. <10.1007/978-3-642-40453-5_19>. <hal-00906903>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Pancake Flipping is Hard. Springer Verlag. 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), Aug 2012, Bratislava, Slovakia. 7467, pp.247-258, 2012, Lecture Notes in Computer Science. <hal-00717712>
  • Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu. On the Complexity of two Problems on Orientations of Mixed Graphs. In Proc. 5èmes Journées Ouvertes Biologie Informatique Mathématiques (JOBIM 2012), Jul 2012, Rennes, France. pp.161-170, 2012. <hal-00826863>
  • Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu. Algorithms for subnetwork mining in heterogeneous networks. 11th Symposium on Experimental Algorithms (SEA 2012), Jun 2012, Bordeaux, France. Springer, 7228, pp.184-194, 2012, Lecture Notes in Computer Science. <hal-00689889>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Sorting by Transpositions is Difficult. 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011, Zürich, Switzerland. Springer, LNCS (6755), pp.654-665, 2011, Lecture Notes in Computer Science. <hal-00606223>
  • 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>
  • Riccardo Dondi, Guillaume Fertin, Stéphane Vialette. Finding Approximate and Constrained Motifs in Graphs. CPM 2011, 2011, Palermo, Italy. Springer, 6661, pp.388-401, 2011, Lecture Notes in Computer Science. <10.1007/978-3-642-21458-5_33>. <hal-00606173>
  • Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu. Tractability and Approximability of Maximal Strip Recovery. 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), 2011, Palermo, Italy. Springer, LNCS (6661), pp.336-349, 2011, Lecture Notes in Computer Science. <hal-00606167>
  • Sébastien Angibaud, Philippe Bordron, Damien Eveillard, Guillaume Fertin, Irena Rusu. Integration of omics data to investigate common intervals. IEEE. 1st International Conference on Bioscience, Biochemistry and Bioinformatics (ICBBB 2011), 2011, Singapore, Singapore. pp.101-105, 2011. <hal-00606226>
  • Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier. Proper Alignment of MS/MS Spectra from Unsequenced Species. 11th International Conference on Bioinformatics and Computational Biology (BIOCOMP 2010), Sep 2010, Las Vegas, United States. pp.766-772, 2010, <10.1.1.228.5162>. <hal-01068873>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Revisiting the Minimum Breakpoint Linearization Problem. 7th Annual Conference on Theory and Applications of Models of Computation (TAMC 2010), Jun 2010, Prague, France. Springer, 6108, pp.163-174, 2010, Lecture Notes in Computer Science. <hal-00482856>
  • Laurent Bulteau, Guillaume Fertin, Irena Rusu. Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms. ISAAC 2009 (20th International Symposium on Algorithms and Computation), 2009, Hawaii, United States. Springer-Verlag, 5878, pp.710-719, 2009, Lecture Notes in Computer Science (LNCS). <hal-00425145>
  • Sébastien Angibaud, Damien Eveillard, Guillaume Fertin, Irena Rusu. Comparing Bacterial Genomes by Searching Their Common Intervals. Bioinformatics and Computational Biology, Apr 2009, New Orleans, United States. Springer Verlag, 5462, pp.102--113, 2009, Lecture Note in Bio-Informatics (LNBI). <10.1007/978-3-642-00727-9_12>. <hal-00415955>
  • 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>
  • Sébastien Angibaud, Guillaume Fertin, Annelyse Thevenin, Stéphane Vialette. Pseudo-Boolean Programming for Partially Ordered Genomes. RECOMB-CG 2009, Sep 2009, Budapest, Hungary. Springer-Verlag, 5817, pp.126-137, 2009, Lecture Notes in BioInformatics. <10.1007/978-3-642-04744-2_11>. <hal-00416458>
  • Freddy Cliquet, Guillaume Fertin, Irena Rusu, Dominique Tessier. Comparison of Spectra in Unsequenced Species. Springer-Verlag. 4th Brazilian Symposium on Bioinformatics (BSB 2009), 2009, Porto Alegre, Brazil. Springer-Verlag, Lecture Notes in BioInformatics (LNBI) (5576), pp.24-35, 2009, Lecture Notes in BioInformatics (LNBI). <hal-00416462>
  • Riccardo Dondi, Guillaume Fertin, Stéphane Vialette. Maximum Motif Problem in Vertex-Colored Graphs. 20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009), 2009, Lille, France. Springer-Verlag, 5577, pp.221-235, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-02441-2_20>. <hal-00416463>
  • Sébastien Angibaud, Damien Eveillard, Guillaume Fertin, Irena Rusu. Comparing Bacterial Genomes by Searching their Common Intervals. Springer-Verlag. 1st International Conference on Bioinformatics and Computational Biology (BICoB 2009), 2009, New Orleans, United States. Springer-Verlag, Lecture Notes in BioInformatics (LNBI) (5462), pp.102-113, 2009, Lecture Notes in BioInformatics (LNBI). <hal-00416466>
  • Guillaume Fertin, Stéphane Vialette. On the S-labeling Problem. Eslevier. Proc. 5th Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB 2009), 2009, Bordeaux, France. Eslevier, 34, pp.273-277, 2009, Electronic Notes on Discrete Mathematics. <hal-00416570>
  • Isabelle Fagnot, Guillaume Fertin, Stéphane Vialette. On Finding Small 2-Generating Sets. COCOON 2009, 2009, Niagara Falls, United States. Springer-Verlag, 5609, pp.378-387, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-02882-3_38>. <hal-00416577>
  • Sébastien Angibaud, Guillaume Fertin, Irena Rusu. On the Approximability of Comparing Genomes with Duplicates. Springer-Verlag. 2nd Workshop on Algorithms and Computation (WALCOM 2008), 2008, Dhaka, Bangladesh. Springer-Verlag, Lecture Notes in Computer Science (LNCS) (4921), pp.34-45, 2008, Lecture Notes in Computer Science (LNCS). <hal-00416492>
  • Riccardo Dondi, Guillaume Fertin, Stéphane Vialette. Weak pattern matching in colored graphs: Minimizing the number of connected components. 10th Italian Conference on Theoretical Computer Science (ICTCS 2007), 2007, Rome, Italy. World-Scientific Conference Proceedings, pp.27-38, 2007, World-Scientific Conference Proceedings. <hal-00417910>
  • 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>
  • Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thevenin, Stéphane Vialette. A Pseudo-Boolean programming approach for computing the breakpoint distance between two genomes with duplicate genes. 5th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2007), 2007, San Diego, United States. Springer-Verlag, Lecture Notes in BioInformatics (LNBI) (4751), pp.16-29, 2007, Lecture Notes in BioInformatics (LNBI). <hal-00417902>
  • Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette. Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs. 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), 2007, Wroclaw, Poland. Springer-Verlag, Lecture Notes in Computer Science (LNCS) (4596), pp.340-351, 2007, Lecture Notes in Computer Science (LNCS). <hal-00417928>
  • Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette. How Pseudo-Boolean Programming can help Genome Rearrangement Distance Computation. 4th RECOMB Comparative Genomics Satellite Workshop (RECOMB-CG 2006), 2007, Montréal, Canada. Springer-Verlag, Lecture Notes in BioInformatics (LNBI) (4205), pp.75-86, 2006, Lecture Notes in BioInformatics (LNBI). <hal-00418258>
  • Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette. Common Structured Patterns in Linear Graphs: Approximations and Combinatorics. 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), 2007, London, Canada. Springer-Verlag, Lecture Notes in Computer Science (LNCS) (4580), pp.214-252, 2007, Lecture Notes in Computer Science (LNCS). <hal-00418241>
  • 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>
  • Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette. Exemplar Longest Common Subsequence (extended abstract). International Workshop on Bioinformatics Research and Applications (IWBRA 2006), May 2006, Reading, United Kingdom. Springer-Verlag, LNCS Vol. 3992, pp.622-629, 2006, Lecture Notes in Computer Science (LNCS). <hal-00461780>
  • Paola Bonizzoni, Gianuca Della Vedova, Riccardo Dondi, Guillaume Fertin, Stéphane Vialette. Exemplar Longest Common Subsequences. Mandoiu Ion. Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, United States. Springer, 3992, pp.622-629, 2006, LNCS. <hal-00620296>
  • Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette. Genomes containing duplicates are hard to compare. Mandoiu Ion. Proc Int. Workshop on Bioinformatics Research and Applications (IWBRA), 2006, Reading, UK, United Kingdom. Springer, 3992, pp.783-790, 2006, LNCS. <hal-00620297>
  • Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Stéphane Vialette. How Pseudo-boolean Programming Can Help Genome Rearrangement Distance Computation. 4thAnnual RECOMB Satellite Workshop on Comparative Genomics (RECOMB-CG'06), 2006, Montreal, Canada, Canada. Springer-Verlag, pp.75-86, 2006, LNBI. <hal-00619848>
  • Cedric Chauve, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette. Genomes containing Duplicates are Hard to compare. International Workshop on Bioinformatics Research and Applications (IWBRA 2006), 2006, Reading, United Kingdom. Springer-Verlag, LNCS Vol. 3992, pp.783-790, 2006, Lecture Notes in Computer Science (LNCS). <hal-00418260>
  • 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, 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 Fertin, Romeo Rizzi, Stéphane Vialette. Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. Jedrzejowicz Joanna and Szepietowski Andrzej. 30th International Symposium on Mathematical Foundations of Computer Science (MFCS'05), 2005, Gdansk, Poland, Poland. Springer-Verlag, 3618, pp.328-339, 2005, LNCS. <hal-00620292>
  • Guillaume Fertin, André Raspaud. Acyclic Coloring of Graphs of Maximum Degree $\Delta$. Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.389-396, 2005, DMTCS Proceedings. <hal-01184439>
  • Guillaume Fertin, André Raspaud, Ondrej Sykora. No-Hole L(p,0)-Labelling of Cycles, Grids and Hypercubes. Springer-Verlag. 11th International Colloquium on Structural Information & Communication Complexity (SIROCCO 2004), Jun 2004, Smolenice, Slovakia. Ratislav Kralovic and Ondrej Sykora, Lecture Notes in Computer Science (LNCS) (3104), pp.138-148, 2004, 3104 of Lecture Note. <hal-00307789>
  • 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>
  • 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>
  • Olivier Baudon, Guillaume Fertin, Ivan Havel. Routing permutations in the hypercube. International Workshop on Graph-Theoretic Concepts in Computer Science WG'99, Jun 1999, Ascona, Switzerland. Springer-Verlag, 1665, pp.179-190, 1999, Lecture Notes in Computer Science. <hal-00649015>

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

  • Guillaume Fertin, Anthony Labarre, Irena Rusu, Eric Tannier, Stéphane Vialette. Combinatorics of Genome Rearrangements. MIT Press, pp.312, 2009, Computational Molecular Biology. <hal-00416453>

Chapitre d'ouvrage1 document

  • Guillaume Fertin, Irena Rusu. Computing Genomic Distances: An Algorihtmic Viewpoint. Wiley Science. Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, Wiley Science, pp.773-798, 2011, <10.1002/9780470892107.ch34>. <hal-00606146>

Pré-publication, Document de travail3 documents

  • Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thevenin, Stéphane Vialette. On the Approximability of Comparing Genomes with Duplicates. 2008. <hal-00285511>
  • Sébastien Angibaud, Guillaume Fertin, Irena Rusu. On the Approximability of Comparing Genomes with Duplicates. Rapport de recherche. 2007. <hal-00159893>
  • Tiziana Calamoneri, Saverio Caminiti, Guillaume Fertin. New Bounds for the L(h, k) Number of Regular Grids. RR 05.04. 2006. <hal-00023160>