Publications and preprints by Florencia Leonardi   
12. |
Collet, P. and Leonardi, F.
Loss of memory of hidden Markov models and Lyapunov exponents.
ArXiv: 0908.0077, 2012. [arxiv] [journal] [pdf] |
11. |
Galves, A., Galves, C., Garcia, J., Garcia, N. and Leonardi, F.
Context tree selection and linguistic rhythm retrieval from written texts.
ArXiv: 0902.3619v3. Annals of Applied Statistics 6(1), pp. 186-209, 2012. [arxiv] [journal] [pdf] |
10. |
Garivier, A. and Leonardi, F.
Context tree selection: a unifying view.
ArXiv:1011.2424v3. Stochastic processes and their applications 121, pp. 2488-2506, 2011. [arxiv] [journal] [pdf] |
9. |
Leonardi, F.
Some upper bounds for the rate of convergence of penalized likelihood
context tree estimators.
ArXiv: math/0701810v5. Brazilian Journal of Probability and Statistics 24, pp. 321-336, 2010. [arxiv] [journal] [pdf] |
8. |
Busch, J.R., Ferrari, P.A., Flesia, A.G., Fraiman, R., Grynberg,
S. and Leonardi, F.
Testing statistical hypothesis on random trees and applications to the protein
classification problem.
ArXiv: math/0603378. Annals of Applied Statistics 3(2), pp. 542-563, 2009. [arxiv] [journal] [pdf] |
7. |
Flesia, A.G., Fraiman, R. and Leonardi, F.
Pattern recognition on random trees associated to protein functionality families.
ArXiv: math/0711.1369. In: 2 BIOMAT, 2008, La Falda. Actas de la Academia Nacional de
Ciencias de Córdoba, Argentina, J. Tirao (Ed), 2008. [arxiv] [journal] [pdf] |
6. |
Collet, P., Galves, A. and Leonardi, F.
Random perturbations of stochastic processes with unbounded variable length memory.
ArXiv: math/0707.2796.
Electronic Journal of Probability 13, pp. 1345-1361, 2008. [arxiv] [journal] [pdf] |
5. |
Galves, A. and Leonardi, F.
Exponential inequalities for empirical unbounded context trees.
ArXiv: math/0710.5900.
In and Out of Equilibrium 2 (Sidoravicius, V.; Vares, M.E., Eds.),
Progress in Probability, v. 60, pp. 257-270, 2008. [arxiv] [journal] [pdf] |
4. |
Leonardi, F., Matioli, S.R., Armelin, H.A. and Galves, A.
Detecting phylogenetic relations out from sparse context trees.
ArXiv: math/0804.4279, 2007. [arxiv] [journal] [pdf] |
3. |
Leonardi, F.
A generalization of the PST algorithm: modeling the
sparse nature of protein sequences.
Bioinformatics (22)11, pp. 1302-1307, 2006. [arxiv] [journal] [pdf] |
2. |
Barrera, J., Cesar Jr., R.M., Martins Jr., D.C., Merino, E.F., Vêncio, R.Z.N.,
Leonardi, F., Yamamoto, M.M., Pereira, C.A.B.and del
Portillo, H.A. Constructing probabilistic genetic networks of
Plasmodium falciparum from dynamical expression signals of the
intraerythrocytic development cycle. In: McConnell; Lin and
Hurban. (Org.). Methods of Microarray Data Analysis V., Springer, 2006. [arxiv] [journal] [pdf] |
1. |
Leonardi, F. and Galves, A.
Sequence motif identification and
protein family classification using probabilistic trees.
In: Simpósio Brasileiro de Bioinformática, BSB 2005, São Leopoldo, RS,
Brasil.
Lecture Notes in Computer Science 3594,
pp. 190-193, 2005. [arxiv] [journal] [pdf] |