October 9 - 12, 2012
Building 10 & Natcher Conference Center
- General Schedule of Events
- Opening Plenary Session
- Concurrent Symposia Sessions
- Poster Sessions
- National Graduate Student Research Conference
- FARE Award Ceremony
- Special Exhibits on Resources for Intramural Research
- TSA Research Festival Exhibit Show
- Clinical Center Tours
- Research Festival Committees
- Past Research Festivals
Fast and accurate V(D)J partitioning for human immunoglobulin based on approximate dynamic algorithms for high throughput sequencing
| Friday, November 08, 2013 — Poster Session IV | |||
|---|---|---|---|
2:00 p.m. – 4:00 p.m. |
FAES Academic Center (Upper-Level Terrace) |
CIT |
IMMUNO-24 |
Authors
- DE Russ
- NS Longo
- K Ho
Abstract
Partitioning immunoglobulin (Ig) rearrangements into V, D, and J segments is a common step in many immunologically based analyses. Currently available algorithms were not designed to handle partitioning of more than 100,000 immunoglobulin sequences in a single batch file produced via high throughput sequencing. We introduce a novel algorithm that approximates a complete dynamic algorithm useful in V(D)J partitioning. The novel algorithm improves upon our previous JoinSolver algorithm by identifying the size and position of insertions and deletions in the immunoglobulin VDJ rearrangement. We present partitioning results on both human Ig and simulated sequences, which demonstrate greater accuracy and speed of analysis over our previous algorithm.
