APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †
From MaRDI portal
Publication:4240887
DOI10.1080/01495739808947359zbMath0917.68096OpenAlexW2015695632MaRDI QIDQ4240887
Jean-Frédéric Myoupo, Guillaume Luce
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
Related Items
Cites Work
- An O(NP) sequence comparison algorithm
- On the number of alignments of k sequences
- A systolic array for the longest common subsequence problem
- New algorithms for the LCS problem
- A linear space algorithm for the LCS problem
- VLSI architectures for string matching and pattern matching
- A faster algorithm computing string edit distances
- The string merging problem
- A fast algorithm for the longest-common-subsequence problem
- A longest common subsequence algorithm suitable for similar text strings
- Fast linear-space computations of longest common subsequences
- A survey of multiple sequence comparison methods
- An information-theoretic lower bound for the longest common subsequence problem
- Performance analysis of some simple heuristics for computing longest common subsequences
- Algorithms for approximate string matching
- Parallel Parsing on a One-Way Array of Finite-State Machines
- A linear space algorithm for computing maximal common subsequences
- Bounds for the String Editing Problem
- Optimal Code Generation for Expression Trees
- A fast algorithm for computing longest common subsequences
- The Complexity of Some Problems on Subsequences and Supersequences
- Algorithms for the Longest Common Subsequence Problem
- APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †
- The String-to-String Correction Problem
