Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1093/bioinformatics/btt042 | BIOINFORMATICS |
Field | DocType | Volume |
Suffix,Computer science,Source code,Sparse approximation,Algorithm,Theoretical computer science,Suffix array,Compressed suffix array,Memory footprint,Genome comparison | Journal | 29 |
Issue | ISSN | Citations |
6 | 1367-4803 | 13 |
PageRank | References | Authors |
0.74 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michaël Vyverman | 1 | 20 | 1.87 |
| Bernard De Baets | 2 | 2994 | 300.39 |
| Veerle Fack | 3 | 84 | 11.22 |
| Peter Dawyndt | 4 | 83 | 9.01 |