Skip to Main content Skip to Navigation
Journal articles

Computing Longest Previous non-overlapping Factors

Maxime Crochemore 1, 2 German Tischler 1
1 Informatics
2 LIGM - Laboratoire d'Informatique Gaspard-Monge
Document type :
Journal articles
Complete list of metadata
https://hal-upec-upem.archives-ouvertes.fr/hal-00742050
Contributor : Maxime Crochemore <>
Submitted on : Monday, October 15, 2012 - 5:09:21 PM
Last modification on : Wednesday, February 3, 2021 - 7:54:26 AM

Identifiers

  • HAL Id : hal-00742050, version 1

Collections

CNRS | UNIV-MLV | PARISTECH | LIGM_ALGO | LIGM | ENPC | UPEC-UPEM | LIGM_MOA

Citation

Maxime Crochemore, German Tischler. Computing Longest Previous non-overlapping Factors. Information Processing Letters, Elsevier, 2011, 111 (6), pp.291-295. ⟨hal-00742050⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

354