Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"University of Colorado" +contributor:("Manuel E. Lladser"). Showing records 1 – 4 of 4 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Colorado

1. Lavington, Jonathan Wilder. A Probabilistic Modeling Approach to CRISPR-Cas9.

Degree: MS, 2018, University of Colorado

  CRISPR-Cas, a particular type of microbial immune response system, has in recent years been modified to make precise changes to an organisms DNA. In… (more)

Subjects/Keywords: biological modeling; crispr; markov chains; probability theory; statistics; Applied Mathematics; Statistics and Probability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lavington, J. W. (2018). A Probabilistic Modeling Approach to CRISPR-Cas9. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/109

Chicago Manual of Style (16th Edition):

Lavington, Jonathan Wilder. “A Probabilistic Modeling Approach to CRISPR-Cas9.” 2018. Masters Thesis, University of Colorado. Accessed March 09, 2021. https://scholar.colorado.edu/appm_gradetds/109.

MLA Handbook (7th Edition):

Lavington, Jonathan Wilder. “A Probabilistic Modeling Approach to CRISPR-Cas9.” 2018. Web. 09 Mar 2021.

Vancouver:

Lavington JW. A Probabilistic Modeling Approach to CRISPR-Cas9. [Internet] [Masters thesis]. University of Colorado; 2018. [cited 2021 Mar 09]. Available from: https://scholar.colorado.edu/appm_gradetds/109.

Council of Science Editors:

Lavington JW. A Probabilistic Modeling Approach to CRISPR-Cas9. [Masters Thesis]. University of Colorado; 2018. Available from: https://scholar.colorado.edu/appm_gradetds/109


University of Colorado

2. Char, Ian Guo-fan. Algorithmic Construction and Stochastic Analysis of Optimal Automata for Generalized Strings.

Degree: MS, 2018, University of Colorado

  In many applications, the need arises to search a text for appearances of a given set of keywords. As an example, in bioinformatics one… (more)

Subjects/Keywords: aho-corasick automaton; biological motifs; deterministic finite automata; generalized strings; stochastic analysis; Applied Mathematics; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Char, I. G. (2018). Algorithmic Construction and Stochastic Analysis of Optimal Automata for Generalized Strings. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/115

Chicago Manual of Style (16th Edition):

Char, Ian Guo-fan. “Algorithmic Construction and Stochastic Analysis of Optimal Automata for Generalized Strings.” 2018. Masters Thesis, University of Colorado. Accessed March 09, 2021. https://scholar.colorado.edu/appm_gradetds/115.

MLA Handbook (7th Edition):

Char, Ian Guo-fan. “Algorithmic Construction and Stochastic Analysis of Optimal Automata for Generalized Strings.” 2018. Web. 09 Mar 2021.

Vancouver:

Char IG. Algorithmic Construction and Stochastic Analysis of Optimal Automata for Generalized Strings. [Internet] [Masters thesis]. University of Colorado; 2018. [cited 2021 Mar 09]. Available from: https://scholar.colorado.edu/appm_gradetds/115.

Council of Science Editors:

Char IG. Algorithmic Construction and Stochastic Analysis of Optimal Automata for Generalized Strings. [Masters Thesis]. University of Colorado; 2018. Available from: https://scholar.colorado.edu/appm_gradetds/115


University of Colorado

3. Hampton, Jerrad Davis. Dissimilarity and Optimal Sampling in Urn Ensembles.

Degree: PhD, Applied Mathematics, 2012, University of Colorado

  We study an ensemble of urns with unknown compositions inferred from initial samples with replacement from each urn. This model fits diverse situations. For… (more)

Subjects/Keywords: Alpha-Diversity; Coverage; Dissimilarity; Urn Models; Applied Mathematics; Statistics and Probability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hampton, J. D. (2012). Dissimilarity and Optimal Sampling in Urn Ensembles. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/27

Chicago Manual of Style (16th Edition):

Hampton, Jerrad Davis. “Dissimilarity and Optimal Sampling in Urn Ensembles.” 2012. Doctoral Dissertation, University of Colorado. Accessed March 09, 2021. https://scholar.colorado.edu/appm_gradetds/27.

MLA Handbook (7th Edition):

Hampton, Jerrad Davis. “Dissimilarity and Optimal Sampling in Urn Ensembles.” 2012. Web. 09 Mar 2021.

Vancouver:

Hampton JD. Dissimilarity and Optimal Sampling in Urn Ensembles. [Internet] [Doctoral dissertation]. University of Colorado; 2012. [cited 2021 Mar 09]. Available from: https://scholar.colorado.edu/appm_gradetds/27.

Council of Science Editors:

Hampton JD. Dissimilarity and Optimal Sampling in Urn Ensembles. [Doctoral Dissertation]. University of Colorado; 2012. Available from: https://scholar.colorado.edu/appm_gradetds/27


University of Colorado

4. Pieper, Jaden K. Unentangling Quantum Algorithms for Mathematicians and Engineers.

Degree: MS, Applied Mathematics, 2017, University of Colorado

  As industry continues to inspire considerable growth in the research and development of quantum computers, it is increasingly worthwhile to familiarize oneself with the… (more)

Subjects/Keywords: quantum computing; public interface; Grover's algorithm; Deutsch's algorithm; decoherence; Applied Mathematics; Computational Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pieper, J. K. (2017). Unentangling Quantum Algorithms for Mathematicians and Engineers. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/85

Chicago Manual of Style (16th Edition):

Pieper, Jaden K. “Unentangling Quantum Algorithms for Mathematicians and Engineers.” 2017. Masters Thesis, University of Colorado. Accessed March 09, 2021. https://scholar.colorado.edu/appm_gradetds/85.

MLA Handbook (7th Edition):

Pieper, Jaden K. “Unentangling Quantum Algorithms for Mathematicians and Engineers.” 2017. Web. 09 Mar 2021.

Vancouver:

Pieper JK. Unentangling Quantum Algorithms for Mathematicians and Engineers. [Internet] [Masters thesis]. University of Colorado; 2017. [cited 2021 Mar 09]. Available from: https://scholar.colorado.edu/appm_gradetds/85.

Council of Science Editors:

Pieper JK. Unentangling Quantum Algorithms for Mathematicians and Engineers. [Masters Thesis]. University of Colorado; 2017. Available from: https://scholar.colorado.edu/appm_gradetds/85

.