Analysis of Poly(A) Site Choice Using a Java-Based Clustering Algorithm
Modern high-throughput DNA sequencing has the potential to generate large volumes of data for analysis by investigators—including poly(A) site data. Here I describe a computational method to compare poly(A) site choice differences between two large data sets based on the relative abundance and position of tags within each reference sequence to which they are aligned. This method provides rapid quantification and visualization of differences and similarities in poly(A) site choice between the two datasets.
Key wordsAlternative polyadenylation Java Next generation sequencing PAT-seq
This work was supported by the National Science Foundation (award MCB-0313472 to Drs. Arthur G. Hunt and Q. Quinn Li, and an RET supplement to award IOS-0817818).