"Computing the longest common substring with one mismatch."

Maxim A. Babenko, Tatiana Starikovskaya (2011)

> Home

Details and statistics

DOI: 10.1134/S0032946011010030

access: closed

type: Journal Article

metadata version: 2019-10-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/poit/BabenkoS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/poit/BabenkoS11
Maxim A. Babenko, Tatiana Starikovskaya:
Computing the longest common substring with one mismatch. Probl. Inf. Transm. 47(1): 28-33 (2011)

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.