Parallel comparison of run-length-encoded strings on a linear systolic array

DOI10.1016/J.INS.2006.07.024zbMath1142.68595OpenAlexW1968300665MaRDI QIDQ867612

Valerio Freschi, Alessandro Bogliolo

Publication date: 16 February 2007

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2006.07.024

zbMATH Keywords

algorithmsrun-length encodingsystolic arraylongest common subsequencestring comparison

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10)

Cites Work

• An improved algorithm for computing the edit distance of run-length coded strings
• Matching for run-length encoded strings
• Edit distance of run-length encoded strings.
• Modelling highly inflected languages
• Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
• Compression of individual sequences via variable-rate coding
• A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices

This page was built for publication: Parallel comparison of run-length-encoded strings on a linear systolic array