*: denotes current and former undergraduate and graduate research assistants.

Book Chapters

  • Mathematical approaches for describing microbial populations: practice and theory for extrapolation of rich environments. []
    M. Lladser, R. Knight.
    In “The Human Microbiota: How Microbial Communities Affect Health and Disease”
    Wiley-Blackwell Publishing
    Edited by D. Fredricks
    ISBN: 978-0-470-47989-6
    ISBN-13: 978-0470479896 (2013)

Books

  • Variables Aletorias y Simulación Estocástica (translation: Random Variables and Stochastic Simulation) []
    Author: M. E. Lladser
    Editor: Noreste Juan Carlos Sáez, Chile
    Edition: First.
    Pages: 207
    Language: Spanish
    ISBN: 9789563060683

Edited Volumes

  • Algorithmic Probability and Combinatorics. []
    AMS Contemporary Mathematics, Volume 520, 240 pp. (2010)
    Editors: M. E. Lladser, R. Maier, M. Mishna, A. Rechnitzer.

Scientific Papers

  •  Allocation of New Draws for Optimal Sampling of Urn Ensembles with Application to the Human Microbiome Project
    J. Hampton*, M. E. Lladser. Under review (2012)
  • Unifrac: an effective distance metric for microbial community comparison. [] [] []
    C. Lozupone, M. E. Lladser, D. Knights, J. Stombaugh, R. Knight. Multidisciplinary Journal of Microbial Ecology, 5:169–172 (2011)

  • Chiral Histidine selection by D-ribose RNA. [] []
    M. Illangasekare, R. Turk, G. C. Peterson*, M. Lladser, M. Yarus. RNA Journal, 16: 2370-2383 (2010)

  • Natural and artificial RNAs occupy the same restricted region of sequence space. [] []
    R. Kennedy*, M. E. Lladser, Z. Wu, C. Zhang, M. Yarus, H. De Sterck, R. Knight. RNA Journal, 16(2): 280–289 (2010)

  • Comparison of methods for estimating the nucleotide substitution matrix. [] []
    M. Oscamou*, D. McDonald, V.-B. Yap, G. A. Huttley, M. E. Lladser, R. Knight. BMC Bioinformatics, 9:511 (2008)

  • Information, probability, and the abundance of the simplest RNA active sites. [] []
    R. Kenney*, M. E. Lladser, M. Yarus, R. Knight. Front Biosci. 13:6060-71 (2008)

