HTJoinSolver: Human immunoglobulin VDJ partitioning using approximate dynamic programming constrained by conserved motifs

• Published in: BMC bioinformatics 2015-05, Vol.16 (1), p.170-170, Article 170
• Main Authors: Russ, Daniel E, Ho, Kwan-Yuet, Longo, Nancy S
• Format: Article
• Language: English
• Subjects: Algorithms; Base Sequence; Computational Biology - methods; Conserved Sequence; Gene Rearrangement; Humans; Immunoglobulin Joining Region - genetics; Immunoglobulin Variable Region - genetics; Immunoglobulins; Methodology; Molecular Sequence Data; Mutation - genetics; Physiological aspects; Software
• ISSN: 1471-2105; 1471-2105
• DOI: 10.1186/s12859-015-0589-x

Partitioning the human immunoglobulin variable region into variable (V), diversity (D), and joining (J) segments is a common sequence analysis step. We introduce a novel approximate dynamic programming method that uses conserved immunoglobulin gene motifs to improve performance of aligning V-segments of rearranged immunoglobulin (Ig) genes. Our new algorithm enhances the former JOINSOLVER algorithm by processing sequences with insertions and/or deletions (indels) and improves the efficiency for large datasets provided by high throughput sequencing. In our simulations, which include rearrangements with indels, the V-matching success rate improved from 61% for partial alignments of sequences with indels in the original algorithm to over 99% in the approximate algorithm. An improvement in the alignment of human VDJ rearrangements over the initial JOINSOLVER algorithm was also seen when compared to the Stanford.S22 human Ig dataset with an online VDJ partitioning software evaluation tool. HTJoinSolver can rapidly identify V- and J-segments with indels to high accuracy for mutated sequences when the mutation probability is around 30% and 20% respectively. The D-segment is much harder to fit even at 20% mutation probability. For all segments, the probability of correctly matching V, D, and J increases with our alignment score.