Effective parallel multicore-optimized k-mers counting algorithm

DOI10.1007/978-3-662-49192-8_38MaRDI QIDQ2794384zbMATH OpenOpenAlexFDO

Authors Tomáš Farkaš, Peter Kubán, Maria Lucka

Publication date 10 March 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49192-8_38

zbMATH Keywords

parallel computationsortinggenome assemblybucket sort\(k\)-mers counting

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Recommendations

• Fast approximation of frequent \(k\)-mers and applications to metagenomics
• Compression of Multiple k-Mer Sets by Iterative SPSS Decomposition
• A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches
• Space-Efficient Representation of Genomic k-Mer Count Tables
• scientific article; zbMATH DE number 1830949

Cited in

(6)

• Space-Efficient Representation of Genomic k-Mer Count Tables
• Robust k-mer frequency estimation using gapped k-mers
• Fast approximation of frequent \(k\)-mers and applications to metagenomics
• Accurate \(k\)-mer classification using read profiles
• Fast gapped \(k\)-mer counting with subdivided multi-way bucketed cuckoo hash tables
• A randomized parallel algorithm for efficiently finding near-optimal universal hitting sets

Describes a project that uses

Uses Software

• Turtle
• KMC
• KAnalyze
• OpenMPI

This page was built for publication: Effective parallel multicore-optimized \(k\)-mers counting algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2794384)