Nombre de documents trouvés : 19 documents

1 - 2

The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing Carrascosa R., Coste F., Gallé M., Infante-Lopez G. Algorithms, 4 (2011) 262-284 [inria-00638445 - version 1]

Searching for Smallest Grammars on Large Sequences and Application to DNA Carrascosa R., Coste F., Gallé M., Infante-Lopez G. Journal of Discrete Algorithms (2011) [inria-00536633 - version 1]

Modelling Biological Sequences by Grammatical Inference Coste F. ICGI 2010 Tutorial Day, Espagne (2010) [inria-00531552 - version 1]

Choosing Word Occurrences for the Smallest Grammar Problem Carrascosa R., Coste F., Gallé M., Infante-Lopez G. LATA, Allemagne (2010) [inria-00476840 - version 1]

IN-PLACE UPDATE OF SUFFIX ARRAY WHILE RECODING WORDS Gallé M., Peterlongo P., Coste F. International Journal of Foundations of Computer Science (2009) [inria-00471599 - version 1]

In-place update of suffix array while recoding words Gallé M., Peterlongo P., Coste F. International Journal of Foundations of Computer Science 20, 6 (2009) 1025-1045 [inria-00430406 - version 1]

Modeling local repeats on genomic sequences Nicolas J., Rousseau C., Siegel A., Peterlongo P., Coste F., Durand P., Tempel S., Valin A.-S., Mahé F. Rapport de recherche (2008) 43 [inria-00353690 - version 1]

Grammatical Inference: Algorithms and Applications 9th International Colloquium, ICGI 2008 Saint-Malo, France, September 22-24, 2008 Proceedings Coste F., Miclet L., Clark A. (2008) 305 [inria-00338208 - version 1]

In-place Update of Suffix Array while Recoding Words Gallé M., Peterlongo P., Coste F. Prague Stringology Conference 2008, Tchèque, République (2008) [inria-00327582 - version 1]

Mise à jour incrémentale de tableau des suffxes en cours de recodage Coste F., Peterlongo P., Gallé M. Algorithmique, combinatoire du texte et applications en bio-informatique, France (2007) [inria-00186352 - version 1]

1 - 2

L'URL de cette page est : http://hal.archives-ouvertes.fr/aut/francois coste/