Axe: rapid, competitive sequence read demultiplexing using a trie

Abstract Summary We describe a rapid algorithm for demultiplexing DNA sequence reads with in-read indices. Axe selects the optimal index present in a sequence read, even in the presence of sequencing errors. The algorithm is able to handle combinatorial indexing, indices of differing length and seve...

Full description

Saved in:
Bibliographic Details
Published in:Bioinformatics 2018-11, Vol.34 (22), p.3924-3925
Main Authors: Murray, Kevin D, Borevitz, Justin O
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Abstract Summary We describe a rapid algorithm for demultiplexing DNA sequence reads with in-read indices. Axe selects the optimal index present in a sequence read, even in the presence of sequencing errors. The algorithm is able to handle combinatorial indexing, indices of differing length and several mismatches per index sequence. Availability and implementation Axe is implemented in C, and is used as a command-line program on Unix-like systems. Axe is available online at https://github.com/kdmurray91/axe, and is available in Debian/Ubuntu distributions of GNU/Linux as the package axe-demultiplexer. Supplementary information Supplementary data are available at Bioinformatics online
ISSN:1367-4803
1460-2059
1367-4811
DOI:10.1093/bioinformatics/bty432