Displaying similar documents to “Combinatoria e Topologia. Teorema di Quillen e funzioni di Möbius”

Sintesi di acidi ribonucleici e di proteine nelle diverse regioni dell'embrione di Xenopus laevis

Marisa Leonardi Cigada, Fiorenza Laria De Bernardi, Anna Maria Scarpetti Bolzern (1975)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti

Similarity:

An analysis of RNA and protein synthesis has been carried out on Xenopus laevis embryos, cut into two portions, during the early stages of their development. Actinomycin D was employed to inhibit the synthesis. The action of actinomycin on synthesis is stronger during gastrulation than during neurulation. In each stage a correlation between RNA synthesis inhibition and protein synthesis inhibition has been observed. In the ventral fragments of the neurula the ratio between the two inhibitions...

Ulteriori osservazioni sulla rigenerazione del mesencefalo in Xenopus laevis (Daudin). Istologia del tetto ottico normale e rigenerato

Sergio Filoni, Vito Margotta, Giancarlo Gibertini (1971)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti

Similarity:

The histology of normal and regenerated optic lobes was examined in young specimens of Xenopus laevis by applying the Golgi-Cox method. In the operated animals the unilateral ablation of the optic lobe has been performed at the early larval stages (48-51) and at the later larval stages (55-56), according to Nieuwkoop and Faber. From our observations we drew the following conclusions: 1) The histological features of the optic tectum of Xenopus laevis are essentially similar to those of...

Questo numero è primo? Sì, forse, dipende ...

Luisella Caire, Umberto Cerruti (2006)

Bollettino dell'Unione Matematica Italiana

Similarity:

In this paper we outline some algorithms answering the question if a given number is prime: primally criteria, that are deterministic (they positively reply yes or not) and unconditional, but inefficient (technically not polynomial-time); algoritms that are efficient, but only probabilistic (to say they give absolute certainty if they answer not, whereas they only give a low boundary of the probability for the number to be prime if they answer yes); algorithms that are the same time...