Skip navigation
Skip navigation

Axe: rapid, competitive sequence read demultiplexing using a trie

Murray, Kevin; Borevitz, Justin


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.

CollectionsANU Research Publications
Date published: 2018
Type: Journal article
Source: Bioinformatics
DOI: 10.1093/bioinformatics/bty432


File Description SizeFormat Image
01_Murray_Axe%3A_rapid%2C_competitive_2018.pdf179.81 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator