Jianqiao (Lawrence) Hu
Jianqiao (Lawrence) Hu
Home
Posts
Projects
Talks
Publications
Contact
CV
Light
Dark
Automatic
Source Themes
TrieDedup: A fast trie-based deduplication algorithm to handle ambiguous bases in high-throughput sequencing
We proposed and implemented TrieDedup to efficiently and accurately deduplicate high-throughput sequencing experiments while accounting for sequencing artifacts. TrieDedup uses trie (prefix tree) structure to compare and store sequences. Our benchmark experiments show TrieDedup can deduplicate reads up to 160-fold faster than pairwise comparison at a cost of 36-fold higher memory usage.
Jianqiao (Lawrence) Hu
,
Sai Luo
,
Ming Tian
,
Adam Yongxin Ye
PDF
Cite
Code
Dataset
Poster
Video
Source Document
DOI
Custom Link
Cite
×