APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †

DOI10.1080/01495739808947359MaRDI QIDQ4240887zbMATHOpenAlexFDO

Authors Guillaume Luce, Jean Frédéric Myoupo

Publication date 8 August 1999

Published in Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01495739808947359

zbMATH Keywords

VLSIlinear time systolic-based parallel algorithms

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• A systolic array for the longest common subsequence problem
• A faster linear systolic algorithm for recovering a longest common subsequence
• 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

Cites work

• A fast algorithm for computing longest common subsequences
• A fast algorithm for the longest-common-subsequence problem
• A faster algorithm computing string edit distances
• A linear space algorithm for computing maximal common subsequences
• A linear space algorithm for the LCS problem
• A longest common subsequence algorithm suitable for similar text strings
• A survey of multiple sequence comparison methods
• A systolic array for the longest common subsequence problem
• APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †
• Algorithms for approximate string matching
• Algorithms for the Longest Common Subsequence Problem
• An O(NP) sequence comparison algorithm
• An information-theoretic lower bound for the longest common subsequence problem
• Bounds for the String Editing Problem
• Fast linear-space computations of longest common subsequences
• New algorithms for the LCS problem
• On the number of alignments of k sequences
• Optimal Code Generation for Expression Trees
• Parallel Parsing on a One-Way Array of Finite-State Machines
• Performance analysis of some simple heuristics for computing longest common subsequences
• The Complexity of Some Problems on Subsequences and Supersequences
• The String-to-String Correction Problem
• The string merging problem
• VLSI architectures for string matching and pattern matching

Cited in

(3)

• A systolic array for the longest common subsequence problem
• APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †
• A neural network based guidance for a BRKGA: an application to the longest common square subsequence problem

This page was built for publication: APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †

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