( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Finding Approximate and Constrained Motifs in Graphs.

, , и . CPM, том 6661 из Lecture Notes in Computer Science, стр. 388-401. Springer, (2011)

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.

Guillaume Klein

Guillaume Pierre

Guillaume Schurgers

Guillaume Weick

Guillaume Jacques

 

Другие публикации лиц с тем же именем

Combinatorics of Genome Rearrangements., , , , и . Computational molecular biology MIT Press, (2009)Exemplar Longest Common Subsequence., , , , и . International Conference on Computational Science (2), том 3992 из Lecture Notes in Computer Science, стр. 622-629. Springer, (2006)Maximum Motif Problem in Vertex-Colored Graphs., , и . CPM, том 5577 из Lecture Notes in Computer Science, стр. 221-235. Springer, (2009)Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs., , , и . ICALP, том 4596 из Lecture Notes in Computer Science, стр. 340-351. Springer, (2007)Towards an Algorithmic Guide to Spiral Galaxies., , и . FUN, том 8496 из Lecture Notes in Computer Science, стр. 171-182. Springer, (2014)On Finding Small 2-Generating Sets., , и . COCOON, том 5609 из Lecture Notes in Computer Science, стр. 378-387. Springer, (2009)Odd gossiping., , , и . Discret. Appl. Math., (2017)Algorithms for computing the double cut and join distance on both gene order and intergenic sizes., , и . Algorithms Mol. Biol., 12 (1): 16:1-16:11 (2017)On the structure of minimum broadcast digraphs.. Theor. Comput. Sci., 245 (2): 203-216 (2000)Upper and lower bounds for finding connected motifs in vertex-colored graphs., , , и . J. Comput. Syst. Sci., 77 (4): 799-811 (2011)