M
Manuel E. Lladser
Researcher at University of Colorado Boulder
Publications - 51
Citations - 2672
Manuel E. Lladser is an academic researcher from University of Colorado Boulder. The author has contributed to research in topics: Markov chain & Metric dimension. The author has an hindex of 14, co-authored 48 publications receiving 2165 citations. Previous affiliations of Manuel E. Lladser include Ohio State University.
Papers
More filters
Journal ArticleDOI
UniFrac: an effective distance metric for microbial community comparison
TL;DR: It is confirmed with actual sequence data that UniFrac values can be influenced by the number of sequences/sample, and sequence jackknifing is recommended to avoid this issue.
Journal ArticleDOI
Balance Trees Reveal Microbial Niche Differentiation
James T. Morton,Jon G. Sanders,Robert A. Quinn,Daniel McDonald,Antonio Gonzalez,Yoshiki Vázquez-Baeza,Jose A. Navas-Molina,Se Jin Song,Jessica L. Metcalf,Embriette R. Hyde,Manuel E. Lladser,Pieter C. Dorrestein,Rob Knight +12 more
TL;DR: It is shown that balances can yield insights about niche differentiation across multiple microbial environments, including soil environments and lung sputum, and have the potential to reshape how future ecological analyses aimed at revealing differences in relative taxonomic abundances across different samples are carried out.
Journal ArticleDOI
Multiple pattern matching: A Markov chain approach
TL;DR: In this paper, the concept of Markov chain embedding is used to analyze patterns in random strings produced by a memoryless source, together with the capability of automata to recognize complicated patterns, allows a systematic analysis of problems related to the occurrence and frequency of patterns.
Journal ArticleDOI
Domain of attraction of the quasi-stationary distributions for the Ornstein-Uhlenbeck process
TL;DR: In this paper, the existence of a probability measure v with a Lebesgue density, depending on η, such that for every A E B(R + ): formula math is proved.
BookDOI
Algorithmic Probability and Combinatorics
TL;DR: In this paper, the enumeration of plane lattice walks with steps in S, that start from (0, 0) and remain in the first quadrant {(i, j) : i 0, j 0}.