Parallel comparison of run-length-encoded strings on a linear systolic array
type: Item
instance of: scholarly article
title: Parallel comparison of run-length-encoded strings on a linear systolic array
zbMATH Open document ID: 1142.68595
author: Alessandro Bogliolo
author: Valerio Freschi
published in: Information Sciences
publication date: 2007-02-16T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 5127685
zbMATH Keywords: algorithms
zbMATH Keywords: longest common subsequence
zbMATH Keywords: run-length encoding
zbMATH Keywords: systolic array
zbMATH Keywords: string comparison
MaRDI profile type: Publication
full work available at URL: j.ins.2006.07.024
OpenAlex ID: W1968300665
cites work: Matching for run-length encoded strings
cites work: Edit distance of run-length encoded strings.
cites work: An improved algorithm for computing the edit distance of run-length coded strings
cites work: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
cites work: Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
cites work: Modelling highly inflected languages
cites work: Compression of individual sequences via variable-rate coding
DOI: 10.1016/J.INS.2006.07.024
description: scientific article; zbMATH DE number 5127685