A bit-string longest-common-subsequence algorithm

DOI10.1016/0020-0190(86)90091-8zbMath1455.68290OpenAlexW1994790623WikidataQ62654309 ScholiaQ62654309MaRDI QIDQ1996891

Trevor I. Dix, Lloyd Allison

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)

Related Items (7)

LCS\(k\): a refined similarity measure ⋮ Linear-space S-table algorithms for the longest common subsequence problem ⋮ From senses to texts: an all-in-one graph-based approach for measuring semantic similarity ⋮ Unnamed Item ⋮ An efficient algorithm for LCS problem between two arbitrary sequences ⋮ Mining Bit-Parallel LCS-length Algorithms ⋮ A fast and practical bit-vector algorithm for the longest common subsequence problem

Cites Work

• Unnamed Item
• Unnamed Item
• General methods of sequence comparison
• A longest common subsequence algorithm suitable for similar text strings
• The theory and computation of evolutionary distances: Pattern recognition
• On the Theory and Computation of Evolutionary Distances
• Bounds for the String Editing Problem
• Bounds on the Complexity of the Longest Common Subsequence Problem
• A fast algorithm for computing longest common subsequences
• Algorithms for the Longest Common Subsequence Problem
• The String-to-String Correction Problem

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