Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Algorithms for computing the double cut and join distance on both gene order and intergenic sizes.

G. Fertin, G. Jean, and E. Tannier. Algorithms Mol. Biol., 12 (1): 16:1-16:11 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Guillaume Pierre

Guillaume Klein

Guillaume Schurgers

Guillaume Weick

Guillaume Jacques

Other publications of authors with the same name

Combinatorics of Genome Rearrangements.G. Fertin, A. Labarre, I. Rusu, E. Tannier, and S. Vialette. Computational molecular biology MIT Press, (2009)Exemplar Longest Common Subsequence.P. Bonizzoni, G. Vedova, R. Dondi, G. Fertin, and S. Vialette. International Conference on Computational Science (2), volume 3992 of Lecture Notes in Computer Science, page 622-629. Springer, (2006)Maximum Motif Problem in Vertex-Colored Graphs.R. Dondi, G. Fertin, and S. Vialette. CPM, volume 5577 of Lecture Notes in Computer Science, page 221-235. Springer, (2009)On Finding Small 2-Generating Sets.I. Fagnot, G. Fertin, and S. Vialette. COCOON, volume 5609 of Lecture Notes in Computer Science, page 378-387. Springer, (2009)Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs.M. Fellows, G. Fertin, D. Hermelin, and S. Vialette. ICALP, volume 4596 of Lecture Notes in Computer Science, page 340-351. Springer, (2007)Towards an Algorithmic Guide to Spiral Galaxies.G. Fertin, S. Jamshidi, and C. Komusiewicz. FUN, volume 8496 of Lecture Notes in Computer Science, page 171-182. Springer, (2014)Odd gossiping.G. Fertin, J. Peters, L. Raabe, and C. Xu. Discret. Appl. Math., (2017)The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph.G. Fertin, J. Fradin, and C. Komusiewicz. CoRR, (2017)Finding a Small Number of Colourful Components.L. Bulteau, K. Dabrowski, G. Fertin, M. Johnson, D. Paulusma, and S. Vialette. CPM, volume 128 of LIPIcs, page 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the structure of minimum broadcast digraphs.G. Fertin. Theor. Comput. Sci., 245 (2): 203-216 (2000)

BibSonomy

Disambiguation of "Fertin, Guillaume"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Algorithms for computing the double cut and join distance on both gene order and intergenic sizes.

Please choose a person to relate this publication to

Guillaume Pierre

Guillaume Klein

Guillaume Schurgers

Guillaume Weick

Guillaume Jacques

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Fertin, Guillaume"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Algorithms for computing the double cut and join distance on both gene order and intergenic sizes.

Please choose a person to relate this publication to

Guillaume Pierre

Guillaume Klein

Guillaume Schurgers

Guillaume Weick

Guillaume Jacques

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Algorithms for computing the double cut and join distance on both gene order and intergenic sizes.