Difference between revisions of "Team:Austin UTexas/Failure Analysis"
| Line 2: | Line 2: | ||
=== FRI Failure Analysis === | === FRI Failure Analysis === | ||
| + | |||
| + | [[Image:2015_UT_AUSTIN_fri_failure_diagram.jpg|900px|thumb|center| Diagram of FRI-Failure Analysis work flow. Dashed boxes represent collections of files.]] | ||
FRI-Failure Analysis is a computational pipeline that identifies mutations that occur in bacterial plasmids. Each sample read, generated by Sanger sequencing, is aligned to its ancestor strain (template). By identifying homology between samples and mobile elements, the pipeline is able to correctly identify a host of mutations while minimizing false positives. The program streamlines the process of mutation analysis and offers large efficiency gains over human analysis. | FRI-Failure Analysis is a computational pipeline that identifies mutations that occur in bacterial plasmids. Each sample read, generated by Sanger sequencing, is aligned to its ancestor strain (template). By identifying homology between samples and mobile elements, the pipeline is able to correctly identify a host of mutations while minimizing false positives. The program streamlines the process of mutation analysis and offers large efficiency gains over human analysis. | ||
Revision as of 21:46, 18 September 2015
FRI Failure Analysis
FRI-Failure Analysis is a computational pipeline that identifies mutations that occur in bacterial plasmids. Each sample read, generated by Sanger sequencing, is aligned to its ancestor strain (template). By identifying homology between samples and mobile elements, the pipeline is able to correctly identify a host of mutations while minimizing false positives. The program streamlines the process of mutation analysis and offers large efficiency gains over human analysis.
The program is divided into phases. The initial phase creates FASTA template files that will be used to create alignments. These each contain two sequences, either a template and a sample, or a sample and a mobile element. The next phase employs the MAFFT program to perform fast pairwise alignments between each sequence. The final phase consists of two steps; first, determine if a sample exhibits homology to a mobile element; then, identify mutations in the sample using this information. These mutations are stored in the Genomediff filetype, which you can read about [http://barricklab.org/twiki/pub/Lab/ToolsBacterialGenomeResequencing/documentation/gd_format.html here.]
Gdparse
Gdparse is a tool designed to process Genomediff files by counting up mutations and categorizing them. Since the terminal output of FRI-Failure is in this format, the program works well as a post-processing step in our FRI-Failure experiment. The program currently outputs a CSV file that tabulates mutations based on where they occur in the reference sequence. Combined with FRI-Failure Analysis, this program offers further efficiency gains over hand counting of mutations.
Gdparse works by creating dictionaries that map a category (in this case, a BioBrick name) onto other dictionaries that are organized by the type of mutation, the location of the mutation on the reference sequence, or both. Since reference sequences are stored along with each mutation in a Genomediff file, Gdparse simply finds the reference sequence in a separate folder and determines what annotation contains the given mutation.