book chapter · Encyclopedia of Algorithms · 2014

Compressed Suffix Array

Djamal Belazzougui, VeliMä kinen, Daniel Valenzuela

Cited by 2Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Belazzougui, D., kinen, V., & Valenzuela, D. (2014). Compressed Suffix Array. Encyclopedia of Algorithms, 1–6. https://doi.org/10.1007/978-3-642-27848-8_82-2

MLA 9

Belazzougui, Djamal, et al. “Compressed Suffix Array.” Encyclopedia of Algorithms, 2014, pp. 1–6, https://doi.org/10.1007/978-3-642-27848-8_82-2.

Chicago

Belazzougui, Djamal, VeliMä kinen, and Daniel Valenzuela. 2014. “Compressed Suffix Array.” Encyclopedia of Algorithms: 1–6. https://doi.org/10.1007/978-3-642-27848-8_82-2.

Harvard

Belazzougui, D., kinen, V. and Valenzuela, D. (2014) ‘Compressed Suffix Array’, Encyclopedia of Algorithms, pp. 1–6. Available at: https://doi.org/10.1007/978-3-642-27848-8_82-2.

BibTeX

@incollection{belazzougui2014compressed,
  title = {{Compressed Suffix Array}},
  author = {Belazzougui, Djamal and kinen, VeliMä and Valenzuela, Daniel},
  booktitle = {Encyclopedia of Algorithms},
  pages = {1--6},
  year = {2014},
  doi = {10.1007/978-3-642-27848-8_82-2}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.