Abstract: In comparison to conventional sequencing pileup algorithms, the process described herein generates sequencing pileups that contains additional information not typically reported by conventional algorithms while also consuming fewer computational resources (e.g., time, processing power, and memory). First, each of a FASTA reference genome and BAM sequence read files are converted to an internal representation. This enables the rapid iteration across nucleotide bases of the sequence reads to determine support characteristics that summarize information of nucleic acid molecules corresponding to positions across the reference genome. Next, the support characteristics of positions across the reference genome are stored through a memory allocation process that utilizes a first and a second temporary storage. This enables the convenient freeing of one temporary storage while the other temporary storage is being used.