Axe: Rapid, competitive sequence read demultiplexing using a trie

Kevin D. Murray*, Justin O. Borevitz

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    52 Citations (Scopus)

    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 informationSupplementary dataare available at Bioinformatics online.

    Original languageEnglish
    Pages (from-to)3924-3925
    Number of pages2
    JournalBioinformatics
    Volume34
    Issue number22
    DOIs
    Publication statusPublished - 15 Nov 2018

    Fingerprint

    Dive into the research topics of 'Axe: Rapid, competitive sequence read demultiplexing using a trie'. Together they form a unique fingerprint.

    Cite this