Axe: rapid, competitive sequence read demultiplexing using a trie
Date
2018
Authors
Murray, Kevin
Borevitz, Justin
Journal Title
Journal ISSN
Volume Title
Publisher
Oxford University Press
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.
Description
Keywords
Citation
Collections
Source
Bioinformatics
Type
Journal article
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description