Skip to main content
Conference Proceedings

Succinct gapped suffix arrays

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 7024 LNCS 290-294
DOI: 10.1007/978-3-642-24583-1_28
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Gapped suffix arrays (also known as bi-factor arrays) were recently presented for approximate searching under the Hamming distance. These structures can be used to find occurrences of a pattern P, where the characters inside a gap do not have to match. This paper describes a succinct representation of gapped suffix arrays. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Russo, L. M. S., & Tischler, G. (2011). Succinct gapped suffix arrays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7024 LNCS, pp. 290–294). Springer Verlag. https://doi.org/10.1007/978-3-642-24583-1_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free