( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Searching for alternate RNA structures in genomic sequences.

, , и . CMSR@ECCB, стр. 13-24. McGill University, (2014)

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.

Claude Touzet

Hélène Esnault

Hélène Bernatchez

Hélène Martinez

Hélène Leroux

 

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

TFM-Explorer: mining cis-regulatory regions in genomes., , и . Nucleic Acids Res., 38 (Web-Server-Issue): 286-292 (2010)Propriétés combinatoires pour la terminaison de systèmes de réécriture. (Combinatorial properties for termination in term rewriting theory).. Henri Poincaré University, Nancy, France, (1997)A Characterisation of Multiply Recursive Functions with Higman's Lemma.. RTA, том 1631 из Lecture Notes in Computer Science, стр. 163-174. Springer, (1999)Large Scale Matching for Position Weight Matrices., , и . CPM, том 4009 из Lecture Notes in Computer Science, стр. 401-412. Springer, (2006)Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching., , и . LATA, том 5457 из Lecture Notes in Computer Science, стр. 481-492. Springer, (2009)On the Levenshtein Automaton and the Size of the Neighbourhood of a Word.. LATA, том 9618 из Lecture Notes in Computer Science, стр. 207-218. Springer, (2016)A Complex Example of a Simplifying Rewrite System.. ICALP, том 1443 из Lecture Notes in Computer Science, стр. 507-517. Springer, (1998)Encoding the Hydra Battle as a Rewrite System.. MFCS, том 1450 из Lecture Notes in Computer Science, стр. 267-276. Springer, (1998)An Ordinal Calculus for Proving Termination in Term Rewriting., и . CAAP, том 1059 из Lecture Notes in Computer Science, стр. 226-240. Springer, (1996)A Characterisation of Multiply Recursive Functions with Higman's Lemma.. Inf. Comput., 178 (2): 534-544 (2002)