Kavya Vaddadi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kavya Vaddadi has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Ben Langmead
Department of Computer Science, Johns Hopkins University, Baltimore, MD, USA
4 shared publications - Taher Mun
Johns Hopkins University
4 shared publications - Kshitij Tayal
TCS Research
1 shared publication - Mao-Jan Lin
Department of Computer Science, Johns Hopkins University
1 shared publication - Naveen Sivadasan
TCS Innovation Labs Hyderabad India
1 shared publication P. Krishna Reddy
Kohli Center on Intelligent Systems (KCIS) IIIT Hyderabad
1 shared publication
Latest Publications
- Open Access
- 5 March 2026
- Published by Cold Spring Harbor Laboratory in Genome Research
- Vol. 36 (4) , 740-753
Minimizing reference bias with an imputed personalized reference
Pangenome indexes reduce reference bias in sequencing data analysis. However, bias can be reduced further by using a personalized reference, for example, a diploid human reference constructed to match a donor individual's alleles. Here, we present a new impute-first alignment framework that combines elements of genotype imputation and read alignment. We first genotype the individual using a subsample of the input reads. Using a reference panel and an efficient imputation algorithm, we impute a personalized diploid reference. Finally, we index the personalized reference and apply a read aligner (either linear or graph) to align the full read set to the personalized reference. On the HG002 sample, this framework achieves a higher variant-calling F1-score (99.77%) compared with the traditional linear aligner (99.62%), graph pangenome aligner (99.72%), and graph personalized-pangenome aligner (99.75%), with substantial reduction in the number of errors (38.73% vs. a linear aligner, 14.97% vs. a graph aligner, and 6.05% vs. a personalized graph). An imputed reference can have comparable efficiency to a pangenome reference, making it an overall advantageous choice for whole-genome DNA sequencing experiments. Advantages of our impute-first approach include that (1) it fully considers linkage disequilibrium and produces a phased diploid reference as an output; (2) it produces accurate personalized references even from low-coverage data; and (3) it is compatible with both graph and linear reference representations, achieving its highest variant-calling F1 accuracy using a standard linear aligner (BWA-MEM).
- 5 March 2026
- Published by Cold Spring Harbor Laboratory in Genome Research
- Vol. 36 (4) , 740-753
Open AccessMinimizing reference bias with an imputed personalized reference
Pangenome indexes reduce reference bias in sequencing data analysis. However, bias can be reduced further by using a personalized reference, for example, a diploid human reference constructed to match a donor individual's alleles. Here, we present a new impute-first alignment framework that combines elements of genotype imputation and read alignment. We first genotype the individual using a subsample of the input reads. Using a reference panel and an efficient imputation algorithm, we impute a personalized diploid reference. Finally, we index the personalized reference and apply a read aligner (either linear or graph) to align the full read set to the personalized reference. On the HG002 sample, this framework achieves a higher variant-calling F1-score (99.77%) compared with the traditional linear aligner (99.62%), graph pangenome aligner (99.72%), and graph personalized-pangenome aligner (99.75%), with substantial reduction in the number of errors (38.73% vs. a linear aligner, 14.97% vs. a graph aligner, and 6.05% vs. a personalized graph). An imputed reference can have comparable efficiency to a pangenome reference, making it an overall advantageous choice for whole-genome DNA sequencing experiments. Advantages of our impute-first approach include that (1) it fully considers linkage disequilibrium and produces a phased diploid reference as an output; (2) it produces accurate personalized references even from low-coverage data; and (3) it is compatible with both graph and linear reference representations, achieving its highest variant-calling F1 accuracy using a standard linear aligner (BWA-MEM).
- Open Access
Minimizing Reference Bias with an Impute-First Approach
Pangenome indexes reduce reference bias in sequencing data analysis. However, bias can be reduced further by using a personalized reference, e.g. a diploid human reference constructed to match a donor individual’s alleles. We present a novel impute-first alignment framework that combines elements of genotype imputation and pangenome alignment. It begins by genotyping the individual using only a subsample of the input reads. It next uses a reference panel and efficient imputation algorithm to impute a personalized diploid reference. Finally, it indexes the personalized reference and applies a read aligner, which could be a linear or graph aligner, to align the full read set to the personalized reference. This framework achieves higher variant-calling recall (99.54% vs. 99.37%), precision (99.36% vs. 99.18%), and F1 (99.45% vs. 99.28%) compared to a graph pangenome aligner. The personalized reference is also smaller and faster to query compared to a pangenome index, making it an overall advantageous choice for whole-genome DNA sequencing experiments.
Open AccessMinimizing Reference Bias with an Impute-First Approach
Pangenome indexes reduce reference bias in sequencing data analysis. However, bias can be reduced further by using a personalized reference, e.g. a diploid human reference constructed to match a donor individual’s alleles. We present a novel impute-first alignment framework that combines elements of genotype imputation and pangenome alignment. It begins by genotyping the individual using only a subsample of the input reads. It next uses a reference panel and efficient imputation algorithm to impute a personalized diploid reference. Finally, it indexes the personalized reference and applies a read aligner, which could be a linear or graph aligner, to align the full read set to the personalized reference. This framework achieves higher variant-calling recall (99.54% vs. 99.37%), precision (99.36% vs. 99.18%), and F1 (99.45% vs. 99.28%) compared to a graph pangenome aligner. The personalized reference is also smaller and faster to query compared to a pangenome index, making it an overall advantageous choice for whole-genome DNA sequencing experiments.
- Open Access
- 3 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 1
Minimizing Reference Bias: The Impute-First Approach for Personalized Genome Analysis
We introduce the Impute-first alignment framework that reduces reference bias in genomics by integrating genotype imputation with pangenome alignment. Beginning with genotyping and genotype imputation using a portion of the input data, a personalized diploid reference genome is created. This personalized reference genome is then used for read alignment, enhancing downstream results such as variant calls. Our approach outperforms the traditional graph-based pangenome references in variant-calling measures, exhibiting improved sensitivity, precision, and overall accuracy, as demonstrated using the HG001 sample. The Impute-first framework successfully merges the benefits of traditional reference-based methods and pangenome strategies, reducing reference bias while maintaining a low computational cost.
- 3 September 2023
- Published by Association for Computing Machinery (ACM)
- p. 1
Open AccessMinimizing Reference Bias: The Impute-First Approach for Personalized Genome Analysis
We introduce the Impute-first alignment framework that reduces reference bias in genomics by integrating genotype imputation with pangenome alignment. Beginning with genotyping and genotype imputation using a portion of the input data, a personalized diploid reference genome is created. This personalized reference genome is then used for read alignment, enhancing downstream results such as variant calls. Our approach outperforms the traditional graph-based pangenome references in variant-calling measures, exhibiting improved sensitivity, precision, and overall accuracy, as demonstrated using the HG001 sample. The Impute-first framework successfully merges the benefits of traditional reference-based methods and pangenome strategies, reducing reference bias while maintaining a low computational cost.
- Open Access
- 5 May 2023
- Published by Springer Nature in Algorithms for Molecular Biology
- Vol. 18 (1) , 1-17
Pangenomic genotyping with the marker array
We present a new method and software tool called that applies a pangenome index to the problem of inferring genotypes from short-read sequencing data. The method uses a novel indexing structure called the marker array. Using the marker array, we can genotype variants with respect from large panels like the 1000 Genomes Project while reducing the reference bias that results when aligning to a single linear reference. can infer accurate genotypes in less time and memory compared to existing graph-based methods. The method is implemented in the open source software tool available at https://github.com/alshai/rowbowt.
- 5 May 2023
- Published by Springer Nature in Algorithms for Molecular Biology
- Vol. 18 (1) , 1-17
Open AccessPangenomic genotyping with the marker array
We present a new method and software tool called that applies a pangenome index to the problem of inferring genotypes from short-read sequencing data. The method uses a novel indexing structure called the marker array. Using the marker array, we can genotype variants with respect from large panels like the 1000 Genomes Project while reducing the reference bias that results when aligning to a single linear reference. can infer accurate genotypes in less time and memory compared to existing graph-based methods. The method is implemented in the open source software tool available at https://github.com/alshai/rowbowt.
- Open Access
Sequence Alignment on Directed Graphs
Genomic variations in a reference collection are naturally represented as genome variation graphs. Such graphs encode common subsequences as vertices and the variations are captured using additional vertices and directed edges. The resulting graphs are directed graphs possibly with cycles. Existing algorithms for aligning sequences on such graphs make use of partial order alignment (POA) techniques that work on directed acyclic graphs (DAG). For this, acyclic extensions of the input graphs are first constructed through expensive loop unrolling steps (DAGification). Also, such graph extensions could have considerable blow up in their size and in the worst case the blow up factor is proportional to the input sequence length. We provide a novel alignment algorithm V-ALIGN that aligns the input sequence directly on the input graph while avoiding such expensive DAGification steps. V-ALIGN is based on a novel dynamic programming formulation that allows gapped alignment directly on the input graph. It supports affine and linear gaps. We also propose refinements to V-ALIGN for better performance in practice. In this, the time to fill the DP table has linear dependence on the sizes of the sequence, the graph and its feedback vertex set. We perform experiments to compare against the POA based alignment. For aligning short sequences, standard approaches restrict the expensive gapped alignment to small filtered subgraphs having high ‘similarity’ to the input sequence. In such cases, the performance of V-ALIGN for gapped alignment on the filtered subgraph depends on the subgraph sizes.
Open AccessSequence Alignment on Directed Graphs
Genomic variations in a reference collection are naturally represented as genome variation graphs. Such graphs encode common subsequences as vertices and the variations are captured using additional vertices and directed edges. The resulting graphs are directed graphs possibly with cycles. Existing algorithms for aligning sequences on such graphs make use of partial order alignment (POA) techniques that work on directed acyclic graphs (DAG). For this, acyclic extensions of the input graphs are first constructed through expensive loop unrolling steps (DAGification). Also, such graph extensions could have considerable blow up in their size and in the worst case the blow up factor is proportional to the input sequence length. We provide a novel alignment algorithm V-ALIGN that aligns the input sequence directly on the input graph while avoiding such expensive DAGification steps. V-ALIGN is based on a novel dynamic programming formulation that allows gapped alignment directly on the input graph. It supports affine and linear gaps. We also propose refinements to V-ALIGN for better performance in practice. In this, the time to fill the DP table has linear dependence on the sizes of the sequence, the graph and its feedback vertex set. We perform experiments to compare against the POA based alignment. For aligning short sequences, standard approaches restrict the expensive gapped alignment to small filtered subgraphs having high ‘similarity’ to the input sequence. In such cases, the performance of V-ALIGN for gapped alignment on the filtered subgraph depends on the subgraph sizes.
- 25 May 2016
- Published by Springer Nature
- p. 152-169
Coverage Patterns-Based Approach to Allocate Advertisement Slots for Display Advertising
- 25 May 2016
- Published by Springer Nature
- p. 152-169
Coverage Patterns-Based Approach to Allocate Advertisement Slots for Display Advertising