Skip to main content
SpringerLink
Log in

Evaluation d'arbre pour un calcul formel (application a l'enumeration de proteines)

  • Contributed Papers
  • Conference paper
  • First Online:
CAAP '81 (CAAP 1981)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 112))

Included in the following conference series:

  • 148 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographie

  1. AHO et ULLMAN: The theory of parsing, translation and compiling, Ed. Prentice Hall, (1972)

    Google Scholar 

  2. J.A. BLACK, R.N. HARKINS et P. STENZEL: Non-random relationships among amino acids in protein sequences. International Journal in Peptide and Protein Research, 8, 125–130, (1976).

    Google Scholar 

  3. N. CHOMSKY et M.P. CHUTZENBERGER: The algebric theory of context free languages. Ed. North Holland, Amsterdam, (1963).

    Google Scholar 

  4. D. DEBOUVERIE et J. SHLUSSELBERG: Research of specific constraints in pair association of amino acids. Biochimie, 56, 1045–1051, (1974).

    Google Scholar 

  5. M.P. FRANCHI-ZANNETTACCI: Etude statistique des enchainements d'acides aminés par des méthodes combinatoires et l'utilisation du calcul formel. Thèse 3° cycle, Bordeaux, (1980).

    Google Scholar 

  6. L.J. GUIBAS et A.M. ODLYZKO: Strings overlaps, pattern matching and nontransitive games. Manuscrit non publié.

    Google Scholar 

  7. J. HARDOUIN DUPARC: Une méthode pour la résolution de certains problèmes combinatoires, Thèse d'état Bordeaux, 1980.

    Google Scholar 

  8. J.P. HUTCHINSON et H.S. WIRLF: On Eulerian circuits and words with described adjency patterns, Journal of combinatorial theory (A) 18, 80–87 (1975).

    Google Scholar 

  9. D.E. KNUTH: Examples of formal semantics, Iecture Notes in Mathematics, no 188, Springer Verlag, (1971).

    Google Scholar 

  10. LIVERCY: Théorie des programmes, shémas, preuves, sémantique, Edition Dunod, Paris, (1978).

    Google Scholar 

  11. P. LUCAS et K. WALK: On the formal definition of PL/I. Annual Review in automatic Programming, 105–182, (1969).

    Google Scholar 

  12. S. TANAKA et H.A. SHERAGA: Statistical treatment of protein conformation. Macromollecules, Vol. 9, no 5, 812–833, (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d'Informatique, Université de Bordeaux II, France

    Marie-Pierre Franchi-Zannettacci

Authors
  1. Marie-Pierre Franchi-Zannettacci
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egidio Astesiano Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Franchi-Zannettacci, MP. (1981). Evaluation d'arbre pour un calcul formel (application a l'enumeration de proteines). In: Astesiano, E., Böhm, C. (eds) CAAP '81. CAAP 1981. Lecture Notes in Computer Science, vol 112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10828-9_63

Download citation

  • DOI: https://doi.org/10.1007/3-540-10828-9_63

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10828-3

  • Online ISBN: 978-3-540-38716-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation