"A fast and practical bit-vector algorithm for the Longest Common ..."

Maxime Crochemore et al. (2001)

> Home

Details and statistics

DOI: 10.1016/S0020-0190(01)00182-X

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/CrochemoreIPR01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/CrochemoreIPR01
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón, James F. Reid:
A fast and practical bit-vector algorithm for the Longest Common Subsequence problem. Inf. Process. Lett. 80(6): 279-285 (2001)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.