@other{https://resolver.caltech.edu/CaltechAUTHORS:20220804-201308000,
    title = "Expert Graphs: Synthesizing New Expertise via Collaboration",
    year = "2022",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20220804-201308000",
    id = "record",
    doi = "10.48550/arXiv.2107.07054"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20200728-093329251,
    title = "Generator based approach to analyze mutations in genomic datasets",
    journal = "Scientific Reports",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200728-093329251",
    id = "record",
    issn = "2045-2322",
    doi = "10.1038/s41598-021-00609-8",
    volume = "11",
    pmcid = "PMC8548350"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20211007-150341511,
    title = "Glioblastoma signature in the DNA of blood-derived cells",
    journal = "PLoS ONE",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20211007-150341511",
    id = "record",
    issn = "1932-6203",
    doi = "10.1371/journal.pone.0256831",
    volume = "16",
    pmcid = "PMC8425531"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20211110-153150519,
    title = "2021 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Synthesizing New Expertise via Collaboration",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20211110-153150519",
    id = "record",
    isbn = "978-1-5386-8209-8",
    doi = "10.1109/isit45174.2021.9517822"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20210624-211933517,
    title = "Robust Correction of Sampling Bias Using Cumulative Distribution Functions",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20210624-211933517",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20210624-214158214,
    title = "Synthesizing New Expertise via Collaboration",
    year = "2021",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20210624-214158214",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200511-090541146,
    title = "2020 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Coding for Optimized Writing Rate in DNA Storage",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200511-090541146",
    id = "record",
    isbn = "978-1-7281-6432-8",
    doi = "10.1109/ISIT44484.2020.9174253"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200831-142053055,
    title = "2020 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "What is the Value of Data? on Mathematical Methods for Data Quality Estimation",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200831-142053055",
    id = "record",
    isbn = "9781728164328",
    doi = "10.1109/isit44484.2020.9174311"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20200427-091804171,
    title = "2020 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "CodNN – Robust Neural Networks From Coded Classification",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200427-091804171",
    id = "record",
    isbn = "978-1-7281-6432-8",
    doi = "10.1109/ISIT44484.2020.9174480"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20200511-120246633,
    title = "Coding for Optimized Writing Rate in DNA Storage",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200511-120246633",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20200427-091132325,
    title = "CodNN - Robust Neural Networks From Coded Classification",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200427-091132325",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20200423-125742527,
    title = "Cancer Classification from Blood-Derived DNA",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20200423-125742527",
    id = "record",
    doi = "10.1101/517839"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20201209-153308085,
    title = "2020 Information Theory and Applications Workshop (ITA)",
    chapter = "Improve Robustness of Deep Neural Networks by Coding",
    year = "2020",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20201209-153308085",
    id = "record",
    isbn = "9781728141909",
    doi = "10.1109/ita50056.2020.9244998"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190114-074334836,
    title = "Cancer Classification from Healthy DNA using Machine Learning",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190114-074334836",
    id = "record",
    doi = "10.1101/517839"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20190114-091231818,
    title = "Short Tandem Repeats Information in TCGA is Statistically Biased by Amplification",
    year = "2019",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20190114-091231818",
    id = "record",
    doi = "10.1101/518878"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20181126-143839274,
    title = "2018 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Attaining the 2nd Chargaff Rule by Tandem Duplications",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20181126-143839274",
    id = "record",
    isbn = "978-1-5386-4780-6",
    doi = "10.1109/ISIT.2018.8437526"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20180105-092230028,
    title = "Attaining the 2nd Chargaff Rule by Tandem Duplications",
    year = "2018",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20180105-092230028",
    id = "record"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170726-162754925,
    title = "Duplication Distance to the Root for Binary Sequences",
    journal = "IEEE Transactions on Information Theory",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170726-162754925",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2017.2730864",
    volume = "63"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170719-165632439,
    title = "Capacity and Expressiveness of Genomic Tandem Duplication",
    journal = "IEEE Transactions on Information Theory",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170719-165632439",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2017.2728079",
    volume = "63"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20170330-092251690,
    title = "Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms",
    journal = "IEEE Transactions on Information Theory",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170330-092251690",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2017.2688361",
    volume = "63"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20170816-165117076,
    title = "2017 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Noise and uncertainty in string-duplication systems",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170816-165117076",
    id = "record",
    isbn = "978-1-5090-4096-4",
    doi = "10.1109/ISIT.2017.8007104"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20170119-133807104,
    title = "Noise and Uncertainty in String-Duplication Systems",
    year = "2017",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20170119-133807104",
    id = "record"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20161108-134615672,
    title = "Duplication Distance to the Root for Binary Sequences",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20161108-134615672",
    id = "record"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160823-165024070,
    title = "2016 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160823-165024070",
    id = "record",
    isbn = "978-1-5090-1806-2",
    doi = "10.1109/ISIT.2016.7541455"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20160824-101618060,
    title = "2016 IEEE International Symposium on Information Theory (ISIT)",
    chapter = "On the duplication distance of binary strings",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160824-101618060",
    id = "record",
    isbn = "978-1-5090-1807-9",
    doi = "10.1109/ISIT.2016.7541301"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20160125-143414675,
    title = "Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms",
    year = "2016",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20160125-143414675",
    id = "record",
    doi = "10.1109/ISIT.2016.7541455"
}


@other{https://resolver.caltech.edu/CaltechAUTHORS:20150209-155348874,
    title = "Capacity and Expressiveness of Genomic Tandem Duplication",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150209-155348874",
    id = "record",
    doi = "10.48550/arXiv.1509.06029"
}


@article{https://resolver.caltech.edu/CaltechAUTHORS:20150202-091320508,
    title = "On Match Lengths, Zero Entropy, and Large Deviations—With Application to Sliding Window Lempel–Ziv Algorithm",
    journal = "IEEE Transactions on Information Theory",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20150202-091320508",
    id = "record",
    issn = "0018-9448",
    doi = "10.1109/TIT.2014.2368986",
    volume = "61"
}


@inbook{https://resolver.caltech.edu/CaltechAUTHORS:20151012-144840366,
    chapter = "Capacity and expressiveness of genomic tandem duplication",
    year = "2015",
    url = "https://resolver.caltech.edu/CaltechAUTHORS:20151012-144840366",
    id = "record",
    doi = "10.1109/ISIT.2015.7282795"
}