Axe: rapid, competitive sequence read demultiplexing using a trie
Open Access
- 1 June 2018
- journal article
- research article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 34 (22) , 3924-3925
Abstract
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. 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 data are available at Bioinformatics onlineKeywords
All Related Versions
Funding Information
- Australian Research Council Centre of Excellence in Plant Energy Biology (CE140100008)
- National Computational Infrastructure (NCI)
- Australian Government
- Australian Government Research Training Program
- RTP
This publication has 7 references indexed in Scilit:
- AdapterRemoval v2: rapid adapter trimming, identification, and read mergingBMC Research Notes, 2016
- deML: robust demultiplexing of Illumina sequences using a likelihood-based approachBioinformatics, 2014
- FLEXBAR—Flexible Barcode and Adapter Processing for Next-Generation Sequencing PlatformsBiology, 2012
- Double Digest RADseq: An Inexpensive Method for De Novo SNP Discovery and Genotyping in Model and Non-Model SpeciesPLOS ONE, 2012
- Counting absolute numbers of molecules using unique molecular identifiersNature Methods, 2011
- A Robust, Simple Genotyping-by-Sequencing (GBS) Approach for High Diversity SpeciesPLOS ONE, 2011
- Error Detecting and Error Correcting CodesBell System Technical Journal, 1950