Efficient algorithms for two extensions of the LPF table: the power of Suffix Arrays

Maxime Crochemore; Costas S. Iliopoulos; Marcin Kubica; Wojciech Rytter; Tomasz Walen

Conference papers

Efficient algorithms for two extensions of the LPF table: the power of Suffix Arrays

Maxime Crochemore ^{1, 2} Costas S. Iliopoulos ¹ Marcin Kubica ³ Wojciech Rytter ³ Tomasz Walen ³

1 Informatics

2 LIGM - Laboratoire d'Informatique Gaspard-Monge

3 Institute of Informatics [Warsaw]

Document type :

Conference papers

Domain :

Computer Science [cs] / Data Structures and Algorithms [cs.DS]

Complete list of metadata

https://hal-upec-upem.archives-ouvertes.fr/hal-00741963
Contributor : Maxime Crochemore Connect in order to contact the contributor
Submitted on : Monday, October 15, 2012 - 3:43:08 PM
Last modification on : Saturday, January 15, 2022 - 3:58:08 AM

Efficient algorithms for two extensions of the LPF table: the power of Suffix Arrays

Identifiers

Collections

Citation

Export

Metrics

69

Efficient algorithms for two extensions of the LPF table: the power of Suffix Arrays

Identifiers

Collections

Citation

Export

Share

Metrics

69