Skip to Main content Skip to Navigation
Journal articles

Fast computation of a longest increasing subsequence and application

Maxime Crochemore 1, 2 Ely Porat 3
1 Informatics
2 LIGM - Laboratoire d'Informatique Gaspard-Monge
3 DCS - Department of Computer Science
Document type :
Journal articles
Complete list of metadata
https://hal-upec-upem.archives-ouvertes.fr/hal-00742044
Contributor : Maxime Crochemore <>
Submitted on : Monday, October 15, 2012 - 4:54:17 PM
Last modification on : Wednesday, February 3, 2021 - 7:54:26 AM

Links full text

openaccess

Identifiers

Collections

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

Citation

Maxime Crochemore, Ely Porat. Fast computation of a longest increasing subsequence and application. Information and Computation, Elsevier, 2010, 208 (9), pp.1054-1059. ⟨10.1016/j.ic.2010.04.003⟩. ⟨hal-00742044⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

195