Education & Certifications

  • MS, Stanford University, Electrical Engineering (2018)
  • B.Tech., Indian Institute of Technology Bombay, Electrical Engineering (2016)

Stanford Advisors

Contact

  • Academic
    schandak@stanford.edu
    University - Student Department: Electrical Engineering Position: Graduate

Additional Info

  • Mail Code: 9505

Links

Current Research and Scholarly Interests

Information Theory, Genomic data compression, DNA storage

All Publications

  • SPRING: a next-generation compressor for FASTQ data BIOINFORMATICS Chandak, S., Tatwawadi, K., Ochoa, I., Hernaez, M., Weissman, T. 2019; 35 (15): 2674–76

    View details for DOI 10.1093/bioinformatics/bty1015

    View details for Web of Science ID 000484378200023

  • Humans are still the best lossy image compressors Bhown, A., Mukherjee, S., Yang, S., Chandak, S., Fischer-Hwang, I., Tatwawadi, K., Weissman, T., IEEE IEEE. 2019: 558

    View details for DOI 10.1109/DCC.2019.00070

    View details for Web of Science ID 000470908200063

  • DeepZip: Lossless Data Compression using Recurrent Neural Networks Goyal, M., Tatwawadi, K., Chandak, S., Ochoa, I., IEEE IEEE. 2019: 575

    View details for DOI 10.1109/DCC.2019.00087

    View details for Web of Science ID 000470908200080

  • Compression of genomic sequencing reads via hash-based reordering: algorithm and analysis BIOINFORMATICS Chandak, S., Tatwawadi, K., Weissman, T. 2018; 34 (4): 558–67

    Abstract

    New Generation Sequencing (NGS) technologies for genome sequencing produce large amounts of short genomic reads per experiment, which are highly redundant and compressible. However, general-purpose compressors are unable to exploit this redundancy due to the special structure present in the data.We present a new algorithm for compressing reads both with and without preserving the read order. In both cases, it achieves 1.4×-2× compression gain over state-of-the-art read compression tools for datasets containing as many as 3 billion Illumina reads. Our tool is based on the idea of approximately reordering the reads according to their position in the genome using hashed substring indices. We also present a systematic analysis of the read compression problem and compute bounds on fundamental limits of read compression. This analysis sheds light on the dynamics of the proposed algorithm (and read compression algorithms in general) and helps understand its performance in practice. The algorithm compresses only the read sequence, works with unaligned FASTQ files, and does not require a reference.schandak@stanford.edu.Supplementary material are available at Bioinformatics online. The proposed algorithm is available for download at https://github.com/shubhamchandak94/HARC.

    View details for PubMedID 29444237

    View details for PubMedCentralID PMC5860611

  • An Actively Detuned Wireless Power Receiver With Public Key Cryptographic Authentication and Dynamic Power Allocation Desai, N., Juvekar, C., Chandak, S., Chandrakasan, A. P. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2018: 236–46

    View details for DOI 10.1109/JSSC.2017.2737562

    View details for Web of Science ID 000418873800021

  • An Actively Detuned Wireless Power Receiver with Public Key Cryptographic Authentication and Dynamic Power Allocation Desai, N. V., Juvekar, C., Chandak, S., Chandrakasan, A. P., IEEE IEEE. 2017: 366

    View details for Web of Science ID 000403393800153