Mathematics & Applied Mathematics Papers

  • Approximation of sojourn-times via maximal couplings: motif frequency distributions [] []
    M. E. Lladser, S. Chestnut*. J. Math. Biol. DOI 10.1007/s00285-013-0690-6 (2013)

  • Estimation of Distribution Overlap of Urn Models. [] []
    J. Hampton*, M. E. Lladser. PloS ONE, 7(11): e42368 (2012)

  • Random Cayley digraphs of diameter 2 and given degree. [ []
    M. E. Lladser, P. Potocnik, J. Širáň, M. C. Wilson. Discrete Mathematics and Theoretical Computer Science, 14:2, 83-90 (2012)

  • Toward the asymptotic count of bi-modular hidden patterns under probabilistic dynamical sources: a case study. [] []
    L. Lhothe, M. E. Lladser. Discrete Mathematics and Theoretical Computer Science Proceedings, AQ: 425-452 (2012)

  • Extrapolation of urn models via Poissonization: Accurate measurements of the microbial unknown. [] []
    M. E. Lladser, R. Gouet, J. Reeder. PloS ONE, 6(6): e21105 (2011)

  • Occupancy distributions in Markov chains via Doeblin's ergodicity coefficient. [] []
    S. Chestnut*, M. E. Lladser. Discrete Mathematics and Theoretical Computer Science Proceedings, AM:79-92 (2010)

  • Prediction of unseeing proportions in urn models with restricted sampling. [] []
    M. E. Lladser. Proceedings of the 2009 Analysis of Algorithms and Combinatorics workshop, pp. 85-91 (2009)

  • Multiple pattern matching: A Markov chain approach. [] []
    M. E. Lladser, M.D. Betterton, R. Knight. J Math Biol. 56(1-2):51-92 (2008)

  • Markovian embeddings of general random strings. [ []
    M. E. Lladser. Proceedings of the 2008 Analysis of Algorithms and Combinatorics workshop, pp. 183-190 (2008)

  • Semi-supervised learning of a Markovian metric. [] []
    A.S. Bijral*, M. E. Lladser, G. Grudic. 2008 SIAM Conference on Data Mining Conference, pp. 466-471 (2008)

  • Uniqueness of polynomial cannonical representations. [] []
    M. E. Lladser. 2007 Conference on Analysis of Algorithms, Discrete Mathematics and Theoretical Computer Science Proceedings, AH, 463-470 (2007)

  • Minimal Markov chain embeddings of pattern problems [] []
    M. E. Lladser. Proceedings of the 2007 Information Theory and Applications Workshop, University of California, San Diego (2007)

  • Mixed powers of generating functions. [] []
    M. E. Lladser. Discrete Mathematics and Theoretical Computer Science Proceedings, AG, 171-182 (2006)

  • Uniform formulae for coefficients of meromorphic functions in two variables. Part I. [] []
    M. E. Lladser. SIAM J. Discrete Math. 20, 811-828 (2006)

  • Domain of attraction of the quasi-stationary distributions of the Ornstein-Uhlenbeck process. [] []
    M. E. Lladser and J. San Martin. Journal of Applied Probability,  Vol. 37,  No. 2, 511-520 (2000)

Theses

  • Asymptotic enumeration via singularity analysis.
    M. E. Lladser. Ph.D. dissertation, The Ohio State University (2003)
    Graduate Advisor: Dr. Robin Pemantle

  • Dominio de atracción de las distribuciones quasi-estacionarias del processo del Ornstein-Uhlenbeck.
    M. E. Lladser. Thesis for the professional degree of Mathematical Civil Engineering, Universidad de Chile (1996)
    Undergraduate Advisor: Dr. Jaime San Martin

Former Student Theses

  • Dissimilarity and optimal sampling in urn models. [] []
    Jerrad Hampton, Ph.D. in Applied Mathematics, University of Colorado (2012)

  • Approximating Markov chain occupancy distributions. []
    Stephen Chestnut, M.S. in Applied Mathematics, University of Colorado (2010)

  • Fairness Analysis via Poissonization. []
    Geoffrey C.L. Peterson, M.S. in Applied Mathematics, University of Colorado (2010)

  • Calculating RNA motif probabilities and recognizing patterns in sequence data. []
    R. Kennedy, B.S. in Computer Science, University of Colorado (2009)

Conferences/Seminars/Workshops

  • Mathematics and Statistics Colloquium, Bowling Green State University, NOV/2012

  • 2012 RNA Workshop, Benasque, Spain, JUL-AUG/2012

  • 8th International Purdue Symposium on Statistics, Purdue, JUN/2012

  • 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, University of Montreal, Canada, JUN/2012

  • 2012 International Workshop on Applied Probability, Jerusalem, Israel, JUN/2012

  • 22th International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms, Bedlewo, Poland, JUN/2011

  • 22nd International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms, Bedlewo, Poland, JUN/2011 (speaker: J. Hampton)

  • 15th International Conference on Random Structures and Algorithms, Emory University, Atlanta, JUN/2011

  • Seminar of Stochastic Modeling, Center of Mathematical Modeling, Chile, JUN/2011

  • 2011 Frontier Probability Days, Salt Lake City, Utah, MAR/2011

  • Mathematics Colloquium, Iowa State University, MAR/2011

  • Statistics Seminar, Colorado State University, Fort Collins, FEB/2011

  • Science Short Presentation, CIMB meeting, DEC/2010

  • CIMBposium Poster Session, University of Colorado - Boulder, NOV/2010 (speaker: J. Hampton)

  • Bioinformatics Supergroup, University of Colorado - Boulder, OCT/2010

  • Combinatorics and Probability Seminar, Department of Mathematics, University of Pennsylvania, SEP/2010

  • 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms, Vienna, Austria, JUN/2010

  • Séminaire d'algorithmique, Département d'informatique, University of Caen, France, JUN/2010

  • Probability and Statistics Seminar, Department of Mathematics, University of Colorado - Boulder, APR/2010

  • SIAM's Graduate Chapter, University of Colorado - Boulder, MAR/2010 (speaker: S. Chestnut)

  • Combinatorics Seminar, Laboratoire Bordelais de Recherche en Informatique, Université Bordeaux 1, Bordeaux, France, FEB/2010

  • Butcher Symposium on Genomics and Biotechnology, University of Colorado, NOV/2009

  • Bioinformatics Supergroup, University of Colorado, NOV/2009 (speaker: G. C. Peterson)

  • 20th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms, Fréjus, France, JUN/2009

  • Fields-MITACS Summer School in Applied Probability, Department of Mathematics, University of Carleton, Canada, MAY/09 (speaker: A. Sen)

  • Fields-MITACS Summer School in Applied Probability, Department of Mathematics, University of Carleton, Canada, MAY/09 (speaker: J. Hampton)

  • Fields-MITACS Summer School in Applied Probability, Department of Mathematics, University of Carleton, Canada, MAY/09 (speaker: S. Chestnut)

  • Applied Mathematics Colloquium, University of Colorado, APR/2009

  • Department of Informatics, University of Caen, France, MAR/2009

  • 2009 Analysis of Algorithms and Combinatorics Workshop, New York, JAN/2009