<h1>Jain, Siddharth</h1>
<h2>Combined from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2>
<ul>
<li>Jain, Siddharth and Xiao, Xiongye, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200728-093329251">Generator based approach to analyze mutations in genomic datasets</a>; Scientific Reports; Vol. 11; Art. No. 21084; PMCID PMC8548350; <a href="https://doi.org/10.1038/s41598-021-00609-8">10.1038/s41598-021-00609-8</a></li>
<li>Jain, Siddharth and Mazaheri, Bijan, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211007-150341511">Glioblastoma signature in the DNA of blood-derived cells</a>; PLoS ONE; Vol. 16; No. 9; Art. No. e0256831; PMCID PMC8425531; <a href="https://doi.org/10.1371/journal.pone.0256831">10.1371/journal.pone.0256831</a></li>
<li>Mazaheri, Bijan and Jain, Siddharth, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220804-201308000">Expert Graphs: Synthesizing New Expertise via Collaboration</a>; <a href="https://doi.org/10.48550/arXiv.2107.07054">10.48550/arXiv.2107.07054</a></li>
<li>Mazaheri, Bijan and Jain, Siddharth, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20211110-153150519">Synthesizing New Expertise via Collaboration</a>; ISBN 978-1-5386-8209-8; 2021 IEEE International Symposium on Information Theory (ISIT); 2447-2452; <a href="https://doi.org/10.1109/isit45174.2021.9517822">10.1109/isit45174.2021.9517822</a></li>
<li>Mazaheri, Bijan and Jain, Siddharth, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210624-214158214">Synthesizing New Expertise via Collaboration</a></li>
<li>Mazaheri, Bijan and Jain, Siddharth, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210624-211933517">Robust Correction of Sampling Bias Using Cumulative Distribution Functions</a></li>
<li>Raviv, Netanel and Jain, Siddharth, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200427-091804171">CodNN – Robust Neural Networks From Coded Classification</a>; ISBN 978-1-7281-6432-8; 2020 IEEE International Symposium on Information Theory (ISIT); 2688-2693; <a href="https://doi.org/10.1109/ISIT44484.2020.9174480">10.1109/ISIT44484.2020.9174480</a></li>
<li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200511-090541146">Coding for Optimized Writing Rate in DNA Storage</a>; ISBN 978-1-7281-6432-8; 2020 IEEE International Symposium on Information Theory (ISIT); 711-716; <a href="https://doi.org/10.1109/ISIT44484.2020.9174253">10.1109/ISIT44484.2020.9174253</a></li>
<li>Raviv, Netanel and Jain, Siddharth, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200831-142053055">What is the Value of Data? on Mathematical Methods for Data Quality Estimation</a>; ISBN 9781728164328; 2020 IEEE International Symposium on Information Theory (ISIT); 2825-2830; <a href="https://doi.org/10.1109/isit44484.2020.9174311">10.1109/isit44484.2020.9174311</a></li>
<li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200511-120246633">Coding for Optimized Writing Rate in DNA Storage</a></li>
<li>Jain, Siddharth and Mazaheri, Bijan, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200423-125742527">Cancer Classification from Blood-Derived DNA</a>; <a href="https://doi.org/10.1101/517839">10.1101/517839</a></li>
<li>Raviv, Netanel and Jain, Siddharth, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20200427-091132325">CodNN - Robust Neural Networks From Coded Classification</a></li>
<li>Huang, Kunping and Raviv, Netanel, el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201209-153308085">Improve Robustness of Deep Neural Networks by Coding</a>; ISBN 9781728141909; 2020 Information Theory and Applications Workshop (ITA); 1-7; <a href="https://doi.org/10.1109/ita50056.2020.9244998">10.1109/ita50056.2020.9244998</a></li>
<li>Jain, Siddharth and Mazaheri, Bijan, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190114-091231818">Short Tandem Repeats Information in TCGA is Statistically Biased by Amplification</a>; <a href="https://doi.org/10.1101/518878">10.1101/518878</a></li>
<li>Jain, Siddharth and Mazaheri, Bijan, el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20190114-074334836">Cancer Classification from Healthy DNA using Machine Learning</a>; <a href="https://doi.org/10.1101/517839">10.1101/517839</a></li>
<li>Jain, Siddharth and Raviv, Netanel, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20181126-143839274">Attaining the 2nd Chargaff Rule by Tandem Duplications</a>; ISBN 978-1-5386-4780-6; 2018 IEEE International Symposium on Information Theory (ISIT); 2241-2245; <a href="https://doi.org/10.1109/ISIT.2018.8437526">10.1109/ISIT.2018.8437526</a></li>
<li>Jain, Siddharth and Raviv, Netanel, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180105-092230028">Attaining the 2nd Chargaff Rule by Tandem Duplications</a></li>
<li>Alon, Noga and Bruck, Jehoshua, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170726-162754925">Duplication Distance to the Root for Binary Sequences</a>; IEEE Transactions on Information Theory; Vol. 63; No. 12; 7793-7803; <a href="https://doi.org/10.1109/TIT.2017.2730864">10.1109/TIT.2017.2730864</a></li>
<li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170719-165632439">Capacity and Expressiveness of Genomic Tandem Duplication</a>; IEEE Transactions on Information Theory; Vol. 63; No. 10; 6129-6138; <a href="https://doi.org/10.1109/TIT.2017.2728079">10.1109/TIT.2017.2728079</a></li>
<li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170330-092251690">Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms</a>; IEEE Transactions on Information Theory; Vol. 63; No. 8; 4996-5010; <a href="https://doi.org/10.1109/TIT.2017.2688361">10.1109/TIT.2017.2688361</a></li>
<li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170816-165117076">Noise and uncertainty in string-duplication systems</a>; ISBN 978-1-5090-4096-4; 2017 IEEE International Symposium on Information Theory (ISIT); 3120-3124; <a href="https://doi.org/10.1109/ISIT.2017.8007104">10.1109/ISIT.2017.8007104</a></li>
<li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170119-133807104">Noise and Uncertainty in String-Duplication Systems</a></li>
<li>Alon, Noga and Bruck, Jehoshua, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20161108-134615672">Duplication Distance to the Root for Binary Sequences</a></li>
<li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160823-165024070">Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms</a>; ISBN 978-1-5090-1806-2; 2016 IEEE International Symposium on Information Theory (ISIT); <a href="https://doi.org/10.1109/ISIT.2016.7541455">10.1109/ISIT.2016.7541455</a></li>
<li>Alon, Noga and Bruck, Jehoshua, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160824-101618060">On the duplication distance of binary strings</a>; ISBN 978-1-5090-1807-9; 2016 IEEE International Symposium on Information Theory (ISIT); 260-264; <a href="https://doi.org/10.1109/ISIT.2016.7541301">10.1109/ISIT.2016.7541301</a></li>
<li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2016) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20160125-143414675">Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms</a>; <a href="https://doi.org/10.1109/ISIT.2016.7541455">10.1109/ISIT.2016.7541455</a></li>
<li>Jain, Siddharth and Bansal, Rakesh K. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150202-091320508">On Match Lengths, Zero Entropy, and Large Deviations—With Application to Sliding Window Lempel–Ziv Algorithm</a>; IEEE Transactions on Information Theory; Vol. 61; No. 1; 120-132; <a href="https://doi.org/10.1109/TIT.2014.2368986">10.1109/TIT.2014.2368986</a></li>
<li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20150209-155348874">Capacity and Expressiveness of Genomic Tandem Duplication</a>; <a href="https://doi.org/10.48550/arXiv.1509.06029">10.48550/arXiv.1509.06029</a></li>
<li>Jain, Siddharth and Farnoud (Hassanzadeh), Farzad, el al. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20151012-144840366">Capacity and expressiveness of genomic tandem duplication</a>; <a href="https://doi.org/10.1109/ISIT.2015.7282795">10.1109/ISIT.2015.7282795</a></li>
</ul>