Name
Abstract | ||
|---|---|---|
Efficient text indexing data structures have enabled large-scale genomic sequence analysis and are used to help solve problems ranging from assembly to read mapping. However, these data structures typically assume that the underlying reference text is static and will not change over the course of the queries being made. Some progress has been made in exploring how certain text indices, like the suffix array, may be updated, rather than rebuilt from scratch, when the underlying reference changes. Yet, these update operations can be complex in practice, difficult to implement, and give fairly pessimistic worst-case bounds. We present a novel data structure, SkipPatch, for maintaining a k-mer-based index over a dynamically changing genome. SkipPatch pairs a hash-based k-mer index with an indexable skip list that is used to efficiently maintain the set of edits that have been applied to the original genome. SkipPatch is practically fast, significantly outperforming the dynamic extended suffix array in terms of update and query speed. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Genomics | Genome,Data mining,Data structure,Computer science,Skip list,Search engine indexing,Suffix array,Theoretical computer science,Ranging,Hash function,Bioinformatics |
DocType | Volume | Citations |
Journal | abs/1604.03132 | 0 |
PageRank | References | Authors |
0.34 | 5 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nitish Gupta | 1 | 17 | 4.70 |
| Komal Sanjeev | 2 | 0 | 0.34 |
| Tim Wall | 3 | 0 | 0.34 |
| Carl Kingsford | 4 | 695 | 54.27 |
| Rob Patro | 5 | 111 | 12.98 |