期刊
BIOINFORMATICS
卷 29, 期 6, 页码 802-804出版社
OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/btt042
关键词
-
类别
资金
- Agency for Innovation by Science and Technology of the Flemish government [SB-101609]
- Ghent University (MRP Bioinformatics: from nucleotides to networks)
We have developed essaMEM, a tool for finding maximal exact matches that can be used in genome comparison and read mapping. essaMEM enhances an existing sparse suffix array implementation with a sparse child array. Tests indicate that the enhanced algorithm for finding maximal exact matches is much faster, while maintaining the same memory footprint. In this way, sparse suffix arrays remain competitive with the more complex compressed suffix arrays. Availability: Source code is freely available at https://github.ugent.be/ComputationalBiology/essaMEM. Contact: Michael. Vyverman@UGent.be Supplementary information: Supplementary data are available at Bioinformatics online.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据