Invited Talks

  1. Duplication-Correcting Codes for Data Storage in DNA of Living Organisms [Slides]
    Allerton Conf. on Communications Control and Computing, Allerton Retreat Center, Monticello, IL, Sep. 2016.

  2. Estimation of Mutation Rates in DNA Tandem Repeat Regions [Video]
    University of Virginia, Charlottesville, VA, Sep. 9, 2016.

  3. Stochastic and Information-theoretic Approaches to Analysis of Biological Data
    University of Virginia, Charlottesville, VA, May 6, 2016,
    University of Hawaii at Manoa, Honolulu, HI, Apr. 2016,
    University of Michigan, Ann Arbor, MI, Mar. 2016,
    University of Southern California, Los Angeles, CA, Mar. 2016,
    Arizona State University, Tempe, AZ, Mar. 2016.

  4. On Estimation of DNA Repeat Mutation Rates
    Information Theory and Applications Workshop (ITA), San Diego, CA, Feb. 2016.

  5. Stochastic Models for DNA Tandem Duplication [Slides]
    Molecular Programming Project Workshop, University of Washington, WA, Jan. 2016.

  6. Diversity of biologically-inspired duplication systems
    Information Theory and Applications Workshop (ITA), San Diego, CA, Feb. 2015.

  7. Biological Diversity through Duplication: Combinatorial and Stochastic Models
    Harvard University, MA, Jan. 2015,
    University of Houston, TX, Jan. 2015.

  8. Biological Diversity through Duplication [Slides]
    Molecular Programming Project Workshop, San Francisco, CA, Jan. 2015.

  9. On the Capacity of String-Duplication Systems and Genomic Duplication [Slides]
    Asilomar Conf. on Signals, Systems, and Computers, Asilomar Conference Grounds, Pacific Grove, CA, Nov. 2014.

  10. Approximate Sorting for Streams and Preference Rankings with Limited Storage [Slides]
    Allerton Conf. on Communications Control and Computing, Allerton Retreat Center, Monticello, IL, Oct. 2014.

  11. Sorting Big Data with Small Memory [Slides]
    Information Theory and Applications Workshop (ITA), San Diego, CA, Feb. 2014.

  12. Approximate Sorting of Data Streams with Limited Storage [Slides]
    Conf. in Information Sciences and Systems (CISS), Princeton University, NJ, Mar. 2014,
    Comm Seminars, CSL, University of Illinois at Urbana-Champaign, IL, May 2014.

  13. Fewer Axioms for a More Flexible Distance between Rankings [Slides]
    NIPS Workshop on Social Choice: Theory and Practice, Lake Tahoe, NV, Dec. 2012.

  14. A Constrained Distance-based Approach to Social Choice [Slides]
    Psychology Department, University of Illinois at Urbana-Champaign, IL, Nov. 2012.

  15. Rank Modulation Codes for Translocation Errors [Slides]
    Caltech, CA, Apr. 2012,
    UCLA, CA, Apr. 2012.

  16. A Novel Distance Measure for Rank Aggregation
    CommNetS Seminars, USC, CA, Apr. 2012

  17. Novel Measures for Rank Aggregation [Slides]
    Information Theory and Applications Workshop (ITA), San Diego, CA, Feb. 2012.

  18. Sorting of Permutations by Cost-Constrained Transposition [Slides]
    AFOSR Complex Networks Review, Arlington, VA, Dec. 2010.