An algorithm for distinguishing efficiently bit-strings by their subsequences
type: Item
instance of: scholarly article
title: An algorithm for distinguishing efficiently bit-strings by their subsequences
zbMATH Open document ID: 0724.68044
DOI: 10.1016/0304-3975(91)90170-7
published in: Theoretical Computer Science
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 4195180
zbMATH Keywords: shortest subsequence
zbMATH Keywords: factorizing strings
author: Jean-Jacques Hébrard
MaRDI profile type: Publication
full work available at URL: 0304-3975(91)90170-7
OpenAlex ID: W1971915878
cites work: Calcul de la distance par les sous-mots
cites work: A linear space algorithm for the LCS problem
cites work: Q3659988
cites work: A faster algorithm computing string edit distances
cites work: A longest common subsequence algorithm suitable for similar text strings
description: scientific article; zbMATH DE number 4195180