A bit-string longest-common-subsequence algorithm

DOI10.1016/0020-0190(86)90091-8MaRDI QIDQ1996891zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Lloyd Allison, Trevor I. Dix

Publication date 27 February 2021

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

Full work available at URL https://doi.org/10.1016/0020-0190(86)90091-8

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 1516705 (Why is no real title available?)
• A fast algorithm for computing longest common subsequences
• A longest common subsequence algorithm suitable for similar text strings
• Algorithms for the Longest Common Subsequence Problem
• Bounds for the String Editing Problem
• Bounds on the Complexity of the Longest Common Subsequence Problem
• General methods of sequence comparison
• On the Theory and Computation of Evolutionary Distances
• The String-to-String Correction Problem
• The theory and computation of evolutionary distances: Pattern recognition

Cited in

(8)

• A substring-substring LCS data structure
• Tighter connections between Formula-SAT and shaving logs
• LCSk: a refined similarity measure
• Linear-space S-table algorithms for the longest common subsequence problem
• Mining Bit-Parallel LCS-length Algorithms
• A fast and practical bit-vector algorithm for the longest common subsequence problem
• An efficient algorithm for LCS problem between two arbitrary sequences
• From senses to texts: an all-in-one graph-based approach for measuring semantic similarity

This page was built for publication: A bit-string longest-common-subsequence algorithm

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