A faster linear systolic algorithm for recovering a longest common subsequence

DOI10.1016/S0020-0190(97)00011-2zbMATH Open1337.68308OpenAlexW2080063304MaRDI QIDQ290200FDOQ290200

Authors: Thierry Lecroq, Guillaume Luce, Jean Frédéric Myoupo 

Publication date: 1 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00011-2

Recommendations

• A systolic array for the longest common subsequence problem
• An efficient systolic algorithm for the longest common subsequence problem
• Systolic-based parallel architecture for the longest common subsequences problem
• DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
• scientific article; zbMATH DE number 3984568

zbMATH Keywords

parallel algorithmslinear systolic arrayslongest common subsequence problemparallel architecturesVLSI

Mathematics Subject Classification ID

Algorithms on strings (68W32) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cites Work

• A systolic array for the longest common subsequence problem
• A faster algorithm computing string edit distances
• Efficient Parallel Algorithms for String Editing and Related Problems
• A linear space algorithm for computing maximal common subsequences
• Longest common subsequences

Cited In (7)

• Title not available (Why is that?)
• An efficient systolic algorithm for the longest common subsequence problem
• Improved linear systolic algorithms for substring statistics
• A systolic array for the longest common subsequence problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM

This page was built for publication: A faster linear systolic algorithm for recovering a longest common subsequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290200)